oj.uz

Submission #938050

# Submission time Handle Problem Language Result Execution time Memory
938050 2024-03-04T18:42:36 Z vjudge1 Self Study (JOI22_ho_t2) C++17
62 / 100
 303 ms 13320 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){
    vector<int> need(n);
    int left = 0;
    for(int i = 0; i<n; i++){
        int z = max(v[i].first, v[i].second);
        int k = (mid+z-1)/z;
        if(k > m) need[i] = mid-(m * z);
        else left+=m-k;
    }
    for(int i = 0; i<n && left >= 0; i++){
        left -= (need[i] + v[i].second - 1)/v[i].second;
    }
    return left>=0;
}

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 l = 0; int r = 1e18;
    while(r > l+1){
        int mid = (l+r)/2;
        if(check(mid)) l = mid;
        else r = mid;
    }
    cout<<l<<endl;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:28:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   28 |     for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
      |     ^~~
Main.cpp:28:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   28 |     for(auto& x : v) cin>>x.first; for(auto& x : v) cin>>x.second;
      |                                    ^~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 556 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 170 ms 13140 KB Output is correct
12 Correct 167 ms 13140 KB Output is correct
13 Correct 154 ms 11308 KB Output is correct
14 Correct 156 ms 11316 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 184 ms 8660 KB Output is correct
17 Correct 168 ms 13264 KB Output is correct
18 Correct 167 ms 12948 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 184 ms 8660 KB Output is correct
3 Correct 168 ms 13264 KB Output is correct
4 Correct 167 ms 12948 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 96 ms 6856 KB Output is correct
14 Correct 69 ms 4692 KB Output is correct
15 Correct 47 ms 3676 KB Output is correct
16 Correct 39 ms 2944 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 3 ms 348 KB Output is correct
23 Correct 3 ms 604 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 556 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 170 ms 13140 KB Output is correct
12 Correct 167 ms 13140 KB Output is correct
13 Correct 154 ms 11308 KB Output is correct
14 Correct 156 ms 11316 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 460 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 96 ms 6856 KB Output is correct
24 Correct 69 ms 4692 KB Output is correct
25 Correct 47 ms 3676 KB Output is correct
26 Correct 39 ms 2944 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 184 ms 8660 KB Output is correct
36 Correct 168 ms 13264 KB Output is correct
37 Correct 167 ms 12948 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 4 ms 856 KB Output is correct
46 Correct 6 ms 604 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 33 ms 2652 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 4 ms 604 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 95 ms 6724 KB Output is correct
56 Correct 54 ms 3928 KB Output is correct
57 Correct 54 ms 3928 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 460 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 96 ms 6856 KB Output is correct
10 Correct 69 ms 4692 KB Output is correct
11 Correct 47 ms 3676 KB Output is correct
12 Correct 39 ms 2944 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 3 ms 604 KB Output is correct
20 Correct 0 ms 344 KB Output is correct
21 Correct 184 ms 8660 KB Output is correct
22 Correct 168 ms 13264 KB Output is correct
23 Correct 167 ms 12948 KB Output is correct
24 Correct 42 ms 2404 KB Output is correct
25 Correct 110 ms 6196 KB Output is correct
26 Correct 23 ms 1632 KB Output is correct
27 Correct 183 ms 12936 KB Output is correct
28 Correct 192 ms 12816 KB Output is correct
29 Correct 195 ms 12816 KB Output is correct
30 Correct 221 ms 13084 KB Output is correct
31 Correct 276 ms 12884 KB Output is correct
32 Correct 223 ms 8532 KB Output is correct
33 Incorrect 303 ms 13320 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 556 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 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 0 ms 348 KB Output is correct
10 Correct 3 ms 604 KB Output is correct
11 Correct 170 ms 13140 KB Output is correct
12 Correct 167 ms 13140 KB Output is correct
13 Correct 154 ms 11308 KB Output is correct
14 Correct 156 ms 11316 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 460 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 96 ms 6856 KB Output is correct
24 Correct 69 ms 4692 KB Output is correct
25 Correct 47 ms 3676 KB Output is correct
26 Correct 39 ms 2944 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 3 ms 348 KB Output is correct
33 Correct 3 ms 604 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 4 ms 856 KB Output is correct
42 Correct 6 ms 604 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 33 ms 2652 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 4 ms 604 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 95 ms 6724 KB Output is correct
52 Correct 54 ms 3928 KB Output is correct
53 Correct 54 ms 3928 KB Output is correct
54 Correct 42 ms 2404 KB Output is correct
55 Correct 110 ms 6196 KB Output is correct
56 Correct 23 ms 1632 KB Output is correct
57 Correct 183 ms 12936 KB Output is correct
58 Correct 192 ms 12816 KB Output is correct
59 Correct 195 ms 12816 KB Output is correct
60 Correct 221 ms 13084 KB Output is correct
61 Correct 276 ms 12884 KB Output is correct
62 Correct 223 ms 8532 KB Output is correct
63 Incorrect 303 ms 13320 KB Output isn't correct
64 Halted 0 ms 0 KB -