oj.uz

답안 #789021

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789021 2023-07-20T21:20:40 Z stefanneagu Self Study (JOI22_ho_t2) C++17
62 / 100
 338 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 = 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 << 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 1 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 284 ms 26040 KB Output is correct
12 Correct 287 ms 26112 KB Output is correct
13 Correct 180 ms 26052 KB Output is correct
14 Correct 178 ms 26116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 126 ms 26064 KB Output is correct
17 Correct 246 ms 26020 KB Output is correct
18 Correct 294 ms 26100 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 26064 KB Output is correct
3 Correct 246 ms 26020 KB Output is correct
4 Correct 294 ms 26100 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 1 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 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 160 ms 13216 KB Output is correct
14 Correct 134 ms 8908 KB Output is correct
15 Correct 77 ms 6644 KB Output is correct
16 Correct 90 ms 5460 KB Output is correct
17 Correct 26 ms 340 KB Output is correct
18 Correct 20 ms 316 KB Output is correct
19 Correct 16 ms 324 KB Output is correct
20 Correct 9 ms 212 KB Output is correct
21 Correct 9 ms 212 KB Output is correct
22 Correct 47 ms 596 KB Output is correct
23 Correct 43 ms 700 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 1 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 284 ms 26040 KB Output is correct
12 Correct 287 ms 26112 KB Output is correct
13 Correct 180 ms 26052 KB Output is correct
14 Correct 178 ms 26116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 160 ms 13216 KB Output is correct
24 Correct 134 ms 8908 KB Output is correct
25 Correct 77 ms 6644 KB Output is correct
26 Correct 90 ms 5460 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 20 ms 316 KB Output is correct
29 Correct 16 ms 324 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 9 ms 212 KB Output is correct
32 Correct 47 ms 596 KB Output is correct
33 Correct 43 ms 700 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 126 ms 26064 KB Output is correct
36 Correct 246 ms 26020 KB Output is correct
37 Correct 294 ms 26100 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 36 ms 732 KB Output is correct
46 Correct 11 ms 1108 KB Output is correct
47 Correct 7 ms 404 KB Output is correct
48 Correct 49 ms 4612 KB Output is correct
49 Correct 2 ms 212 KB Output is correct
50 Correct 38 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 212 KB Output is correct
54 Correct 29 ms 328 KB Output is correct
55 Correct 220 ms 13056 KB Output is correct
56 Correct 118 ms 8936 KB Output is correct
57 Correct 101 ms 8848 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 160 ms 13216 KB Output is correct
10 Correct 134 ms 8908 KB Output is correct
11 Correct 77 ms 6644 KB Output is correct
12 Correct 90 ms 5460 KB Output is correct
13 Correct 26 ms 340 KB Output is correct
14 Correct 20 ms 316 KB Output is correct
15 Correct 16 ms 324 KB Output is correct
16 Correct 9 ms 212 KB Output is correct
17 Correct 9 ms 212 KB Output is correct
18 Correct 47 ms 596 KB Output is correct
19 Correct 43 ms 700 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 126 ms 26064 KB Output is correct
22 Correct 246 ms 26020 KB Output is correct
23 Correct 294 ms 26100 KB Output is correct
24 Correct 51 ms 1024 KB Output is correct
25 Correct 143 ms 2396 KB Output is correct
26 Correct 34 ms 724 KB Output is correct
27 Correct 293 ms 5132 KB Output is correct
28 Correct 287 ms 4956 KB Output is correct
29 Correct 316 ms 4980 KB Output is correct
30 Correct 297 ms 4960 KB Output is correct
31 Correct 338 ms 4992 KB Output is correct
32 Incorrect 327 ms 5068 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 1 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 0 ms 212 KB Output is correct
10 Correct 3 ms 596 KB Output is correct
11 Correct 284 ms 26040 KB Output is correct
12 Correct 287 ms 26112 KB Output is correct
13 Correct 180 ms 26052 KB Output is correct
14 Correct 178 ms 26116 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 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 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 160 ms 13216 KB Output is correct
24 Correct 134 ms 8908 KB Output is correct
25 Correct 77 ms 6644 KB Output is correct
26 Correct 90 ms 5460 KB Output is correct
27 Correct 26 ms 340 KB Output is correct
28 Correct 20 ms 316 KB Output is correct
29 Correct 16 ms 324 KB Output is correct
30 Correct 9 ms 212 KB Output is correct
31 Correct 9 ms 212 KB Output is correct
32 Correct 47 ms 596 KB Output is correct
33 Correct 43 ms 700 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 36 ms 732 KB Output is correct
42 Correct 11 ms 1108 KB Output is correct
43 Correct 7 ms 404 KB Output is correct
44 Correct 49 ms 4612 KB Output is correct
45 Correct 2 ms 212 KB Output is correct
46 Correct 38 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 212 KB Output is correct
50 Correct 29 ms 328 KB Output is correct
51 Correct 220 ms 13056 KB Output is correct
52 Correct 118 ms 8936 KB Output is correct
53 Correct 101 ms 8848 KB Output is correct
54 Correct 51 ms 1024 KB Output is correct
55 Correct 143 ms 2396 KB Output is correct
56 Correct 34 ms 724 KB Output is correct
57 Correct 293 ms 5132 KB Output is correct
58 Correct 287 ms 4956 KB Output is correct
59 Correct 316 ms 4980 KB Output is correct
60 Correct 297 ms 4960 KB Output is correct
61 Correct 338 ms 4992 KB Output is correct
62 Incorrect 327 ms 5068 KB Output isn't correct
63 Halted 0 ms 0 KB -