oj.uz

Submission #425288

# Submission time Handle Problem Language Result Execution time Memory
425288 2021-06-12T19:16:35 Z muhammad_hokimiyon Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2244 ms 63580 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> X) {
	int n = X.size();
	int m = X[0].size();
        vector<vector<int>> ans(n, vector<int>(m, -1));
        long long res = 0;
        set<pair<int, int>> s;
        vector<int> fi(n, k - 1);
        vector<int> ls(n, m - 1);
        vector<int> coun(n, k);
        for(int i = 0; i < n; i++){
                s.insert({X[i][fi[i]] + X[i][m - 1], i});
                for(int j = 0; j < k; j++)res -= X[i][j];
        }
        int cnt = 0;
        vector<pair<int, int>> A,B;
        while(cnt < n * k / 2){
                cnt++;
                auto x = *(--s.end());
                res += x.first;
                s.erase(--s.end());
                A.push_back({x.second, ls[x.second]});
                fi[x.second]--,ls[x.second]--;
                coun[x.second]--;
                if(coun[x.second] > 0){
                        s.insert({X[x.second][fi[x.second]] + X[x.second][ls[x.second]], x.second});
                }
        }
        for(int i = 0; i < n; i++){
                for(int j = 0; j < m; j++)X[i][j] = 0;
        }
        for(auto x : A){
                X[x.first][x.second] = 1;
        }
        for(int i = 0; i < n; i++){
                for(int j = 0; j <= fi[i]; j++)B.push_back({i, j});
        }
        for(auto x : B){
                X[x.first][x.second] = 2;
        }
        cnt = 0;
        vector<vector<int>> c(n, vector<int>(2, 0));
        for(auto x : A){
                c[x.first][0]++;
        }
        for(auto x : B){
                c[x.first][1]++;
        }
        while(cnt < k){
                int c1 = 0, c2 = 0;
                vector<int> us(n, false);
                for(int i = 0; i < n; i++){
                        if(c[i][0] && !c[i][1] && c1 < n / 2){
                                c[i][0]--;
                                c1++;
                                us[i] = true;
                                for(int j = 0; j < m; j++){
                                        if(X[i][j] == 1){
                                                X[i][j] = 0;
                                                ans[i][j] = cnt;
                                                break;
                                        }
                                }
                        }
                        if(!c[i][0] && c[i][1] && c2 < n / 2){
                                c[i][1]--;
                                c2++;
                                us[i] = true;
                                for(int j = 0; j < m; j++){
                                        if(X[i][j] == 2){
                                                X[i][j] = 0;
                                                ans[i][j] = cnt;
                                                break;
                                        }
                                }
                        }
                }
                for(int i = 0; i < n; i++){
                        if(us[i])continue;
                        if(c[i][0] && c1 < n / 2){
                                c[i][0]--;
                                c1++;
                                for(int j = 0; j < m; j++){
                                        if(X[i][j] == 1){
                                                X[i][j] = 0;
                                                ans[i][j] = cnt;
                                                break;
                                        }
                                }
                        }
                        else if(c[i][1] && c2 < n / 2){
                                c[i][1]--;
                                c2++;
                                for(int j = 0; j < m; j++){
                                        if(X[i][j] == 2){
                                                X[i][j] = 0;
                                                ans[i][j] = cnt;
                                                break;
                                        }
                                }
                        }
                }
                cnt++;
        }
        allocate_tickets(ans);
        return res;
}

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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 2 ms 844 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 28 ms 3140 KB Output is correct
6 Correct 677 ms 52556 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 31 ms 2572 KB Output is correct
6 Correct 1282 ms 55588 KB Output is correct
7 Correct 1367 ms 58608 KB Output is correct
8 Correct 4 ms 588 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 8 ms 972 KB Output is correct
13 Correct 24 ms 2352 KB Output is correct
14 Correct 35 ms 2328 KB Output is correct
15 Correct 1652 ms 60900 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 288 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 48 ms 3600 KB Output is correct
6 Correct 17 ms 796 KB Output is correct
7 Correct 8 ms 1228 KB Output is correct
8 Correct 2244 ms 63444 KB Output is correct
9 Correct 1949 ms 59240 KB Output is correct
10 Correct 2058 ms 59276 KB Output is correct
11 Correct 2226 ms 63580 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 2 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 4 ms 436 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 4 ms 448 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 3 ms 460 KB Output is correct
13 Correct 27 ms 3188 KB Output is correct
14 Correct 27 ms 3208 KB Output is correct
15 Correct 36 ms 3312 KB Output is correct
16 Correct 46 ms 3616 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 44 ms 2856 KB Output is correct
21 Correct 38 ms 3300 KB Output is correct
22 Correct 41 ms 3040 KB Output is correct
23 Correct 44 ms 3492 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 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 2 ms 844 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 292 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 28 ms 3140 KB Output is correct
12 Correct 677 ms 52556 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 2 ms 460 KB Output is correct
17 Correct 31 ms 2572 KB Output is correct
18 Correct 1282 ms 55588 KB Output is correct
19 Correct 1367 ms 58608 KB Output is correct
20 Correct 4 ms 588 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 8 ms 972 KB Output is correct
25 Correct 24 ms 2352 KB Output is correct
26 Correct 35 ms 2328 KB Output is correct
27 Correct 1652 ms 60900 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 288 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 48 ms 3600 KB Output is correct
33 Correct 17 ms 796 KB Output is correct
34 Correct 8 ms 1228 KB Output is correct
35 Correct 2244 ms 63444 KB Output is correct
36 Correct 1949 ms 59240 KB Output is correct
37 Correct 2058 ms 59276 KB Output is correct
38 Correct 2226 ms 63580 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 4 ms 436 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 4 ms 448 KB Output is correct
48 Correct 4 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 3 ms 460 KB Output is correct
51 Correct 27 ms 3188 KB Output is correct
52 Correct 27 ms 3208 KB Output is correct
53 Correct 36 ms 3312 KB Output is correct
54 Correct 46 ms 3616 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 44 ms 2856 KB Output is correct
59 Correct 38 ms 3300 KB Output is correct
60 Correct 41 ms 3040 KB Output is correct
61 Correct 44 ms 3492 KB Output is correct
62 Correct 72 ms 6984 KB Output is correct
63 Correct 72 ms 7132 KB Output is correct
64 Correct 147 ms 8320 KB Output is correct
65 Correct 501 ms 25092 KB Output is correct
66 Correct 737 ms 28940 KB Output is correct
67 Correct 8 ms 1228 KB Output is correct
68 Correct 16 ms 804 KB Output is correct
69 Correct 629 ms 51656 KB Output is correct
70 Correct 1390 ms 53512 KB Output is correct
71 Correct 2172 ms 62428 KB Output is correct
72 Correct 1947 ms 60668 KB Output is correct
73 Correct 2101 ms 59328 KB Output is correct
74 Correct 1261 ms 53768 KB Output is correct
75 Correct 1464 ms 52468 KB Output is correct