Submission #309405

# Submission time Handle Problem Language Result Execution time Memory
309405 2020-10-03T13:18:01 Z georgerapeanu Carnival Tickets (IOI20_tickets) C++17
100 / 100
995 ms 54520 KB
#include "tickets.h"
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;


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

    for(auto it:x){
        for(int i = 0;i < k;i++){
            ans -= it[i];
        }
    }

    priority_queue<pair<int,int>> pq;

    for(int i = 0;i < n;i++){
        pq.push({x[i][(int)x[i].size() - 1 - (k - cnt[i])] + x[i][cnt[i] - 1],i});
    }

    for(int i = 1;i <= n * k / 2;i++){
        pair<int,int> tmp = pq.top();
        pq.pop();
        cnt[tmp.second]--;
        ans += tmp.first;
        if(cnt[tmp.second] > 0){
            tmp.first = x[tmp.second][(int)x[tmp.second].size() - 1 - (k - cnt[tmp.second])] + x[tmp.second][cnt[tmp.second] - 1];
            pq.push(tmp);
        }
    }

    vector<int> free_left(k,n / 2);

    for(int i = 0;i < n;i++){
        vector<pair<int,int> > tmp;

        for(int j = 0;j < k;j++){
            tmp.push_back({free_left[j],j});
        }

        sort(tmp.begin(),tmp.end());
        reverse(tmp.begin(),tmp.end());

        for(int j = 0;j < cnt[i];j++){
            answer[i][j] = tmp[j].second;
            free_left[tmp[j].second]--;
        }
        for(int j = m - (k - cnt[i]);j < m;j++){
            answer[i][j] = tmp[cnt[i] + (j - (m - (k - cnt[i])))].second;
        }
    }


    allocate_tickets(answer);
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 2396 KB Output is correct
6 Correct 775 ms 51420 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 27 ms 2424 KB Output is correct
6 Correct 662 ms 52472 KB Output is correct
7 Correct 714 ms 52820 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 7 ms 768 KB Output is correct
13 Correct 24 ms 2040 KB Output is correct
14 Correct 24 ms 2048 KB Output is correct
15 Correct 751 ms 53368 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 40 ms 2424 KB Output is correct
6 Correct 7 ms 640 KB Output is correct
7 Correct 8 ms 896 KB Output is correct
8 Correct 982 ms 54520 KB Output is correct
9 Correct 935 ms 50824 KB Output is correct
10 Correct 924 ms 50680 KB Output is correct
11 Correct 995 ms 54392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 500 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 32 ms 2432 KB Output is correct
14 Correct 30 ms 2424 KB Output is correct
15 Correct 34 ms 2428 KB Output is correct
16 Correct 38 ms 2424 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 30 ms 2296 KB Output is correct
21 Correct 34 ms 2296 KB Output is correct
22 Correct 33 ms 2424 KB Output is correct
23 Correct 36 ms 2424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2396 KB Output is correct
12 Correct 775 ms 51420 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 2 ms 512 KB Output is correct
17 Correct 27 ms 2424 KB Output is correct
18 Correct 662 ms 52472 KB Output is correct
19 Correct 714 ms 52820 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 256 KB Output is correct
24 Correct 7 ms 768 KB Output is correct
25 Correct 24 ms 2040 KB Output is correct
26 Correct 24 ms 2048 KB Output is correct
27 Correct 751 ms 53368 KB Output is correct
28 Correct 0 ms 256 KB Output is correct
29 Correct 0 ms 256 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 40 ms 2424 KB Output is correct
33 Correct 7 ms 640 KB Output is correct
34 Correct 8 ms 896 KB Output is correct
35 Correct 982 ms 54520 KB Output is correct
36 Correct 935 ms 50824 KB Output is correct
37 Correct 924 ms 50680 KB Output is correct
38 Correct 995 ms 54392 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 3 ms 500 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 3 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 1 ms 256 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 512 KB Output is correct
48 Correct 3 ms 512 KB Output is correct
49 Correct 3 ms 512 KB Output is correct
50 Correct 3 ms 512 KB Output is correct
51 Correct 32 ms 2432 KB Output is correct
52 Correct 30 ms 2424 KB Output is correct
53 Correct 34 ms 2428 KB Output is correct
54 Correct 38 ms 2424 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 30 ms 2296 KB Output is correct
59 Correct 34 ms 2296 KB Output is correct
60 Correct 33 ms 2424 KB Output is correct
61 Correct 36 ms 2424 KB Output is correct
62 Correct 85 ms 6136 KB Output is correct
63 Correct 87 ms 6008 KB Output is correct
64 Correct 109 ms 6264 KB Output is correct
65 Correct 381 ms 23416 KB Output is correct
66 Correct 429 ms 24080 KB Output is correct
67 Correct 8 ms 896 KB Output is correct
68 Correct 7 ms 640 KB Output is correct
69 Correct 738 ms 51448 KB Output is correct
70 Correct 853 ms 52472 KB Output is correct
71 Correct 986 ms 54284 KB Output is correct
72 Correct 807 ms 52344 KB Output is correct
73 Correct 929 ms 52144 KB Output is correct
74 Correct 707 ms 50808 KB Output is correct
75 Correct 833 ms 50936 KB Output is correct