oj.uz

Submission #300782

# Submission time Handle Problem Language Result Execution time Memory
300782 2020-09-17T13:28:27 Z haojiandan Carnival Tickets (IOI20_tickets) C++14
100 / 100
 1238 ms 63280 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
priority_queue<pair<ll,int> > q;
ll sum;
int pos[1510],tot,st[1510][1510],R[1510],L[1510];
pair<int,int> d[1510];
int vis[1510];
ll find_maximum(int k, vector<vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int> > ans;
	for (int i = 0; i < n; i++) {
		vector<int> row(m);
		for (int j = 0; j < m; j++) row[j]=-1;
		ans.push_back(row);
	}
	for (int i=0;i<n;i++) {
		for (int j=0;j<k;j++) st[i][j]=-1;
		q.push(make_pair(x[i][k-1]+x[i][m-1],i));
		pos[i]=1;
	}
	for (int I=1;I<=n*k/2;I++) {
		int i=q.top().second; q.pop();
		st[i][k-pos[i]]++,st[i][m-pos[i]]++;
		pos[i]++;
		if (k-pos[i]>=0) {
			q.push(make_pair(x[i][k-pos[i]]+x[i][m-pos[i]],i));
		}
	}
	for (int i=0;i<n;i++) R[i]=pos[i],vis[i]=-1;
	tot=-1;
	while (k--) {
		for (int i=0;i<n;i++) d[i]=make_pair(R[i],i);
		sort(d,d+n); reverse(d,d+n);
		tot++;
		for (int i=0;i<n/2;i++) vis[d[i].second]=tot;
		for (int i=0;i<n;i++)
			if (vis[i]==tot) {
				ans[i][m-R[i]+1]=tot;
				R[i]--;
			} else {
				ans[i][L[i]]=tot;
				L[i]++;
			}
	}
	allocate_tickets(ans);
	for (int i=0;i<n;i++) for (int j=0;j<m;j++) sum+=st[i][j]*x[i][j];
	return sum;
}

Subtask #1
11.0 / 11.0

# 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 1 ms 640 KB Output is correct
5 Correct 1 ms 1664 KB Output is correct
6 Correct 6 ms 6784 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 30 ms 3832 KB Output is correct
6 Correct 760 ms 57652 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 768 KB Output is correct
5 Correct 26 ms 3960 KB Output is correct
6 Correct 662 ms 61496 KB Output is correct
7 Correct 682 ms 61660 KB Output is correct
8 Correct 5 ms 1024 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 1600 KB Output is correct
13 Correct 42 ms 4396 KB Output is correct
14 Correct 34 ms 2944 KB Output is correct
15 Correct 736 ms 62408 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 896 KB Output is correct
5 Correct 52 ms 4184 KB Output is correct
6 Correct 6 ms 768 KB Output is correct
7 Correct 16 ms 7040 KB Output is correct
8 Correct 998 ms 63224 KB Output is correct
9 Correct 984 ms 59472 KB Output is correct
10 Correct 987 ms 59048 KB Output is correct
11 Correct 1075 ms 63224 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 3 ms 896 KB Output is correct
12 Correct 5 ms 872 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 768 KB Output is correct
3 Correct 3 ms 768 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 3 ms 768 KB Output is correct
6 Correct 3 ms 768 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 3 ms 896 KB Output is correct
12 Correct 5 ms 872 KB Output is correct
13 Correct 31 ms 3872 KB Output is correct
14 Correct 54 ms 3960 KB Output is correct
15 Correct 34 ms 3964 KB Output is correct
16 Correct 39 ms 4096 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 4 ms 1792 KB Output is correct
19 Correct 2 ms 1664 KB Output is correct
20 Correct 31 ms 3968 KB Output is correct
21 Correct 35 ms 3832 KB Output is correct
22 Correct 33 ms 3960 KB Output is correct
23 Correct 45 ms 3960 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 1 ms 640 KB Output is correct
5 Correct 1 ms 1664 KB Output is correct
6 Correct 6 ms 6784 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 3 ms 768 KB Output is correct
11 Correct 30 ms 3832 KB Output is correct
12 Correct 760 ms 57652 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 768 KB Output is correct
17 Correct 26 ms 3960 KB Output is correct
18 Correct 662 ms 61496 KB Output is correct
19 Correct 682 ms 61660 KB Output is correct
20 Correct 5 ms 1024 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 8 ms 1600 KB Output is correct
25 Correct 42 ms 4396 KB Output is correct
26 Correct 34 ms 2944 KB Output is correct
27 Correct 736 ms 62408 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 3 ms 896 KB Output is correct
32 Correct 52 ms 4184 KB Output is correct
33 Correct 6 ms 768 KB Output is correct
34 Correct 16 ms 7040 KB Output is correct
35 Correct 998 ms 63224 KB Output is correct
36 Correct 984 ms 59472 KB Output is correct
37 Correct 987 ms 59048 KB Output is correct
38 Correct 1075 ms 63224 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 768 KB Output is correct
41 Correct 3 ms 768 KB Output is correct
42 Correct 4 ms 768 KB Output is correct
43 Correct 3 ms 768 KB Output is correct
44 Correct 3 ms 768 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 640 KB Output is correct
47 Correct 3 ms 768 KB Output is correct
48 Correct 4 ms 768 KB Output is correct
49 Correct 3 ms 896 KB Output is correct
50 Correct 5 ms 872 KB Output is correct
51 Correct 31 ms 3872 KB Output is correct
52 Correct 54 ms 3960 KB Output is correct
53 Correct 34 ms 3964 KB Output is correct
54 Correct 39 ms 4096 KB Output is correct
55 Correct 2 ms 384 KB Output is correct
56 Correct 4 ms 1792 KB Output is correct
57 Correct 2 ms 1664 KB Output is correct
58 Correct 31 ms 3968 KB Output is correct
59 Correct 35 ms 3832 KB Output is correct
60 Correct 33 ms 3960 KB Output is correct
61 Correct 45 ms 3960 KB Output is correct
62 Correct 116 ms 8828 KB Output is correct
63 Correct 102 ms 9080 KB Output is correct
64 Correct 109 ms 9208 KB Output is correct
65 Correct 398 ms 29432 KB Output is correct
66 Correct 431 ms 30072 KB Output is correct
67 Correct 11 ms 7040 KB Output is correct
68 Correct 6 ms 768 KB Output is correct
69 Correct 1238 ms 57592 KB Output is correct
70 Correct 919 ms 61432 KB Output is correct
71 Correct 1062 ms 63280 KB Output is correct
72 Correct 1008 ms 61176 KB Output is correct
73 Correct 1039 ms 60780 KB Output is correct
74 Correct 729 ms 59732 KB Output is correct
75 Correct 965 ms 59316 KB Output is correct