# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
978727 | 2024-05-09T14:40:53 Z | DobromirAngelov | Self Study (JOI22_ho_t2) | C++14 | 280 ms | 10000 KB |
#include<bits/stdc++.h> #define endl '\n' using namespace std; const int MAXN=3e5+5; const long long INF=1e18+5; int n,m; long long a[MAXN]; long long b[MAXN]; bool check(long long val) { long long s=0; for(int i=1;i<=n;i++) { if(a[i]*m>=val) s+=(val+a[i]-1)/a[i]; else s+=m+(val-a[i]*m+b[i]-1)/b[i]; } if(s>1LL*n*m) return 0; return 1; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>n>>m; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=n;i++) cin>>b[i]; for(int i=1;i<=n;i++) a[i]=max(a[i],b[i]); long long l=1,r=INF; while(l<r) { long long mid=(l+r+1)/2; if(check(mid)) l=mid; else r=mid-1; } long long ans=INF; for(int i=1;i<=n;i++) ans=min(ans, a[i]); if(ans!=l) cout<<1/0<<endl; cout<<l<<endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2396 KB | Output is correct |
4 | Correct | 2 ms | 2392 KB | Output is correct |
5 | Correct | 1 ms | 2396 KB | Output is correct |
6 | Correct | 1 ms | 2396 KB | Output is correct |
7 | Correct | 1 ms | 2396 KB | Output is correct |
8 | Correct | 1 ms | 2396 KB | Output is correct |
9 | Correct | 1 ms | 2396 KB | Output is correct |
10 | Correct | 3 ms | 2396 KB | Output is correct |
11 | Correct | 142 ms | 4984 KB | Output is correct |
12 | Correct | 142 ms | 4944 KB | Output is correct |
13 | Correct | 137 ms | 5456 KB | Output is correct |
14 | Runtime error | 280 ms | 10000 KB | Execution killed with signal 4 |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 4700 KB | Execution killed with signal 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2396 KB | Output is correct |
4 | Correct | 2 ms | 2392 KB | Output is correct |
5 | Correct | 1 ms | 2396 KB | Output is correct |
6 | Correct | 1 ms | 2396 KB | Output is correct |
7 | Correct | 1 ms | 2396 KB | Output is correct |
8 | Correct | 1 ms | 2396 KB | Output is correct |
9 | Correct | 1 ms | 2396 KB | Output is correct |
10 | Correct | 3 ms | 2396 KB | Output is correct |
11 | Correct | 142 ms | 4984 KB | Output is correct |
12 | Correct | 142 ms | 4944 KB | Output is correct |
13 | Correct | 137 ms | 5456 KB | Output is correct |
14 | Runtime error | 280 ms | 10000 KB | Execution killed with signal 4 |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 4700 KB | Execution killed with signal 4 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 2396 KB | Output is correct |
2 | Correct | 0 ms | 2396 KB | Output is correct |
3 | Correct | 0 ms | 2396 KB | Output is correct |
4 | Correct | 2 ms | 2392 KB | Output is correct |
5 | Correct | 1 ms | 2396 KB | Output is correct |
6 | Correct | 1 ms | 2396 KB | Output is correct |
7 | Correct | 1 ms | 2396 KB | Output is correct |
8 | Correct | 1 ms | 2396 KB | Output is correct |
9 | Correct | 1 ms | 2396 KB | Output is correct |
10 | Correct | 3 ms | 2396 KB | Output is correct |
11 | Correct | 142 ms | 4984 KB | Output is correct |
12 | Correct | 142 ms | 4944 KB | Output is correct |
13 | Correct | 137 ms | 5456 KB | Output is correct |
14 | Runtime error | 280 ms | 10000 KB | Execution killed with signal 4 |
15 | Halted | 0 ms | 0 KB | - |