oj.uz

답안 #789023

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789023 2023-07-20T21:23:29 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 341 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;
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() {
    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 * 2;
        while(l < r) {
            int mid = (l + r) / 2;
            if(check(mid) == 1) {
                l = mid + 1;
            } else {
                r = mid;
            }
        }
        while(check(r) == 0 && r > 1) {
            r --;
        }
        while(check(r + 1) == 1) {
            r ++;
        }
        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

# 결과 실행 시간 메모리 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 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 3 ms 596 KB Output is correct
11 Correct 338 ms 26108 KB Output is correct
12 Correct 285 ms 26112 KB Output is correct
13 Correct 185 ms 25988 KB Output is correct
14 Correct 215 ms 26064 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 124 ms 26060 KB Output is correct
17 Correct 244 ms 26056 KB Output is correct
18 Correct 340 ms 26116 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 124 ms 26060 KB Output is correct
3 Correct 244 ms 26056 KB Output is correct
4 Correct 340 ms 26116 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 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 152 ms 13120 KB Output is correct
14 Correct 125 ms 8908 KB Output is correct
15 Correct 81 ms 6756 KB Output is correct
16 Correct 90 ms 5460 KB Output is correct
17 Correct 27 ms 368 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 212 KB Output is correct
21 Correct 9 ms 316 KB Output is correct
22 Correct 41 ms 596 KB Output is correct
23 Correct 43 ms 596 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 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 3 ms 596 KB Output is correct
11 Correct 338 ms 26108 KB Output is correct
12 Correct 285 ms 26112 KB Output is correct
13 Correct 185 ms 25988 KB Output is correct
14 Correct 215 ms 26064 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 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 152 ms 13120 KB Output is correct
24 Correct 125 ms 8908 KB Output is correct
25 Correct 81 ms 6756 KB Output is correct
26 Correct 90 ms 5460 KB Output is correct
27 Correct 27 ms 368 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 212 KB Output is correct
31 Correct 9 ms 316 KB Output is correct
32 Correct 41 ms 596 KB Output is correct
33 Correct 43 ms 596 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 124 ms 26060 KB Output is correct
36 Correct 244 ms 26056 KB Output is correct
37 Correct 340 ms 26116 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 9 ms 980 KB Output is correct
47 Correct 7 ms 400 KB Output is correct
48 Correct 49 ms 4620 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 34 ms 212 KB Output is correct
51 Correct 56 ms 704 KB Output is correct
52 Correct 9 ms 212 KB Output is correct
53 Correct 25 ms 212 KB Output is correct
54 Correct 29 ms 212 KB Output is correct
55 Correct 154 ms 13004 KB Output is correct
56 Correct 123 ms 8904 KB Output is correct
57 Correct 103 ms 8852 KB Output is correct

Subtask #4
0 / 29.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 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 152 ms 13120 KB Output is correct
10 Correct 125 ms 8908 KB Output is correct
11 Correct 81 ms 6756 KB Output is correct
12 Correct 90 ms 5460 KB Output is correct
13 Correct 27 ms 368 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 212 KB Output is correct
17 Correct 9 ms 316 KB Output is correct
18 Correct 41 ms 596 KB Output is correct
19 Correct 43 ms 596 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 124 ms 26060 KB Output is correct
22 Correct 244 ms 26056 KB Output is correct
23 Correct 340 ms 26116 KB Output is correct
24 Correct 50 ms 1020 KB Output is correct
25 Correct 147 ms 2436 KB Output is correct
26 Correct 31 ms 724 KB Output is correct
27 Correct 312 ms 4980 KB Output is correct
28 Correct 288 ms 4976 KB Output is correct
29 Correct 287 ms 4928 KB Output is correct
30 Correct 311 ms 4976 KB Output is correct
31 Correct 341 ms 4980 KB Output is correct
32 Incorrect 323 ms 4980 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 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 3 ms 596 KB Output is correct
11 Correct 338 ms 26108 KB Output is correct
12 Correct 285 ms 26112 KB Output is correct
13 Correct 185 ms 25988 KB Output is correct
14 Correct 215 ms 26064 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 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 152 ms 13120 KB Output is correct
24 Correct 125 ms 8908 KB Output is correct
25 Correct 81 ms 6756 KB Output is correct
26 Correct 90 ms 5460 KB Output is correct
27 Correct 27 ms 368 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 212 KB Output is correct
31 Correct 9 ms 316 KB Output is correct
32 Correct 41 ms 596 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 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 9 ms 980 KB Output is correct
43 Correct 7 ms 400 KB Output is correct
44 Correct 49 ms 4620 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 34 ms 212 KB Output is correct
47 Correct 56 ms 704 KB Output is correct
48 Correct 9 ms 212 KB Output is correct
49 Correct 25 ms 212 KB Output is correct
50 Correct 29 ms 212 KB Output is correct
51 Correct 154 ms 13004 KB Output is correct
52 Correct 123 ms 8904 KB Output is correct
53 Correct 103 ms 8852 KB Output is correct
54 Correct 50 ms 1020 KB Output is correct
55 Correct 147 ms 2436 KB Output is correct
56 Correct 31 ms 724 KB Output is correct
57 Correct 312 ms 4980 KB Output is correct
58 Correct 288 ms 4976 KB Output is correct
59 Correct 287 ms 4928 KB Output is correct
60 Correct 311 ms 4976 KB Output is correct
61 Correct 341 ms 4980 KB Output is correct
62 Incorrect 323 ms 4980 KB Output isn't correct
63 Halted 0 ms 0 KB -