oj.uz

Submission #789028

# Submission time Handle Problem Language Result Execution time Memory
789028 2023-07-20T21:37:16 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 1000 ms 26108 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;
 
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 = 0;
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> v[i];
    } 
    for(int i = 1; i <= n; i ++){
        cin >> b[i];
        if(b[i] != v[i]) {
            test = 1;
        }
    }
    if(!test) {
        int l = 0, r = 1e18;
        while(l < r) {
            int mid = (l + r) / 2;
            if(check(mid) == 1) {
                l = mid + 1;
            } else {
                r = mid;
            }
        }
        while(check(r) == 0 && r > 0) {
            r --;
        }
        while(check(r + 1) == 1) {
            r ++;
        }
        //cout << 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 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 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 3 ms 596 KB Output is correct
11 Correct 281 ms 26076 KB Output is correct
12 Correct 286 ms 26060 KB Output is correct
13 Correct 181 ms 26060 KB Output is correct
14 Correct 205 ms 26036 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 398 ms 26100 KB Output is correct
17 Correct 332 ms 26108 KB Output is correct
18 Correct 407 ms 26036 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 398 ms 26100 KB Output is correct
3 Correct 332 ms 26108 KB Output is correct
4 Correct 407 ms 26036 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 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 223 ms 13212 KB Output is correct
14 Correct 152 ms 8908 KB Output is correct
15 Correct 102 ms 6648 KB Output is correct
16 Correct 116 ms 5368 KB Output is correct
17 Correct 29 ms 340 KB Output is correct
18 Correct 22 ms 212 KB Output is correct
19 Correct 18 ms 316 KB Output is correct
20 Correct 10 ms 212 KB Output is correct
21 Correct 9 ms 316 KB Output is correct
22 Correct 46 ms 696 KB Output is correct
23 Correct 46 ms 704 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 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 3 ms 596 KB Output is correct
11 Correct 281 ms 26076 KB Output is correct
12 Correct 286 ms 26060 KB Output is correct
13 Correct 181 ms 26060 KB Output is correct
14 Correct 205 ms 26036 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 223 ms 13212 KB Output is correct
24 Correct 152 ms 8908 KB Output is correct
25 Correct 102 ms 6648 KB Output is correct
26 Correct 116 ms 5368 KB Output is correct
27 Correct 29 ms 340 KB Output is correct
28 Correct 22 ms 212 KB Output is correct
29 Correct 18 ms 316 KB Output is correct
30 Correct 10 ms 212 KB Output is correct
31 Correct 9 ms 316 KB Output is correct
32 Correct 46 ms 696 KB Output is correct
33 Correct 46 ms 704 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 398 ms 26100 KB Output is correct
36 Correct 332 ms 26108 KB Output is correct
37 Correct 407 ms 26036 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 41 ms 724 KB Output is correct
46 Correct 10 ms 980 KB Output is correct
47 Correct 7 ms 340 KB Output is correct
48 Correct 49 ms 4652 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 35 ms 212 KB Output is correct
51 Correct 47 ms 704 KB Output is correct
52 Correct 9 ms 212 KB Output is correct
53 Correct 30 ms 212 KB Output is correct
54 Correct 31 ms 308 KB Output is correct
55 Correct 167 ms 13068 KB Output is correct
56 Correct 102 ms 8828 KB Output is correct
57 Correct 106 ms 8904 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 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 0 ms 212 KB Output is correct
9 Correct 223 ms 13212 KB Output is correct
10 Correct 152 ms 8908 KB Output is correct
11 Correct 102 ms 6648 KB Output is correct
12 Correct 116 ms 5368 KB Output is correct
13 Correct 29 ms 340 KB Output is correct
14 Correct 22 ms 212 KB Output is correct
15 Correct 18 ms 316 KB Output is correct
16 Correct 10 ms 212 KB Output is correct
17 Correct 9 ms 316 KB Output is correct
18 Correct 46 ms 696 KB Output is correct
19 Correct 46 ms 704 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 398 ms 26100 KB Output is correct
22 Correct 332 ms 26108 KB Output is correct
23 Correct 407 ms 26036 KB Output is correct
24 Execution timed out 1091 ms 4180 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 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 3 ms 596 KB Output is correct
11 Correct 281 ms 26076 KB Output is correct
12 Correct 286 ms 26060 KB Output is correct
13 Correct 181 ms 26060 KB Output is correct
14 Correct 205 ms 26036 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 1 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 223 ms 13212 KB Output is correct
24 Correct 152 ms 8908 KB Output is correct
25 Correct 102 ms 6648 KB Output is correct
26 Correct 116 ms 5368 KB Output is correct
27 Correct 29 ms 340 KB Output is correct
28 Correct 22 ms 212 KB Output is correct
29 Correct 18 ms 316 KB Output is correct
30 Correct 10 ms 212 KB Output is correct
31 Correct 9 ms 316 KB Output is correct
32 Correct 46 ms 696 KB Output is correct
33 Correct 46 ms 704 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 41 ms 724 KB Output is correct
42 Correct 10 ms 980 KB Output is correct
43 Correct 7 ms 340 KB Output is correct
44 Correct 49 ms 4652 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 35 ms 212 KB Output is correct
47 Correct 47 ms 704 KB Output is correct
48 Correct 9 ms 212 KB Output is correct
49 Correct 30 ms 212 KB Output is correct
50 Correct 31 ms 308 KB Output is correct
51 Correct 167 ms 13068 KB Output is correct
52 Correct 102 ms 8828 KB Output is correct
53 Correct 106 ms 8904 KB Output is correct
54 Execution timed out 1091 ms 4180 KB Time limit exceeded
55 Halted 0 ms 0 KB -