oj.uz

Submission #789034

# Submission time Handle Problem Language Result Execution time Memory
789034 2023-07-20T21:57:25 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 1000 ms 26516 KB 
#include <iostream>
#include <set>
#include <algorithm>
#define int long long
 
using namespace std;
 
const int nmax = 3e5 + 7;
 
int v[nmax], b[nmax], cnt[nmax], n, k;
int unu = 1;

struct pairing {
    int first, second;
    const bool operator < (pairing a) const {
        if(first != a.first) {
            return first < a.first;
        } else {
            return second > a.second;
        }
    }
};
 
bool check(int x) {
    int sum = 0;
    for(int i = 1; i <= n; i ++) {
        int curr = x / v[i];
        if(v[i] * curr < x) {
            curr ++;
        }
        sum += curr;
    }
    if(sum <= n * k) {
        return 1;
    }
    return 0;
}
 
int32_t main() {
    int test = 1;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> v[i];
    } 
    for(int i = 1; i <= n; i ++){
        cin >> b[i];
        if(v[i] != b[i]) {
            test = 1;
        }
    }
    if(!test) {
        int l = 0, r = 1e18 * 2;
        while(l <= r) {
            int mid = (l + r) / 2;
            if(check(mid) == 1) {
                l = mid + 1;
            } else {
                r = mid - 1;
            }
        }
        cout << max(unu, r);
        return 0;
    }
    set<pairing> pq;
    for(int i = 1; i <= n; i ++) {
        pq.insert({max(v[i], b[i]), i});
        cnt[i] = 1;
    }
    for(int i = 2; i <= k; i ++) {
        for(int j = 1; j <= n; j ++) {
            pairing curr = *(pq.begin());
            int sum = curr.first, ind = curr.second;
            pq.erase({sum, ind});
            if(cnt[ind] < k) {
                sum += max(v[ind], b[ind]);
                cnt[ind] ++;
            } else {
                sum +=  b[ind];
            }
            pq.insert({sum, ind});
        }
    } 
    int minn = 1e18;
    for(auto it : pq) {
        // cout << it.first << " " << it.second << endl;
        minn = min(minn, it.first);
    }
    cout << minn;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 317 ms 26296 KB Output is correct
12 Correct 307 ms 26376 KB Output is correct
13 Correct 186 ms 26260 KB Output is correct
14 Correct 182 ms 26248 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 127 ms 26116 KB Output is correct
17 Correct 248 ms 26516 KB Output is correct
18 Correct 295 ms 26272 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 127 ms 26116 KB Output is correct
3 Correct 248 ms 26516 KB Output is correct
4 Correct 295 ms 26272 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 308 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 165 ms 13332 KB Output is correct
14 Correct 112 ms 9032 KB Output is correct
15 Correct 76 ms 6808 KB Output is correct
16 Correct 91 ms 5560 KB Output is correct
17 Correct 26 ms 340 KB Output is correct
18 Correct 21 ms 320 KB Output is correct
19 Correct 17 ms 212 KB Output is correct
20 Correct 9 ms 320 KB Output is correct
21 Correct 9 ms 324 KB Output is correct
22 Correct 41 ms 644 KB Output is correct
23 Correct 43 ms 808 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 317 ms 26296 KB Output is correct
12 Correct 307 ms 26376 KB Output is correct
13 Correct 186 ms 26260 KB Output is correct
14 Correct 182 ms 26248 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 165 ms 13332 KB Output is correct
24 Correct 112 ms 9032 KB Output is correct
25 Correct 76 ms 6808 KB Output is correct
26 Correct 91 ms 5560 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 21 ms 320 KB Output is correct
29 Correct 17 ms 212 KB Output is correct
30 Correct 9 ms 320 KB Output is correct
31 Correct 9 ms 324 KB Output is correct
32 Correct 41 ms 644 KB Output is correct
33 Correct 43 ms 808 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 127 ms 26116 KB Output is correct
36 Correct 248 ms 26516 KB Output is correct
37 Correct 295 ms 26272 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 304 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 37 ms 800 KB Output is correct
46 Correct 10 ms 1204 KB Output is correct
47 Correct 7 ms 316 KB Output is correct
48 Correct 49 ms 4844 KB Output is correct
49 Correct 2 ms 212 KB Output is correct
50 Correct 33 ms 312 KB Output is correct
51 Correct 46 ms 724 KB Output is correct
52 Correct 9 ms 324 KB Output is correct
53 Correct 25 ms 212 KB Output is correct
54 Correct 29 ms 320 KB Output is correct
55 Correct 157 ms 13224 KB Output is correct
56 Correct 101 ms 8984 KB Output is correct
57 Correct 105 ms 9032 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 308 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 165 ms 13332 KB Output is correct
10 Correct 112 ms 9032 KB Output is correct
11 Correct 76 ms 6808 KB Output is correct
12 Correct 91 ms 5560 KB Output is correct
13 Correct 26 ms 340 KB Output is correct
14 Correct 21 ms 320 KB Output is correct
15 Correct 17 ms 212 KB Output is correct
16 Correct 9 ms 320 KB Output is correct
17 Correct 9 ms 324 KB Output is correct
18 Correct 41 ms 644 KB Output is correct
19 Correct 43 ms 808 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 127 ms 26116 KB Output is correct
22 Correct 248 ms 26516 KB Output is correct
23 Correct 295 ms 26272 KB Output is correct
24 Execution timed out 1072 ms 4376 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 4 ms 724 KB Output is correct
11 Correct 317 ms 26296 KB Output is correct
12 Correct 307 ms 26376 KB Output is correct
13 Correct 186 ms 26260 KB Output is correct
14 Correct 182 ms 26248 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 304 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 308 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 165 ms 13332 KB Output is correct
24 Correct 112 ms 9032 KB Output is correct
25 Correct 76 ms 6808 KB Output is correct
26 Correct 91 ms 5560 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 21 ms 320 KB Output is correct
29 Correct 17 ms 212 KB Output is correct
30 Correct 9 ms 320 KB Output is correct
31 Correct 9 ms 324 KB Output is correct
32 Correct 41 ms 644 KB Output is correct
33 Correct 43 ms 808 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 304 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 37 ms 800 KB Output is correct
42 Correct 10 ms 1204 KB Output is correct
43 Correct 7 ms 316 KB Output is correct
44 Correct 49 ms 4844 KB Output is correct
45 Correct 2 ms 212 KB Output is correct
46 Correct 33 ms 312 KB Output is correct
47 Correct 46 ms 724 KB Output is correct
48 Correct 9 ms 324 KB Output is correct
49 Correct 25 ms 212 KB Output is correct
50 Correct 29 ms 320 KB Output is correct
51 Correct 157 ms 13224 KB Output is correct
52 Correct 101 ms 8984 KB Output is correct
53 Correct 105 ms 9032 KB Output is correct
54 Execution timed out 1072 ms 4376 KB Time limit exceeded
55 Halted 0 ms 0 KB -