Submission #736896

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
736896	2023-05-06T10:25:25 Z	sentheta	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	689 ms	97060 KB

tickets

#include "tickets.h"
// author : sentheta aka vanwij
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cassert>
#include<random>
#include<chrono>
#include<cmath>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<stack>
#include<map>
#include<set>
using namespace std;

#define Int long long
#define V vector
#define pii pair<Int,Int>
#define ff first
#define ss second

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pow2(x) (1LL<<(x))
#define msb(x) (63-__builtin_clzll(x))
#define bitcnt(x) (__builtin_popcountll(x))

#define nl '\n'
#define _ << ' ' <<
#define all(x) (x).begin(), (x).end()
#define rep(i,a,b) for(int i = (int)(a); i < (int)(b); i++)
#define dbg(x) if(1) cout << "?" << #x << " : " << (x) << endl << flush;

const int N = 1505;

Int n, m, k;
V<V<int>> a;

Int sum = 0;
V<V<int>> ans;

V<int> sneg[N], unused[N];

// count of pos for each color
Int poscnt[N];

// pointer to next positive/negative
Int posptr[N], negptr[N];

Int find_maximum(int _k,V<V<int>> _a){
	a.swap(_a);
	n = a.size(); m = a[0].size(); k = _k;
	
	// {delta, color}
	priority_queue<pii> pq;
	rep(i,0,n){
		posptr[i] = m-1;
		negptr[i] = 0;

		rep(j,0,k){
			sneg[i].push_back(a[i][j]);
			sum -= a[i][j];
		}
		unused[i] = a[i];

		pq.push({0LL+unused[i].back()+sneg[i].back(), i});
	}

	// change n*k/2 cards to pos
	rep(loop,0,n*k/2){
		auto[delta,i] = pq.top(); pq.pop();
		sneg[i].pop_back();
		unused[i].pop_back();

		sum += delta;
		poscnt[i]++;
		if(!sneg[i].empty()){
			pq.push({unused[i].back()+sneg[i].back(), i});
		}
	}

	// assign answer
	ans = V<V<int>>(n,V<int>(m,-1));
	rep(t,0,k){
		V<int> ord(n);
		rep(i,0,n) ord[i] = i;
		sort(all(ord),[&](int i,int j){
			return poscnt[i] < poscnt[j];
		});

		// assign negative
		rep(ii,0,n/2){
			int i = ord[ii];
			ans[i][negptr[i]++] = t;
		}
		// assign positive
		rep(ii,n/2,n){
			int i = ord[ii];
			ans[i][posptr[i]--] = t;
			poscnt[i]--;
		}
	}


	allocate_tickets(ans);
	return sum;
}

Subtask #1
11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	2 ms	852 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	23 ms	3676 KB	Output is correct
6	Correct	491 ms	82116 KB	Output is correct

Subtask #3
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	468 KB	Output is correct
5	Correct	19 ms	3156 KB	Output is correct
6	Correct	455 ms	67268 KB	Output is correct
7	Correct	473 ms	67644 KB	Output is correct
8	Correct	3 ms	724 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	340 KB	Output is correct
12	Correct	6 ms	1024 KB	Output is correct
13	Correct	17 ms	2668 KB	Output is correct
14	Correct	18 ms	2652 KB	Output is correct
15	Correct	494 ms	74264 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	26 ms	4356 KB	Output is correct
6	Correct	5 ms	980 KB	Output is correct
7	Correct	5 ms	1236 KB	Output is correct
8	Correct	675 ms	97036 KB	Output is correct
9	Correct	612 ms	91504 KB	Output is correct
10	Correct	614 ms	90644 KB	Output is correct
11	Correct	651 ms	97060 KB	Output is correct

Subtask #5
12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	2 ms	572 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct

Subtask #6
23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	2 ms	468 KB	Output is correct
3	Correct	2 ms	596 KB	Output is correct
4	Correct	2 ms	596 KB	Output is correct
5	Correct	2 ms	572 KB	Output is correct
6	Correct	2 ms	596 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	344 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	2 ms	596 KB	Output is correct
12	Correct	3 ms	596 KB	Output is correct
13	Correct	19 ms	3640 KB	Output is correct
14	Correct	22 ms	3592 KB	Output is correct
15	Correct	24 ms	3924 KB	Output is correct
16	Correct	41 ms	4276 KB	Output is correct
17	Correct	2 ms	468 KB	Output is correct
18	Correct	2 ms	596 KB	Output is correct
19	Correct	2 ms	516 KB	Output is correct
20	Correct	29 ms	3340 KB	Output is correct
21	Correct	23 ms	3788 KB	Output is correct
22	Correct	41 ms	3664 KB	Output is correct
23	Correct	26 ms	4120 KB	Output is correct

Subtask #7
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	0 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	2 ms	852 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	23 ms	3676 KB	Output is correct
12	Correct	491 ms	82116 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	2 ms	468 KB	Output is correct
17	Correct	19 ms	3156 KB	Output is correct
18	Correct	455 ms	67268 KB	Output is correct
19	Correct	473 ms	67644 KB	Output is correct
20	Correct	3 ms	724 KB	Output is correct
21	Correct	0 ms	340 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	6 ms	1024 KB	Output is correct
25	Correct	17 ms	2668 KB	Output is correct
26	Correct	18 ms	2652 KB	Output is correct
27	Correct	494 ms	74264 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	2 ms	596 KB	Output is correct
32	Correct	26 ms	4356 KB	Output is correct
33	Correct	5 ms	980 KB	Output is correct
34	Correct	5 ms	1236 KB	Output is correct
35	Correct	675 ms	97036 KB	Output is correct
36	Correct	612 ms	91504 KB	Output is correct
37	Correct	614 ms	90644 KB	Output is correct
38	Correct	651 ms	97060 KB	Output is correct
39	Correct	1 ms	340 KB	Output is correct
40	Correct	2 ms	468 KB	Output is correct
41	Correct	2 ms	596 KB	Output is correct
42	Correct	2 ms	596 KB	Output is correct
43	Correct	2 ms	572 KB	Output is correct
44	Correct	2 ms	596 KB	Output is correct
45	Correct	1 ms	340 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	2 ms	596 KB	Output is correct
48	Correct	2 ms	596 KB	Output is correct
49	Correct	2 ms	596 KB	Output is correct
50	Correct	3 ms	596 KB	Output is correct
51	Correct	19 ms	3640 KB	Output is correct
52	Correct	22 ms	3592 KB	Output is correct
53	Correct	24 ms	3924 KB	Output is correct
54	Correct	41 ms	4276 KB	Output is correct
55	Correct	2 ms	468 KB	Output is correct
56	Correct	2 ms	596 KB	Output is correct
57	Correct	2 ms	516 KB	Output is correct
58	Correct	29 ms	3340 KB	Output is correct
59	Correct	23 ms	3788 KB	Output is correct
60	Correct	41 ms	3664 KB	Output is correct
61	Correct	26 ms	4120 KB	Output is correct
62	Correct	59 ms	9548 KB	Output is correct
63	Correct	59 ms	9488 KB	Output is correct
64	Correct	71 ms	10644 KB	Output is correct
65	Correct	271 ms	39176 KB	Output is correct
66	Correct	317 ms	41596 KB	Output is correct
67	Correct	6 ms	1316 KB	Output is correct
68	Correct	4 ms	980 KB	Output is correct
69	Correct	538 ms	82224 KB	Output is correct
70	Correct	639 ms	89028 KB	Output is correct
71	Correct	689 ms	97004 KB	Output is correct
72	Correct	544 ms	81324 KB	Output is correct
73	Correct	620 ms	93548 KB	Output is correct
74	Correct	475 ms	73732 KB	Output is correct
75	Correct	537 ms	86248 KB	Output is correct

Submission #736896

Compilation message

Subtask #1 11.0 / 11.0

Subtask #2 16.0 / 16.0

Subtask #3 14.0 / 14.0

Subtask #4 14.0 / 14.0

Subtask #5 12.0 / 12.0

Subtask #6 23.0 / 23.0

Subtask #7 10.0 / 10.0

Subtask #1
11.0 / 11.0

Subtask #2
16.0 / 16.0

Subtask #3
14.0 / 14.0

Subtask #4
14.0 / 14.0

Subtask #5
12.0 / 12.0

Subtask #6
23.0 / 23.0

Subtask #7
10.0 / 10.0