oj.uz

Submission #789018

# Submission time Handle Problem Language Result Execution time Memory
789018 2023-07-20T21:12:46 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 330 ms 26116 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 = x;
    for(int i = 2; i <= n; i ++) {
        int curr = (v[1] * x) / v[i];
        if(v[i] * curr < v[1] * x) {
            curr ++;
        }
        sum += curr;
    }
    if(sum <= n * k) {
        return 1;
    }
    return 0;
}
 
int32_t main() {
    cin >> n >> k;
    for(int i = 1; i <= n; i ++) {
        cin >> v[i];
    } 
    for(int i = 1; i <= n; i ++){
        cin >> b[i];
    }
    if(n * k > 3e5) {
        sort(v + 1, v + n + 1);
        int l = 0, r = n * k;
        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 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 1 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 3 ms 596 KB Output is correct
11 Correct 330 ms 26116 KB Output is correct
12 Correct 281 ms 26068 KB Output is correct
13 Correct 183 ms 26068 KB Output is correct
14 Correct 180 ms 26060 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 125 ms 26072 KB Output is correct
17 Correct 242 ms 26000 KB Output is correct
18 Correct 303 ms 26020 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 125 ms 26072 KB Output is correct
3 Correct 242 ms 26000 KB Output is correct
4 Correct 303 ms 26020 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 1 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 193 ms 13212 KB Output is correct
14 Correct 110 ms 8904 KB Output is correct
15 Correct 93 ms 6756 KB Output is correct
16 Correct 91 ms 5460 KB Output is correct
17 Correct 26 ms 364 KB Output is correct
18 Correct 20 ms 316 KB Output is correct
19 Correct 16 ms 212 KB Output is correct
20 Correct 8 ms 312 KB Output is correct
21 Correct 8 ms 212 KB Output is correct
22 Correct 41 ms 768 KB Output is correct
23 Correct 47 ms 696 KB Output is correct

Subtask #3
27.0 / 27.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 1 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 3 ms 596 KB Output is correct
11 Correct 330 ms 26116 KB Output is correct
12 Correct 281 ms 26068 KB Output is correct
13 Correct 183 ms 26068 KB Output is correct
14 Correct 180 ms 26060 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 1 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 193 ms 13212 KB Output is correct
24 Correct 110 ms 8904 KB Output is correct
25 Correct 93 ms 6756 KB Output is correct
26 Correct 91 ms 5460 KB Output is correct
27 Correct 26 ms 364 KB Output is correct
28 Correct 20 ms 316 KB Output is correct
29 Correct 16 ms 212 KB Output is correct
30 Correct 8 ms 312 KB Output is correct
31 Correct 8 ms 212 KB Output is correct
32 Correct 41 ms 768 KB Output is correct
33 Correct 47 ms 696 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 125 ms 26072 KB Output is correct
36 Correct 242 ms 26000 KB Output is correct
37 Correct 303 ms 26020 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 1 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 724 KB Output is correct
46 Correct 10 ms 1060 KB Output is correct
47 Correct 7 ms 400 KB Output is correct
48 Correct 49 ms 4616 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 33 ms 308 KB Output is correct
51 Correct 53 ms 704 KB Output is correct
52 Correct 9 ms 320 KB Output is correct
53 Correct 24 ms 328 KB Output is correct
54 Correct 29 ms 212 KB Output is correct
55 Correct 153 ms 13004 KB Output is correct
56 Correct 101 ms 8904 KB Output is correct
57 Correct 100 ms 8808 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 1 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 193 ms 13212 KB Output is correct
10 Correct 110 ms 8904 KB Output is correct
11 Correct 93 ms 6756 KB Output is correct
12 Correct 91 ms 5460 KB Output is correct
13 Correct 26 ms 364 KB Output is correct
14 Correct 20 ms 316 KB Output is correct
15 Correct 16 ms 212 KB Output is correct
16 Correct 8 ms 312 KB Output is correct
17 Correct 8 ms 212 KB Output is correct
18 Correct 41 ms 768 KB Output is correct
19 Correct 47 ms 696 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 125 ms 26072 KB Output is correct
22 Correct 242 ms 26000 KB Output is correct
23 Correct 303 ms 26020 KB Output is correct
24 Incorrect 46 ms 980 KB Output isn't correct
25 Halted 0 ms 0 KB -

Subtask #5
0 / 9.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 1 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 3 ms 596 KB Output is correct
11 Correct 330 ms 26116 KB Output is correct
12 Correct 281 ms 26068 KB Output is correct
13 Correct 183 ms 26068 KB Output is correct
14 Correct 180 ms 26060 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 1 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 193 ms 13212 KB Output is correct
24 Correct 110 ms 8904 KB Output is correct
25 Correct 93 ms 6756 KB Output is correct
26 Correct 91 ms 5460 KB Output is correct
27 Correct 26 ms 364 KB Output is correct
28 Correct 20 ms 316 KB Output is correct
29 Correct 16 ms 212 KB Output is correct
30 Correct 8 ms 312 KB Output is correct
31 Correct 8 ms 212 KB Output is correct
32 Correct 41 ms 768 KB Output is correct
33 Correct 47 ms 696 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 1 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 724 KB Output is correct
42 Correct 10 ms 1060 KB Output is correct
43 Correct 7 ms 400 KB Output is correct
44 Correct 49 ms 4616 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 33 ms 308 KB Output is correct
47 Correct 53 ms 704 KB Output is correct
48 Correct 9 ms 320 KB Output is correct
49 Correct 24 ms 328 KB Output is correct
50 Correct 29 ms 212 KB Output is correct
51 Correct 153 ms 13004 KB Output is correct
52 Correct 101 ms 8904 KB Output is correct
53 Correct 100 ms 8808 KB Output is correct
54 Incorrect 46 ms 980 KB Output isn't correct
55 Halted 0 ms 0 KB -