Submission #703642

#TimeUsernameProblemLanguageResultExecution timeMemory
703642niterSelf Study (JOI22_ho_t2)C++14
10 / 100
295 ms7368 KiB
#include <iostream> #include <vector> #define loop(i,a,b) for(int i=a;i<b;i++) using namespace std; long long A[300050], B[300050], C[300050]; void db(){ cout << "\n"; } template<class T, class ...U> void db(T XXX, U ...YYY){ cout << XXX << " "; db(YYY...); } int main(){ // ios::sync_with_stdio(false); cin.tie(0); long long N, M; cin >> N >> M; loop(i,0,N) cin >> A[i]; loop(i,0,N) cin >> B[i]; loop(i,0,N) C[i] = max(A[i], B[i]); long long ok = 0, ng = 1LL << 60; auto check = [&](long long x) -> bool { long long day = 0, cost, day_test = 0; loop(i,0,N){ if(x <= C[i] * M) day += (x - 1) / C[i] + 1; else day += M + (x - C[i] * M - 1) / B[i] + 1; cost = x; cost -= min(((cost-1) / C[i] + 1), M) * C[i]; day_test += min(((cost-1) / C[i] + 1), M); if(cost > 0) day_test += ((cost-1) / B[i] + 1); //if(day != day_test) exit(0); if(day_test > N * M) return 0; } return 1; }; while(ng - ok > 1){ //db(); long long mid = (ng + ok) / 2; if(check(mid)) ok = mid; else ng = mid; } cout << ok << endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...