oj.uz

Submission #406056

# Submission time Handle Problem Language Result Execution time Memory
406056 2021-05-17T07:24:15 Z tiberiu Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1124 ms 92712 KB 
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <queue>
#include <set>


using namespace std;

typedef pair<int, int> pii;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans = vector<vector<int>>(n, vector<int>(m, -1));

	deque<pii> unused[n], mins[n], maxs[n];
	for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++)
            unused[i].push_back({x[i][j], j});
        sort(unused[i].begin(), unused[i].end());
	}

    priority_queue<pii> best;
    long long win = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
//            cerr << "Unused: " << unused[i].begin()->first << endl;
            win -= unused[i].begin()->first;
            mins[i].push_back(*unused[i].begin());
            unused[i].pop_front();
        }
        best.push({mins[i].rbegin()->first + (unused[i].size() ? unused[i].rbegin()->first : mins[i].rbegin()->first), i});
//        cerr << "Inserted: " << mins[i].rbegin()->first << endl;
    }

    for (int ix = 0; ix < k * n / 2; ix++) {
        pii b = best.top();
        best.pop();

        win += b.first;
        int c = b.second;

//        cerr << b.first << endl;

        if (unused[c].size()) {
            maxs[c].push_front(*unused[c].rbegin());
            unused[c].pop_back();
            unused[c].push_front(*mins[c].rbegin());
        } else {
            maxs[c].push_front(*mins[c].rbegin());
        }
        mins[c].pop_back();

        if (mins[c].size()) {
            best.push({mins[c].rbegin()->first + (unused[c].size() ? unused[c].rbegin()->first : mins[c].rbegin()->first), c});
        }
    }

    for (int r = 0; r < k; r++) {
        vector<pii> c;
        for (int j = 0; j < n; j++) {
            c.push_back({maxs[j].size(), j});
//            cout << c.back().first << ' ';
        }
//        cout << endl;
        sort(c.begin(), c.end());

        for (int i = 0; i < n / 2; i++) {
            int col = c[i].second;
            int ix = mins[col].begin()->second;
            ans[col][ix] = r;
            mins[col].pop_front();
        }
        for (int i = n / 2; i < n; i++) {
            int col = c[i].second;
            int ix = maxs[col].begin()->second;
            ans[col][ix] = r;
            maxs[col].pop_front();
        }
    }

	allocate_tickets(ans);
	return win;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 4 ms 3916 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 252 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 564 KB Output is correct
5 Correct 28 ms 3576 KB Output is correct
6 Correct 749 ms 72696 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 30 ms 3484 KB Output is correct
6 Correct 789 ms 72724 KB Output is correct
7 Correct 827 ms 73384 KB Output is correct
8 Correct 4 ms 716 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 9 ms 1228 KB Output is correct
13 Correct 31 ms 3544 KB Output is correct
14 Correct 26 ms 2764 KB Output is correct
15 Correct 915 ms 72584 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 588 KB Output is correct
5 Correct 38 ms 3224 KB Output is correct
6 Correct 7 ms 716 KB Output is correct
7 Correct 10 ms 4428 KB Output is correct
8 Correct 1076 ms 74600 KB Output is correct
9 Correct 1067 ms 88576 KB Output is correct
10 Correct 1048 ms 89924 KB Output is correct
11 Correct 1124 ms 78708 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 5 ms 564 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 588 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 588 KB Output is correct
3 Correct 3 ms 588 KB Output is correct
4 Correct 3 ms 588 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 5 ms 564 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 3 ms 588 KB Output is correct
10 Correct 4 ms 588 KB Output is correct
11 Correct 4 ms 588 KB Output is correct
12 Correct 4 ms 588 KB Output is correct
13 Correct 30 ms 3532 KB Output is correct
14 Correct 31 ms 3468 KB Output is correct
15 Correct 34 ms 3524 KB Output is correct
16 Correct 54 ms 3176 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 4 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 33 ms 3460 KB Output is correct
21 Correct 35 ms 3452 KB Output is correct
22 Correct 37 ms 3328 KB Output is correct
23 Correct 38 ms 3384 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 2 ms 972 KB Output is correct
6 Correct 4 ms 3916 KB Output is correct
7 Correct 1 ms 252 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 4 ms 564 KB Output is correct
11 Correct 28 ms 3576 KB Output is correct
12 Correct 749 ms 72696 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 3 ms 588 KB Output is correct
17 Correct 30 ms 3484 KB Output is correct
18 Correct 789 ms 72724 KB Output is correct
19 Correct 827 ms 73384 KB Output is correct
20 Correct 4 ms 716 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 9 ms 1228 KB Output is correct
25 Correct 31 ms 3544 KB Output is correct
26 Correct 26 ms 2764 KB Output is correct
27 Correct 915 ms 72584 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 588 KB Output is correct
32 Correct 38 ms 3224 KB Output is correct
33 Correct 7 ms 716 KB Output is correct
34 Correct 10 ms 4428 KB Output is correct
35 Correct 1076 ms 74600 KB Output is correct
36 Correct 1067 ms 88576 KB Output is correct
37 Correct 1048 ms 89924 KB Output is correct
38 Correct 1124 ms 78708 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 588 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 3 ms 588 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 5 ms 564 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 460 KB Output is correct
47 Correct 3 ms 588 KB Output is correct
48 Correct 4 ms 588 KB Output is correct
49 Correct 4 ms 588 KB Output is correct
50 Correct 4 ms 588 KB Output is correct
51 Correct 30 ms 3532 KB Output is correct
52 Correct 31 ms 3468 KB Output is correct
53 Correct 34 ms 3524 KB Output is correct
54 Correct 54 ms 3176 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 4 ms 1100 KB Output is correct
57 Correct 2 ms 1100 KB Output is correct
58 Correct 33 ms 3460 KB Output is correct
59 Correct 35 ms 3452 KB Output is correct
60 Correct 37 ms 3328 KB Output is correct
61 Correct 38 ms 3384 KB Output is correct
62 Correct 89 ms 11332 KB Output is correct
63 Correct 79 ms 11328 KB Output is correct
64 Correct 107 ms 11036 KB Output is correct
65 Correct 407 ms 42208 KB Output is correct
66 Correct 479 ms 42884 KB Output is correct
67 Correct 49 ms 4520 KB Output is correct
68 Correct 7 ms 944 KB Output is correct
69 Correct 742 ms 79248 KB Output is correct
70 Correct 945 ms 92712 KB Output is correct
71 Correct 1085 ms 88188 KB Output is correct
72 Correct 987 ms 66072 KB Output is correct
73 Correct 1081 ms 67780 KB Output is correct
74 Correct 827 ms 77908 KB Output is correct
75 Correct 920 ms 70340 KB Output is correct