Submission #1166538

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166538		Zero_OP	Self Study (JOI22_ho_t2)	C++20	0 / 100	133 ms	2788 KiB

Main

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r) - 1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define pb push_back
#define eb emplace_back
#define sz(v) (int)v.size()
#define sum_of(v) accumulate(all(v), 0ll)
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
      bool minimize(T& a, const T& b){
            if(a > b) return a = b, true;
            return false;
      }

template<typename T>
      bool maximize(T& a, const T& b){
            if(a < b) return a = b, true;
            return false;
      }

using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vb = vector<bool>;
using vc = vector<char>;
using vl = vector<ll>;
using vd = vector<db>;

using vpi = vector<pi>;
using vpl = vector<pl>;

void setIO(){
      ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
      freopen("task.inp", "r", stdin);
      freopen("task.out", "w", stdout);
#endif // LOCAL
}

const int MAX = 2e5 + 5;

int main(){
      setIO();

      int N, M;
      cin >> N >> M;
      vi A(N), B(N);

      FOR(i, 0, N) cin >> A[i];
      FOR(i, 0, N) cin >> B[i];

      ll l = 1, r = 1e18, ans = -1;
      while(l <= r){
            ll mid = l + r >> 1;

            ll uses = 0;

            FOR(i, 0, N){
                  if(A[i] <= B[i]){
                        uses += (mid + B[i] - 1) / B[i];
                        continue;
                  }

                  ll u = min(1LL * M, (mid + A[i] - 1) / A[i]);
                  ll v = max(0ll, (mid - 1LL * A[i] * u + B[i] - 1) / B[i]);
                  uses += u + v;
            }

            if(uses <= 1LL * N * M) ans = mid, l = mid + 1;
            else r = mid - 1;
      }

      cout << ans << '\n';

      return 0;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 25
• Subtask 3: 0 / 27
• Subtask 4: 0 / 29
• Subtask 5: 0 / 9