# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
842802 | 2023-09-03T11:39:19 Z | _Avocado_ | Self Study (JOI22_ho_t2) | C++14 | 432 ms | 5140 KB |
#include <bits/stdc++.h> #define int int64_t using namespace std; int n, m; int up(int a, int b){ int ret = a/b; if(a%b) ++ret; return ret; } int check(int x, auto&a, auto&b){ int extra = 0; for(int i = 0; i<n; ++i){ int days = up(x, a[i]); if(days <= m){ extra -= (m-days); assert(days == 1); } else{ int rest = x - (m*a[i]); assert(rest > 0); int extra_days = up(rest, b[i]); assert(extra_days > 0); extra += extra_days; } } if(extra <= 0) return 1; return 0; } int bsearch(auto&a, auto&b){ int l = -1; int r = 1e18+18; while(r-l > 1){ int x = (r+l)/2; if(check(x, a, b)) l = x; else r = x; } return l; } signed main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); //freopen("input.in", "r", stdin); //freopen("output.out", "w", stdout); cin>>n>>m; vector<int>a(n); for(auto&u: a) cin>>u; vector<int>b(n); for(auto&u: b) cin>>u; for(int i = 0; i<n; ++i){ if(a[i] < b[i]) a[i] = b[i]; } cout<<bsearch(a, b); cout<<'\n'; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 4 ms | 344 KB | Output is correct |
11 | Correct | 210 ms | 5096 KB | Output is correct |
12 | Correct | 206 ms | 5136 KB | Output is correct |
13 | Correct | 209 ms | 4952 KB | Output is correct |
14 | Incorrect | 432 ms | 5140 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 760 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 4 ms | 344 KB | Output is correct |
11 | Correct | 210 ms | 5096 KB | Output is correct |
12 | Correct | 206 ms | 5136 KB | Output is correct |
13 | Correct | 209 ms | 4952 KB | Output is correct |
14 | Incorrect | 432 ms | 5140 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 760 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 1 ms | 344 KB | Output is correct |
6 | Correct | 0 ms | 344 KB | Output is correct |
7 | Correct | 0 ms | 344 KB | Output is correct |
8 | Correct | 0 ms | 344 KB | Output is correct |
9 | Correct | 1 ms | 344 KB | Output is correct |
10 | Correct | 4 ms | 344 KB | Output is correct |
11 | Correct | 210 ms | 5096 KB | Output is correct |
12 | Correct | 206 ms | 5136 KB | Output is correct |
13 | Correct | 209 ms | 4952 KB | Output is correct |
14 | Incorrect | 432 ms | 5140 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |