oj.uz

Submission #789042

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

struct pairing {
    long long first;
    int second;
    const bool operator < (pairing a) const {
        if(first != a.first) {
            return first < a.first;
        } else {
            return second > a.second;
        }
    }
};
 
bool check(long long x) {
    long long sum = 0;
    for(int i = 1; i <= n; i ++) {
        long long 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) {
        long long l = 0, r = 1e18;
        int opr = 0;
        while(l < r) {
            opr ++;
            long long mid = (l + r) / 2;
            if(check(mid) == 1) {
                l = mid + 1;
            } else {
                r = mid - 1;
            }
            if(opr == 100) {
                break;
            }
        }
        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());
            long long sum = curr.first;
            int 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});
        }
    } 
    long long 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 300 ms 22604 KB Output is correct
12 Correct 332 ms 22512 KB Output is correct
13 Correct 187 ms 22536 KB Output is correct
14 Correct 193 ms 22604 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 127 ms 22480 KB Output is correct
17 Correct 240 ms 22500 KB Output is correct
18 Correct 307 ms 22660 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 22480 KB Output is correct
3 Correct 240 ms 22500 KB Output is correct
4 Correct 307 ms 22660 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 156 ms 11448 KB Output is correct
14 Correct 110 ms 7700 KB Output is correct
15 Correct 76 ms 5792 KB Output is correct
16 Correct 91 ms 4680 KB Output is correct
17 Correct 27 ms 352 KB Output is correct
18 Correct 21 ms 212 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 212 KB Output is correct
22 Correct 41 ms 632 KB Output is correct
23 Correct 43 ms 596 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 300 ms 22604 KB Output is correct
12 Correct 332 ms 22512 KB Output is correct
13 Correct 187 ms 22536 KB Output is correct
14 Correct 193 ms 22604 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 156 ms 11448 KB Output is correct
24 Correct 110 ms 7700 KB Output is correct
25 Correct 76 ms 5792 KB Output is correct
26 Correct 91 ms 4680 KB Output is correct
27 Correct 27 ms 352 KB Output is correct
28 Correct 21 ms 212 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 212 KB Output is correct
32 Correct 41 ms 632 KB Output is correct
33 Correct 43 ms 596 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 127 ms 22480 KB Output is correct
36 Correct 240 ms 22500 KB Output is correct
37 Correct 307 ms 22660 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 37 ms 596 KB Output is correct
46 Correct 9 ms 980 KB Output is correct
47 Correct 7 ms 380 KB Output is correct
48 Correct 49 ms 4112 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 35 ms 212 KB Output is correct
51 Correct 45 ms 596 KB Output is correct
52 Correct 9 ms 212 KB Output is correct
53 Correct 25 ms 316 KB Output is correct
54 Correct 29 ms 212 KB Output is correct
55 Correct 161 ms 11340 KB Output is correct
56 Correct 100 ms 7628 KB Output is correct
57 Correct 103 ms 7676 KB Output is correct

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 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 156 ms 11448 KB Output is correct
10 Correct 110 ms 7700 KB Output is correct
11 Correct 76 ms 5792 KB Output is correct
12 Correct 91 ms 4680 KB Output is correct
13 Correct 27 ms 352 KB Output is correct
14 Correct 21 ms 212 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 212 KB Output is correct
18 Correct 41 ms 632 KB Output is correct
19 Correct 43 ms 596 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 127 ms 22480 KB Output is correct
22 Correct 240 ms 22500 KB Output is correct
23 Correct 307 ms 22660 KB Output is correct
24 Execution timed out 1078 ms 3644 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 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 300 ms 22604 KB Output is correct
12 Correct 332 ms 22512 KB Output is correct
13 Correct 187 ms 22536 KB Output is correct
14 Correct 193 ms 22604 KB Output is correct
15 Correct 0 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 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 156 ms 11448 KB Output is correct
24 Correct 110 ms 7700 KB Output is correct
25 Correct 76 ms 5792 KB Output is correct
26 Correct 91 ms 4680 KB Output is correct
27 Correct 27 ms 352 KB Output is correct
28 Correct 21 ms 212 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 212 KB Output is correct
32 Correct 41 ms 632 KB Output is correct
33 Correct 43 ms 596 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 37 ms 596 KB Output is correct
42 Correct 9 ms 980 KB Output is correct
43 Correct 7 ms 380 KB Output is correct
44 Correct 49 ms 4112 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 35 ms 212 KB Output is correct
47 Correct 45 ms 596 KB Output is correct
48 Correct 9 ms 212 KB Output is correct
49 Correct 25 ms 316 KB Output is correct
50 Correct 29 ms 212 KB Output is correct
51 Correct 161 ms 11340 KB Output is correct
52 Correct 100 ms 7628 KB Output is correct
53 Correct 103 ms 7676 KB Output is correct
54 Execution timed out 1078 ms 3644 KB Time limit exceeded
55 Halted 0 ms 0 KB -