feat: add cf 746 div2

Author: bira37

Codeforces/Official Rounds/746/Div2A.cpp

@@ -0,0 +1,135 @@
+#include <algorithm>
+#include <bitset>
+#include <cassert>
+#include <chrono>
+#include <cmath>
+#include <complex>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <functional>
+#include <iomanip>
+#include <iostream>
+#include <iterator>
+#include <limits>
+#include <map>
+#include <numeric>
+#include <queue>
+#include <random>
+#include <set>
+#include <stack>
+#include <string>
+#include <tuple>
+#include <utility>
+#include <vector>
+
+#define int long long
+#define double long double
+#define ff first
+#define ss second
+#define endl '\n'
+#define ii pair<int, int>
+#define mp make_pair
+#define mt make_tuple
+#define DESYNC \
+ ios_base::sync_with_stdio(false); \
+ cin.tie(0); \
+ cout.tie(0)
+#define pb push_back
+#define vi vector<int>
+#define vii vector<ii>
+#define all(x) x.begin(), x.end()
+#define EPS 1e-9
+#define INF 1e18
+#define ROOT 1
+#define curtime chrono::steady_clock::now().time_since_epoch().count
+#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
+using ll = long long;
+using namespace std;
+const double PI = acos(-1);
+const int M = 1000000007;
+// const int M = 998244353;
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+inline int mod(int n, int m = M) {
+ int ret = n % m;
+ if (ret < 0) ret += m;
+ return ret;
+}
+
+int exp(int n, int k, int m = M) {
+ if (k == 0) return 1;
+ if (k == 1) return n;
+ int ax = exp(n, k / 2, m);
+ ax = mod(ax * ax, m);
+ if (k % 2) ax = mod(ax * n, m);
+ return ax;
+}
+
+int gcd(int a, int b) {
+ if (a == 0)
+ return b;
+ else
+ return gcd(b % a, a);
+}
+
+/* LIBRARY INCLUDES */
+
+/* END OF LIBRARY INCLUDES */
+
+/* TEMPLATE DEFINES */
+// #define FILE_INPUT
+// #define PRINT_TEST_CASE
+#define MULTIPLE_TEST_CASE
+
+/* SOLUTION CODE */
+
+void solution(int testcase) {
+#ifdef PRINT_TEST_CASE
+ cout << "Case #" << testcase << ": ";
+#endif
+ // Code starts here
+ int n;
+ cin >> n;
+ int h;
+ cin >> h;
+ vi v(n);
+ for (int &x : v) cin >> x;
+ sort(all(v), greater<int>());
+
+ int s = v[0] + v[1];
+ int x = h / s;
+
+ if (v[0] >= h) {
+ cout << 1 << endl;
+ return;
+ }
+
+ h -= x * s;
+
+ int ans = 2 * x;
+ if (h > 0) {
+ ans++;
+ h -= v[0];
+ }
+
+ if (h > 0) {
+ ans++;
+ h -= v[1];
+ }
+
+ cout << ans << endl;
+}
+
+#ifdef FILE_INPUT
+freopen("equal.in", "r", stdin);
+freopen("equal.out", "w", stdout);
+#endif
+
+int32_t main() {
+ DESYNC;
+ int t = 1;
+#ifdef MULTIPLE_TEST_CASE
+ cin >> t;
+#endif
+ for (int _testcase = 1; _testcase <= t; _testcase++) solution(_testcase);
+}

Codeforces/Official Rounds/746/Div2B.cpp

@@ -0,0 +1,131 @@
+#include <algorithm>
+#include <bitset>
+#include <cassert>
+#include <chrono>
+#include <cmath>
+#include <complex>
+#include <cstdio>
+#include <cstring>
+#include <ctime>
+#include <functional>
+#include <iomanip>
+#include <iostream>
+#include <iterator>
+#include <limits>
+#include <map>
+#include <numeric>
+#include <queue>
+#include <random>
+#include <set>
+#include <stack>
+#include <string>
+#include <tuple>
+#include <utility>
+#include <vector>
+
+#define int long long
+#define double long double
+#define ff first
+#define ss second
+#define endl '\n'
+#define ii pair<int, int>
+#define mp make_pair
+#define mt make_tuple
+#define DESYNC \
+ ios_base::sync_with_stdio(false); \
+ cin.tie(0); \
+ cout.tie(0)
+#define pb push_back
+#define vi vector<int>
+#define vii vector<ii>
+#define all(x) x.begin(), x.end()
+#define EPS 1e-9
+#define INF 1e18
+#define ROOT 1
+#define curtime chrono::steady_clock::now().time_since_epoch().count
+#define rep(i, beg, n, s) for (int i = beg; i < n; i += s)
+using ll = long long;
+using namespace std;
+const double PI = acos(-1);
+const int M = 1000000007;
+// const int M = 998244353;
+mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
+inline int mod(int n, int m = M) {
+ int ret = n % m;
+ if (ret < 0) ret += m;
+ return ret;
+}
+
+int exp(int n, int k, int m = M) {
+ if (k == 0) return 1;
+ if (k == 1) return n;
+ int ax = exp(n, k / 2, m);
+ ax = mod(ax * ax, m);
+ if (k % 2) ax = mod(ax * n, m);
+ return ax;
+}
+
+int gcd(int a, int b) {
+ if (a == 0)
+ return b;
+ else
+ return gcd(b % a, a);
+}
+
+/* LIBRARY INCLUDES */
+
+/* END OF LIBRARY INCLUDES */
+
+/* TEMPLATE DEFINES */
+// #define FILE_INPUT
+// #define PRINT_TEST_CASE
+#define MULTIPLE_TEST_CASE
+
+/* SOLUTION CODE */
+
+void solution(int testcase) {
+#ifdef PRINT_TEST_CASE
+ cout << "Case #" << testcase << ": ";
+#endif
+ // Code starts here
+ int n, k;
+ cin >> n >> k;
+ set<ii> s;
+ int v[n];
+ vi change(n, false);
+ for (int i = 0; i < n; i++) {
+ cin >> v[i];
+ if (i == 0 || i >= k || (n - 1 - i) >= k) {
+ s.insert(ii(v[i], i));
+ change[i] = true;
+ }
+ }
+
+ for (int i = 0; i < n; i++) {
+ if (!change[i]) continue;
+ v[i] = s.begin()->ff;
+ s.erase(s.begin());
+ }
+
+ for (int i = 1; i < n; i++) {
+ if (v[i] < v[i - 1]) {
+ cout << "NO" << endl;
+ return;
+ }
+ }
+ cout << "YES" << endl;
+}
+
+#ifdef FILE_INPUT
+freopen("equal.in", "r", stdin);
+freopen("equal.out", "w", stdout);
+#endif
+
+int32_t main() {
+ DESYNC;
+ int t = 1;
+#ifdef MULTIPLE_TEST_CASE
+ cin >> t;
+#endif
+ for (int _testcase = 1; _testcase <= t; _testcase++) solution(_testcase);
+}