oj.uz

Submission #684145

# Submission time Handle Problem Language Result Execution time Memory
684145 2023-01-20T14:46:21 Z sharaelong Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1287 ms 114988 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
    vector<int> max_val_cnt(n, 0);
    priority_queue<pii> pq;
    for (int i=0; i<n; ++i) {
        for (int j=0; j<k; ++j) {
            pq.push({ x[i][k-1-j] + x[i][m-1-j], i });
        }
    }
    for (int i=0; i<n*k/2; ++i) {
        auto[_, idx] = pq.top();
        pq.pop();
        max_val_cnt[idx]++;
    }

    vector<pii> effective_tickets;
    for (int i=0; i<n; ++i) {
        for (int j=0; j<max_val_cnt[i]; ++j) effective_tickets.push_back({ m-1-j, i });
        for (int j=0; j<k-max_val_cnt[i]; ++j) effective_tickets.push_back({ j, i });
    }
    sort(effective_tickets.begin(), effective_tickets.end(), [&](const pii& a, const pii& b) {
        return x[a.second][a.first] < x[b.second][b.first];
    });

    ll ans_val = 0;
    vector<vector<int>> ans(n, vector<int>(m, -1));
    vector<vector<int>> plus_elem(n);
    vector<vector<int>> minus_elem(n);
	for (int i=0; i<n*k/2; ++i) {
        auto[j, idx] = effective_tickets[i];
        ans_val -= x[idx][j];
        minus_elem[idx].push_back(j);
        auto[j2, idx2] = effective_tickets[n*k-1-i];
        ans_val += x[idx2][j2];
        plus_elem[idx2].push_back(j2);
    }
    for (int i=0; i<k; ++i) {
        vector<pii> plus_freq;
        for (int j=0; j<n; ++j) plus_freq.push_back({ plus_elem[j].size(), j });
        sort(plus_freq.begin(), plus_freq.end());

        for (int j=0; j<n/2; ++j) {
            int idx = plus_freq[j].second;
            ans[idx][minus_elem[idx].back()] = i;
            minus_elem[idx].pop_back();
        }
        for (int j=n/2; j<n; ++j) {
            int idx = plus_freq[j].second;
            ans[idx][plus_elem[idx].back()] = i;
            plus_elem[idx].pop_back();
        }
    }
	allocate_tickets(ans);
	return ans_val;
}

Subtask #1
11.0 / 11.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 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 828 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 444 KB Output is correct
5 Correct 25 ms 3200 KB Output is correct
6 Correct 536 ms 73324 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 26 ms 3272 KB Output is correct
6 Correct 635 ms 72940 KB Output is correct
7 Correct 683 ms 80872 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 0 ms 304 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1108 KB Output is correct
13 Correct 22 ms 3024 KB Output is correct
14 Correct 24 ms 3192 KB Output is correct
15 Correct 779 ms 87252 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 4 ms 628 KB Output is correct
5 Correct 48 ms 4972 KB Output is correct
6 Correct 7 ms 988 KB Output is correct
7 Correct 10 ms 1364 KB Output is correct
8 Correct 1282 ms 114916 KB Output is correct
9 Correct 1255 ms 108180 KB Output is correct
10 Correct 1158 ms 107380 KB Output is correct
11 Correct 1287 ms 114988 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 444 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 3 ms 596 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 3 ms 572 KB Output is correct
11 Correct 3 ms 596 KB Output is correct
12 Correct 4 ms 596 KB Output is correct
13 Correct 19 ms 3252 KB Output is correct
14 Correct 20 ms 3284 KB Output is correct
15 Correct 31 ms 4020 KB Output is correct
16 Correct 54 ms 5008 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 1 ms 448 KB Output is correct
20 Correct 29 ms 3708 KB Output is correct
21 Correct 33 ms 4108 KB Output is correct
22 Correct 44 ms 4188 KB Output is correct
23 Correct 39 ms 4644 KB Output is correct

Subtask #7
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 1 ms 212 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 828 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 2 ms 444 KB Output is correct
11 Correct 25 ms 3200 KB Output is correct
12 Correct 536 ms 73324 KB Output is correct
13 Correct 1 ms 308 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 26 ms 3272 KB Output is correct
18 Correct 635 ms 72940 KB Output is correct
19 Correct 683 ms 80872 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 0 ms 304 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 7 ms 1108 KB Output is correct
25 Correct 22 ms 3024 KB Output is correct
26 Correct 24 ms 3192 KB Output is correct
27 Correct 779 ms 87252 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 4 ms 628 KB Output is correct
32 Correct 48 ms 4972 KB Output is correct
33 Correct 7 ms 988 KB Output is correct
34 Correct 10 ms 1364 KB Output is correct
35 Correct 1282 ms 114916 KB Output is correct
36 Correct 1255 ms 108180 KB Output is correct
37 Correct 1158 ms 107380 KB Output is correct
38 Correct 1287 ms 114988 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 444 KB Output is correct
41 Correct 2 ms 444 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 3 ms 596 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 340 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 3 ms 572 KB Output is correct
49 Correct 3 ms 596 KB Output is correct
50 Correct 4 ms 596 KB Output is correct
51 Correct 19 ms 3252 KB Output is correct
52 Correct 20 ms 3284 KB Output is correct
53 Correct 31 ms 4020 KB Output is correct
54 Correct 54 ms 5008 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 4 ms 596 KB Output is correct
57 Correct 1 ms 448 KB Output is correct
58 Correct 29 ms 3708 KB Output is correct
59 Correct 33 ms 4108 KB Output is correct
60 Correct 44 ms 4188 KB Output is correct
61 Correct 39 ms 4644 KB Output is correct
62 Correct 52 ms 8508 KB Output is correct
63 Correct 61 ms 8504 KB Output is correct
64 Correct 121 ms 13168 KB Output is correct
65 Correct 352 ms 40696 KB Output is correct
66 Correct 526 ms 51100 KB Output is correct
67 Correct 9 ms 1364 KB Output is correct
68 Correct 6 ms 1056 KB Output is correct
69 Correct 464 ms 73284 KB Output is correct
70 Correct 858 ms 90724 KB Output is correct
71 Correct 1234 ms 114932 KB Output is correct
72 Correct 964 ms 97296 KB Output is correct
73 Correct 1131 ms 108612 KB Output is correct
74 Correct 737 ms 77104 KB Output is correct
75 Correct 840 ms 89136 KB Output is correct