Submission #703610

#TimeUsernameProblemLanguageResultExecution timeMemory
703610niterSelf Study (JOI22_ho_t2)C++14
0 / 100
293 ms5036 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]; 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]; 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 <= max(A[i], B[i]) * M) day += (x - 1) / max(A[i], B[i]) + 1; else day += M + (x - max(A[i], B[i]) * M - 1) / B[i] + 1; cost = x; cost -= min<long long>(((cost-1) / max(A[i], B[i]) + 1), M) * max(A[i], B[i]); if(x <= max(A[i], B[i]) * M) if(min<long long>(((cost-1) / max(A[i], B[i]) + 1), M) != M) exit(0); day_test += min<long long>(((cost-1) / max(A[i], B[i]) + 1), M); if(cost > 0) day_test += ((cost-1) / B[i] + 1); //if(day != day_test) exit(0); if(day > 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...