oj.uz

답안 #576610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576610 2022-06-13T08:36:02 Z nghiass001 카니발 티켓 (IOI20_tickets) C++17
100 / 100
 657 ms 75904 KB 
#include <bits/stdc++.h>
#define FOR(i,l,r) for(int i=(l); i<=(r); ++i)
#define REP(i,l,r) for(int i=(l); i<(r); ++i)
#define FORD(i,r,l) for(int i=(r); i>=(l); --i)
#define REPD(i,r,l) for(int i=(r)-1; i>=(l); --i)
#define pii pair<int, int>
using namespace std;
const int INF = 0x3c3c3c3c;

void allocate_tickets( vector<vector<int>> _x);

long long find_maximum(int k, vector<vector<int>> d) {
    int n = d.size(), m = d[0].size();
    vector<int> num(n, 0);
    vector<int> a(n), cnt_left(n), lft(n, 0), rgt(n, m - 1);
    vector<vector<int>> ans(n, vector<int>(m, -1));
    long long res = 0;

    priority_queue<pii, vector<pii>, greater<pii>> Q;
    REP(i, 0, n) Q.emplace(d[i][0] + d[i][m - k], i);

    REP(i, 0, n * k / 2) {
        auto [val, u] = Q.top(); Q.pop();
        if (++num[u] < k) {
            int new_val = d[u][num[u]] + d[u][m - k + num[u]];
            Q.emplace(new_val, u);
        }
    }

    REP(i, 0, n) cnt_left[i] = num[i];
    REP(i, 0, n) a[i] = i;

    REP(i, 0, k) {
        sort(a.begin(), a.end(), [&] (int x, int y) { return cnt_left[x] < cnt_left[y]; });
        REP(j, 0, n) {
            int u = a[j];
            if (j < n/2) {
                ans[u][rgt[u]] = i;
                res += d[u][rgt[u]--];
            }
            else {
                --cnt_left[u];
                ans[u][lft[u]] = i;
                res -= d[u][lft[u]++];
            }
        }
    }

    allocate_tickets(ans);
    return res;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 2 ms 340 KB Output is correct
5 Correct 26 ms 2376 KB Output is correct
6 Correct 448 ms 51492 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 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 2 ms 440 KB Output is correct
5 Correct 19 ms 2532 KB Output is correct
6 Correct 507 ms 56800 KB Output is correct
7 Correct 534 ms 57172 KB Output is correct
8 Correct 4 ms 440 KB Output is correct
9 Correct 0 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 6 ms 756 KB Output is correct
13 Correct 16 ms 2132 KB Output is correct
14 Correct 17 ms 2104 KB Output is correct
15 Correct 497 ms 57780 KB Output is correct

Subtask #4
14.0 / 14.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 2 ms 340 KB Output is correct
5 Correct 28 ms 2304 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 639 ms 54272 KB Output is correct
9 Correct 628 ms 50560 KB Output is correct
10 Correct 657 ms 50636 KB Output is correct
11 Correct 648 ms 54200 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 436 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 2 ms 436 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 3 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 21 ms 3128 KB Output is correct
14 Correct 19 ms 3228 KB Output is correct
15 Correct 21 ms 3252 KB Output is correct
16 Correct 24 ms 3268 KB Output is correct
17 Correct 1 ms 308 KB Output is correct
18 Correct 2 ms 500 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 27 ms 2564 KB Output is correct
21 Correct 23 ms 3148 KB Output is correct
22 Correct 22 ms 2676 KB Output is correct
23 Correct 24 ms 3148 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 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 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 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 2 ms 340 KB Output is correct
11 Correct 26 ms 2376 KB Output is correct
12 Correct 448 ms 51492 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 2 ms 440 KB Output is correct
17 Correct 19 ms 2532 KB Output is correct
18 Correct 507 ms 56800 KB Output is correct
19 Correct 534 ms 57172 KB Output is correct
20 Correct 4 ms 440 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 6 ms 756 KB Output is correct
25 Correct 16 ms 2132 KB Output is correct
26 Correct 17 ms 2104 KB Output is correct
27 Correct 497 ms 57780 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 340 KB Output is correct
32 Correct 28 ms 2304 KB Output is correct
33 Correct 5 ms 596 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 639 ms 54272 KB Output is correct
36 Correct 628 ms 50560 KB Output is correct
37 Correct 657 ms 50636 KB Output is correct
38 Correct 648 ms 54200 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 436 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 2 ms 436 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 21 ms 3128 KB Output is correct
52 Correct 19 ms 3228 KB Output is correct
53 Correct 21 ms 3252 KB Output is correct
54 Correct 24 ms 3268 KB Output is correct
55 Correct 1 ms 308 KB Output is correct
56 Correct 2 ms 500 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 27 ms 2564 KB Output is correct
59 Correct 23 ms 3148 KB Output is correct
60 Correct 22 ms 2676 KB Output is correct
61 Correct 24 ms 3148 KB Output is correct
62 Correct 57 ms 8420 KB Output is correct
63 Correct 63 ms 8364 KB Output is correct
64 Correct 67 ms 8524 KB Output is correct
65 Correct 250 ms 33136 KB Output is correct
66 Correct 291 ms 33564 KB Output is correct
67 Correct 5 ms 948 KB Output is correct
68 Correct 5 ms 688 KB Output is correct
69 Correct 547 ms 73068 KB Output is correct
70 Correct 575 ms 74080 KB Output is correct
71 Correct 615 ms 75904 KB Output is correct
72 Correct 557 ms 60572 KB Output is correct
73 Correct 637 ms 73180 KB Output is correct
74 Correct 525 ms 59180 KB Output is correct
75 Correct 556 ms 71844 KB Output is correct