oj.uz

답안 #789020

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789020 2023-07-20T21:18:26 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 346 ms 26276 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() {
    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 = 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

# 결과 실행 시간 메모리 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 4 ms 596 KB Output is correct
11 Correct 285 ms 26028 KB Output is correct
12 Correct 292 ms 26100 KB Output is correct
13 Correct 181 ms 26276 KB Output is correct
14 Correct 188 ms 26088 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 126 ms 26032 KB Output is correct
17 Correct 248 ms 26036 KB Output is correct
18 Correct 284 ms 26108 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 126 ms 26032 KB Output is correct
3 Correct 248 ms 26036 KB Output is correct
4 Correct 284 ms 26108 KB Output is correct
5 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 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 168 ms 13324 KB Output is correct
14 Correct 127 ms 8900 KB Output is correct
15 Correct 95 ms 6704 KB Output is correct
16 Correct 90 ms 5468 KB Output is correct
17 Correct 26 ms 340 KB Output is correct
18 Correct 20 ms 212 KB Output is correct
19 Correct 16 ms 212 KB Output is correct
20 Correct 9 ms 212 KB Output is correct
21 Correct 10 ms 316 KB Output is correct
22 Correct 41 ms 716 KB Output is correct
23 Correct 43 ms 696 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 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 4 ms 596 KB Output is correct
11 Correct 285 ms 26028 KB Output is correct
12 Correct 292 ms 26100 KB Output is correct
13 Correct 181 ms 26276 KB Output is correct
14 Correct 188 ms 26088 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 1 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 168 ms 13324 KB Output is correct
24 Correct 127 ms 8900 KB Output is correct
25 Correct 95 ms 6704 KB Output is correct
26 Correct 90 ms 5468 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 20 ms 212 KB Output is correct
29 Correct 16 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 10 ms 316 KB Output is correct
32 Correct 41 ms 716 KB Output is correct
33 Correct 43 ms 696 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 126 ms 26032 KB Output is correct
36 Correct 248 ms 26036 KB Output is correct
37 Correct 284 ms 26108 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 1 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 1 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 36 ms 724 KB Output is correct
46 Correct 9 ms 988 KB Output is correct
47 Correct 7 ms 400 KB Output is correct
48 Correct 48 ms 4624 KB Output is correct
49 Correct 2 ms 212 KB Output is correct
50 Correct 33 ms 332 KB Output is correct
51 Correct 45 ms 724 KB Output is correct
52 Correct 9 ms 316 KB Output is correct
53 Correct 24 ms 212 KB Output is correct
54 Correct 28 ms 212 KB Output is correct
55 Correct 163 ms 13092 KB Output is correct
56 Correct 102 ms 8904 KB Output is correct
57 Correct 101 ms 8900 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 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 168 ms 13324 KB Output is correct
10 Correct 127 ms 8900 KB Output is correct
11 Correct 95 ms 6704 KB Output is correct
12 Correct 90 ms 5468 KB Output is correct
13 Correct 26 ms 340 KB Output is correct
14 Correct 20 ms 212 KB Output is correct
15 Correct 16 ms 212 KB Output is correct
16 Correct 9 ms 212 KB Output is correct
17 Correct 10 ms 316 KB Output is correct
18 Correct 41 ms 716 KB Output is correct
19 Correct 43 ms 696 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 126 ms 26032 KB Output is correct
22 Correct 248 ms 26036 KB Output is correct
23 Correct 284 ms 26108 KB Output is correct
24 Correct 50 ms 980 KB Output is correct
25 Correct 142 ms 4996 KB Output is correct
26 Correct 32 ms 1364 KB Output is correct
27 Correct 286 ms 10668 KB Output is correct
28 Correct 286 ms 10828 KB Output is correct
29 Correct 323 ms 10672 KB Output is correct
30 Correct 346 ms 10712 KB Output is correct
31 Correct 336 ms 10776 KB Output is correct
32 Incorrect 328 ms 6148 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #5
0 / 9.0

# 결과 실행 시간 메모리 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 4 ms 596 KB Output is correct
11 Correct 285 ms 26028 KB Output is correct
12 Correct 292 ms 26100 KB Output is correct
13 Correct 181 ms 26276 KB Output is correct
14 Correct 188 ms 26088 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 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 1 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 168 ms 13324 KB Output is correct
24 Correct 127 ms 8900 KB Output is correct
25 Correct 95 ms 6704 KB Output is correct
26 Correct 90 ms 5468 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 20 ms 212 KB Output is correct
29 Correct 16 ms 212 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 10 ms 316 KB Output is correct
32 Correct 41 ms 716 KB Output is correct
33 Correct 43 ms 696 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 1 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 1 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 36 ms 724 KB Output is correct
42 Correct 9 ms 988 KB Output is correct
43 Correct 7 ms 400 KB Output is correct
44 Correct 48 ms 4624 KB Output is correct
45 Correct 2 ms 212 KB Output is correct
46 Correct 33 ms 332 KB Output is correct
47 Correct 45 ms 724 KB Output is correct
48 Correct 9 ms 316 KB Output is correct
49 Correct 24 ms 212 KB Output is correct
50 Correct 28 ms 212 KB Output is correct
51 Correct 163 ms 13092 KB Output is correct
52 Correct 102 ms 8904 KB Output is correct
53 Correct 101 ms 8900 KB Output is correct
54 Correct 50 ms 980 KB Output is correct
55 Correct 142 ms 4996 KB Output is correct
56 Correct 32 ms 1364 KB Output is correct
57 Correct 286 ms 10668 KB Output is correct
58 Correct 286 ms 10828 KB Output is correct
59 Correct 323 ms 10672 KB Output is correct
60 Correct 346 ms 10712 KB Output is correct
61 Correct 336 ms 10776 KB Output is correct
62 Incorrect 328 ms 6148 KB Output isn't correct
63 Halted 0 ms 0 KB -