Submission #301450

# Submission time Handle Problem Language Result Execution time Memory
301450 2020-09-18T01:06:27 Z easrui Carnival Tickets (IOI20_tickets) C++14
100 / 100
1037 ms 54512 KB
#include "tickets.h"
#include <bits/stdc++.h>
#define va first
#define vb second
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int MN = 1505;

int D[MN],U[MN],f[MN][MN];

bool cmp(int x, int y)
{
    return D[x]<D[y];
}

ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();
    ll sum = 0;

    vector<vector<int>> ans;
    vector<int> row(m,-1);
    for(int i=0; i<n; i++){
        ans.push_back(row);
    }

    priority_queue<pii> PQ;
    for(int i=0; i<n; i++){
    	D[i] = k-1;
    	U[i] = m;
    	PQ.emplace(x[i][U[i]-1]+x[i][D[i]],i);
    }
    for(int i=0; i<n*k/2; i++){
    	int j = PQ.top().vb;
    	PQ.pop();
    	U[j]--;
    	D[j]--;
    	if(D[j]>=0) PQ.emplace(x[j][U[j]-1]+x[j][D[j]],j);
    }
    
    vector<int> v(n);
    for(int i=0; i<k; i++){
        for(int j=0; j<n; j++) v[j] = j;
        sort(all(v),cmp);
        for(int j=0; j<n; j++){
            if(j>=n/2){
                int c = v[j];
                ans[c][D[c]] = i;
                sum -= x[c][D[c]];
                D[c]--;
            }
            else{
                int c = v[j];
                ans[c][U[c]] = i;
                sum += x[c][U[c]];
                U[c]++;
            }
        }
    }
  
	allocate_tickets(ans);
    return sum;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 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 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 31 ms 2432 KB Output is correct
6 Correct 769 ms 51624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 27 ms 2432 KB Output is correct
6 Correct 708 ms 52600 KB Output is correct
7 Correct 757 ms 52900 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 7 ms 896 KB Output is correct
13 Correct 24 ms 2176 KB Output is correct
14 Correct 23 ms 2048 KB Output is correct
15 Correct 757 ms 53624 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 3 ms 544 KB Output is correct
5 Correct 38 ms 2552 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 10 ms 896 KB Output is correct
8 Correct 1018 ms 54512 KB Output is correct
9 Correct 971 ms 50808 KB Output is correct
10 Correct 953 ms 50804 KB Output is correct
11 Correct 1037 ms 54408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 3 ms 512 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 3 ms 512 KB Output is correct
7 Correct 1 ms 384 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 384 KB Output is correct
2 Correct 3 ms 512 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 3 ms 512 KB Output is correct
7 Correct 1 ms 384 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 32 ms 2408 KB Output is correct
15 Correct 36 ms 2512 KB Output is correct
16 Correct 39 ms 2552 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 3 ms 512 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 31 ms 2424 KB Output is correct
21 Correct 36 ms 2424 KB Output is correct
22 Correct 34 ms 2424 KB Output is correct
23 Correct 37 ms 2424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 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 0 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2432 KB Output is correct
12 Correct 769 ms 51624 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 4 ms 512 KB Output is correct
17 Correct 27 ms 2432 KB Output is correct
18 Correct 708 ms 52600 KB Output is correct
19 Correct 757 ms 52900 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 7 ms 896 KB Output is correct
25 Correct 24 ms 2176 KB Output is correct
26 Correct 23 ms 2048 KB Output is correct
27 Correct 757 ms 53624 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 3 ms 544 KB Output is correct
32 Correct 38 ms 2552 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 10 ms 896 KB Output is correct
35 Correct 1018 ms 54512 KB Output is correct
36 Correct 971 ms 50808 KB Output is correct
37 Correct 953 ms 50804 KB Output is correct
38 Correct 1037 ms 54408 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 3 ms 512 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 3 ms 512 KB Output is correct
45 Correct 1 ms 384 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 32 ms 2408 KB Output is correct
53 Correct 36 ms 2512 KB Output is correct
54 Correct 39 ms 2552 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 3 ms 512 KB Output is correct
57 Correct 2 ms 384 KB Output is correct
58 Correct 31 ms 2424 KB Output is correct
59 Correct 36 ms 2424 KB Output is correct
60 Correct 34 ms 2424 KB Output is correct
61 Correct 37 ms 2424 KB Output is correct
62 Correct 89 ms 6136 KB Output is correct
63 Correct 87 ms 6136 KB Output is correct
64 Correct 113 ms 6240 KB Output is correct
65 Correct 404 ms 23544 KB Output is correct
66 Correct 444 ms 24184 KB Output is correct
67 Correct 8 ms 896 KB Output is correct
68 Correct 6 ms 640 KB Output is correct
69 Correct 775 ms 51508 KB Output is correct
70 Correct 927 ms 52616 KB Output is correct
71 Correct 1018 ms 54392 KB Output is correct
72 Correct 855 ms 52344 KB Output is correct
73 Correct 996 ms 52288 KB Output is correct
74 Correct 749 ms 50804 KB Output is correct
75 Correct 890 ms 50936 KB Output is correct