# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
938002 | 2024-03-04T17:31:42 Z | Litusiano | Self Study (JOI22_ho_t2) | C++17 | 426 ms | 4956 KB |
#include<bits/stdc++.h> using namespace std; #define int long long #define endl "\n" vector<pair<int,int>> v; int n,m; bool check(int mid){ int tot = 0; for(auto x : v){ // if(tot > n*m) break; int mx = max(x.first,x.second); int need = (mid+mx-1)/mx; if(need < 0){ assert(1); continue; } if(need > m){ tot+=m; int k = (mid-mx*m + x.second-1); if(k < 0){ assert(1); continue; } tot+= (k)/x.second; } else tot+= need; } return tot <= n*m; } signed main(){ ios_base::sync_with_stdio(0); cin.tie(0); cin>>n>>m; v.resize(n); for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second; int low = 0; int high = 1e18+5; while(high > low+1){ int middle = (low+high)/2; if(check(middle)) low = middle; else high = middle; } cout<<low<<endl; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 3 ms | 528 KB | Output is correct |
11 | Correct | 200 ms | 4956 KB | Output is correct |
12 | Correct | 202 ms | 4956 KB | Output is correct |
13 | Correct | 209 ms | 4956 KB | Output is correct |
14 | Incorrect | 426 ms | 4952 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 103 ms | 2652 KB | Output is correct |
10 | Correct | 69 ms | 1880 KB | Output is correct |
11 | Correct | 51 ms | 1880 KB | Output is correct |
12 | Correct | 42 ms | 1368 KB | Output is correct |
13 | Correct | 1 ms | 344 KB | Output is correct |
14 | Correct | 0 ms | 344 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 348 KB | Output is correct |
18 | Incorrect | 8 ms | 348 KB | Output isn't correct |
19 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 3 ms | 528 KB | Output is correct |
11 | Correct | 200 ms | 4956 KB | Output is correct |
12 | Correct | 202 ms | 4956 KB | Output is correct |
13 | Correct | 209 ms | 4956 KB | Output is correct |
14 | Incorrect | 426 ms | 4952 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 0 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 103 ms | 2652 KB | Output is correct |
10 | Correct | 69 ms | 1880 KB | Output is correct |
11 | Correct | 51 ms | 1880 KB | Output is correct |
12 | Correct | 42 ms | 1368 KB | Output is correct |
13 | Correct | 1 ms | 344 KB | Output is correct |
14 | Correct | 0 ms | 344 KB | Output is correct |
15 | Correct | 0 ms | 348 KB | Output is correct |
16 | Correct | 0 ms | 348 KB | Output is correct |
17 | Correct | 0 ms | 348 KB | Output is correct |
18 | Incorrect | 8 ms | 348 KB | Output isn't correct |
19 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 0 ms | 348 KB | Output is correct |
9 | Correct | 0 ms | 348 KB | Output is correct |
10 | Correct | 3 ms | 528 KB | Output is correct |
11 | Correct | 200 ms | 4956 KB | Output is correct |
12 | Correct | 202 ms | 4956 KB | Output is correct |
13 | Correct | 209 ms | 4956 KB | Output is correct |
14 | Incorrect | 426 ms | 4952 KB | Output isn't correct |
15 | Halted | 0 ms | 0 KB | - |