oj.uz

Submission #354308

# Submission time Handle Problem Language Result Execution time Memory
354308 2021-01-21T17:33:35 Z doowey Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2017 ms 158820 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

typedef long long ll;
typedef pair<ll,int> pii;

#define fi first
#define se second
#define mp make_pair

const int N = 1510;
priority_queue<pii> low[N];
priority_queue<pii> high[N];
vector<vector<int>> sign;
vector<int> tw[N][2];
vector<vector<int>> sol;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	ll sum = 0;
	priority_queue<pii> vl;
	sign.resize(n);
	sol.resize(n);
	for(int i = 0 ; i < n; i ++ ){
        sign[i].resize(m);
        sol[i].resize(m,-1);
        for(int j = 0 ; j < k ; j ++ ){
            sum -= x[i][j];
            sign[i][j]=-1;
            low[i].push(mp(x[i][j],j));
        }
        for(int j = 0; j < m ; j ++ ){
            high[i].push(mp(x[i][j],j));
        }
        vl.push(mp(low[i].top().fi + high[i].top().fi, i));
	}
	int it;
	int i1, i2;
	for(int flip = 0; flip < n * k / 2; flip ++ ){
        sum += vl.top().fi;
        it = vl.top().se;
        vl.pop();
        i1 = low[it].top().se;
        i2 = high[it].top().se;
        low[it].pop();
        high[it].pop();
        sign[it][i1]=0;
        sign[it][i2]=+1;
        high[it].push(mp(x[it][i1],i1));
        while(!high[it].empty() && sign[it][high[it].top().se] == +1){
            high[it].pop();
        }
        if(!low[it].empty() && !high[it].empty()){
            vl.push(mp(low[it].top().fi + high[it].top().fi, it));
        }
	}
	for(int i = 0 ; i < n; i ++ ){
        for(int j = 0 ; j < m ; j ++ ){
            if(sign[i][j] == -1){
                tw[i][0].push_back(j);
            }
            else if(sign[i][j] == +1){
                tw[i][1].push_back(j);
            }
        }
	}

	for(int r = 0; r < k ; r ++ ){
        vector<pii> ord;
        for(int i = 0 ; i < n; i ++ ){
            ord.push_back(mp(tw[i][1].size(), i));
        }
        sort(ord.begin(), ord.end());
        for(int i = 0 ; i < ord.size(); i ++ ){
            if(i < ord.size() / 2){
                sol[ord[i].se][tw[ord[i].se][0].back()]=r;
                tw[ord[i].se][0].pop_back();
            }
            else{
                sol[ord[i].se][tw[ord[i].se][1].back()]=r;
                tw[ord[i].se][1].pop_back();
            }
        }
	}
	allocate_tickets(sol);
	return sum;
}

Compilation message

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:77:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |         for(int i = 0 ; i < ord.size(); i ++ ){
      |                         ~~^~~~~~~~~~~~
tickets.cpp:78:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, int>, std::allocator<std::pair<long long int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |             if(i < ord.size() / 2){
      |                ~~^~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 32 ms 5484 KB Output is correct
6 Correct 760 ms 108152 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 37 ms 7020 KB Output is correct
6 Correct 1020 ms 132808 KB Output is correct
7 Correct 1087 ms 135916 KB Output is correct
8 Correct 6 ms 1260 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 492 KB Output is correct
12 Correct 14 ms 2156 KB Output is correct
13 Correct 34 ms 6124 KB Output is correct
14 Correct 38 ms 5612 KB Output is correct
15 Correct 1186 ms 152772 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 4 ms 1004 KB Output is correct
5 Correct 57 ms 8556 KB Output is correct
6 Correct 9 ms 1516 KB Output is correct
7 Correct 11 ms 2028 KB Output is correct
8 Correct 2017 ms 158524 KB Output is correct
9 Correct 1843 ms 150764 KB Output is correct
10 Correct 1825 ms 147900 KB Output is correct
11 Correct 1973 ms 158592 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 4 ms 876 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 4 ms 1004 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 4 ms 1132 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 3 ms 876 KB Output is correct
3 Correct 3 ms 876 KB Output is correct
4 Correct 3 ms 876 KB Output is correct
5 Correct 4 ms 876 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 4 ms 1004 KB Output is correct
10 Correct 4 ms 1004 KB Output is correct
11 Correct 4 ms 1004 KB Output is correct
12 Correct 4 ms 1132 KB Output is correct
13 Correct 33 ms 6300 KB Output is correct
14 Correct 33 ms 6380 KB Output is correct
15 Correct 43 ms 7788 KB Output is correct
16 Correct 57 ms 9452 KB Output is correct
17 Correct 2 ms 620 KB Output is correct
18 Correct 4 ms 1004 KB Output is correct
19 Correct 2 ms 748 KB Output is correct
20 Correct 44 ms 7148 KB Output is correct
21 Correct 45 ms 7660 KB Output is correct
22 Correct 53 ms 8684 KB Output is correct
23 Correct 54 ms 8940 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 492 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 2 ms 1132 KB Output is correct
7 Correct 1 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 3 ms 876 KB Output is correct
11 Correct 32 ms 5484 KB Output is correct
12 Correct 760 ms 108152 KB Output is correct
13 Correct 1 ms 492 KB Output is correct
14 Correct 1 ms 492 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 3 ms 876 KB Output is correct
17 Correct 37 ms 7020 KB Output is correct
18 Correct 1020 ms 132808 KB Output is correct
19 Correct 1087 ms 135916 KB Output is correct
20 Correct 6 ms 1260 KB Output is correct
21 Correct 1 ms 492 KB Output is correct
22 Correct 1 ms 492 KB Output is correct
23 Correct 1 ms 492 KB Output is correct
24 Correct 14 ms 2156 KB Output is correct
25 Correct 34 ms 6124 KB Output is correct
26 Correct 38 ms 5612 KB Output is correct
27 Correct 1186 ms 152772 KB Output is correct
28 Correct 1 ms 492 KB Output is correct
29 Correct 1 ms 492 KB Output is correct
30 Correct 1 ms 492 KB Output is correct
31 Correct 4 ms 1004 KB Output is correct
32 Correct 57 ms 8556 KB Output is correct
33 Correct 9 ms 1516 KB Output is correct
34 Correct 11 ms 2028 KB Output is correct
35 Correct 2017 ms 158524 KB Output is correct
36 Correct 1843 ms 150764 KB Output is correct
37 Correct 1825 ms 147900 KB Output is correct
38 Correct 1973 ms 158592 KB Output is correct
39 Correct 1 ms 492 KB Output is correct
40 Correct 3 ms 876 KB Output is correct
41 Correct 3 ms 876 KB Output is correct
42 Correct 3 ms 876 KB Output is correct
43 Correct 4 ms 876 KB Output is correct
44 Correct 5 ms 876 KB Output is correct
45 Correct 1 ms 640 KB Output is correct
46 Correct 1 ms 492 KB Output is correct
47 Correct 4 ms 1004 KB Output is correct
48 Correct 4 ms 1004 KB Output is correct
49 Correct 4 ms 1004 KB Output is correct
50 Correct 4 ms 1132 KB Output is correct
51 Correct 33 ms 6300 KB Output is correct
52 Correct 33 ms 6380 KB Output is correct
53 Correct 43 ms 7788 KB Output is correct
54 Correct 57 ms 9452 KB Output is correct
55 Correct 2 ms 620 KB Output is correct
56 Correct 4 ms 1004 KB Output is correct
57 Correct 2 ms 748 KB Output is correct
58 Correct 44 ms 7148 KB Output is correct
59 Correct 45 ms 7660 KB Output is correct
60 Correct 53 ms 8684 KB Output is correct
61 Correct 54 ms 8940 KB Output is correct
62 Correct 85 ms 13676 KB Output is correct
63 Correct 88 ms 13932 KB Output is correct
64 Correct 201 ms 19180 KB Output is correct
65 Correct 521 ms 57964 KB Output is correct
66 Correct 762 ms 68768 KB Output is correct
67 Correct 11 ms 2428 KB Output is correct
68 Correct 9 ms 1644 KB Output is correct
69 Correct 788 ms 108268 KB Output is correct
70 Correct 1309 ms 133228 KB Output is correct
71 Correct 1962 ms 158820 KB Output is correct
72 Correct 1783 ms 156556 KB Output is correct
73 Correct 1942 ms 150892 KB Output is correct
74 Correct 1162 ms 134252 KB Output is correct
75 Correct 1321 ms 129260 KB Output is correct