Submission #811110

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
811110	2023-08-07T00:02:40 Z	oscar1f	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1318 ms	348284 KB

tickets

#include "tickets.h"
#include <bits/stdc++.h>

using namespace std;
using ll=long long;
using vv=vector<vector<ll>>;

const int MAX_SORTE=1505;
ll nbSorte,nbDeChaque,nbTour,autre;
vv val,pris;
vector<ll> listeGrand[MAX_SORTE],listePetit[MAX_SORTE];
vector<tuple<ll,ll,ll>> possi;
set<ll> restants[MAX_SORTE];

ll calcRep() {
	ll sommeRep=0;
	vector<tuple<ll,ll,ll>> listePris;
	vector<vector<int>> rep;
	vector<ll> nbPris,meilleur;
	for (ll i=0;i<nbSorte;i++) {
		rep.push_back({});
		for (ll j=0;j<nbDeChaque;j++) {
			if (pris[i][j]==1) {
				listePris.push_back(make_tuple(val[i][j],i,j));
				rep[i].push_back(0);
			}
			else {
				rep[i].push_back(-1);
			}
		}
		for (ll j=0;j<nbTour;j++) {
			restants[i].insert(j);
		}
	}
	sort(listePris.begin(),listePris.end());
	for (ll i=0;i<(ll)listePris.size();i++) {
		if (i<(ll)listePris.size()/2) {
			sommeRep-=get<0>(listePris[i]);
			listePetit[get<1>(listePris[i])].push_back(get<2>(listePris[i]));
		}
		else {
			sommeRep+=get<0>(listePris[i]);
			listeGrand[get<1>(listePris[i])].push_back(get<2>(listePris[i]));
		}
	} 
	for (ll i=0;i<nbTour;i++) {
		meilleur.push_back(i);
		nbPris.push_back(0);
	}
	for (ll i=0;i<nbSorte;i++) {
		/*cout<<i<<" : ";
		for (auto l:listePetit[i]) {
			cout<<l<<" ";
		}
		cout<<"\t";
		for (auto l:listeGrand[i]) {
			cout<<l<<" ";
		}
		cout<<endl;*/
		sort(meilleur.begin(),meilleur.end(),[&] (int a,int b){
			return nbPris[a]<nbPris[b];
		});
		/*for (int i:meilleur) {
			cout<<i<<" ";
		}
		cout<<endl;*/
		for (ll j=0;j<(ll)listePetit[i].size();j++) {
			rep[i][listePetit[i][j]]=meilleur[j];
			nbPris[meilleur[j]]++;
			restants[i].erase(meilleur[j]);
		}
		for (ll j:listeGrand[i]) {
			auto it=restants[i].begin();
			rep[i][j]=(*it);
			restants[i].erase(it);
		}
	}
	allocate_tickets(rep);
	return sommeRep;
}

ll find_maximum(int k,vector<vector<int>> x) {
	for (auto i:x) {
		val.push_back({});
		for (auto j:i) {
			val.back().push_back((ll)j);
		}
	}
	nbTour=k;
	nbSorte=val.size();
	nbDeChaque=val[0].size();
	for (ll i=0;i<nbSorte;i++) {
		pris.push_back({});
		for (ll j=0;j<nbDeChaque;j++) {
			pris.back().push_back(0);
		}
	}
	for (ll i=0;i<nbSorte;i++) {
		for (ll j=0;j<nbTour;j++) {
			pris[i][j]=1;
			autre=nbDeChaque-nbTour+j;
			possi.push_back(make_tuple(val[i][autre]+val[i][j],i,j));
		}
	}
	sort(possi.begin(),possi.end());
	for (int i=0;i<nbSorte*nbTour/2;i++) {
		pris[get<1>(possi.back())][get<2>(possi.back())]=0;
		pris[get<1>(possi.back())][nbDeChaque-nbTour+get<2>(possi.back())]=1;
		possi.pop_back();
	}
	return calcRep();
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	468 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	2 ms	1108 KB	Output is correct

Subtask #2

16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	340 KB	Output is correct
3	Correct	0 ms	340 KB	Output is correct
4	Correct	2 ms	772 KB	Output is correct
5	Correct	18 ms	6104 KB	Output is correct
6	Correct	441 ms	123880 KB	Output is correct

Subtask #3

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	976 KB	Output is correct
5	Correct	28 ms	9160 KB	Output is correct
6	Correct	808 ms	207792 KB	Output is correct
7	Correct	874 ms	239132 KB	Output is correct
8	Correct	5 ms	1748 KB	Output is correct
9	Correct	1 ms	448 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	444 KB	Output is correct
12	Correct	8 ms	3000 KB	Output is correct
13	Correct	26 ms	9064 KB	Output is correct
14	Correct	29 ms	9056 KB	Output is correct
15	Correct	975 ms	269388 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	0 ms	340 KB	Output is correct
4	Correct	3 ms	1428 KB	Output is correct
5	Correct	44 ms	14012 KB	Output is correct
6	Correct	7 ms	2536 KB	Output is correct
7	Correct	8 ms	3024 KB	Output is correct
8	Correct	1263 ms	326512 KB	Output is correct
9	Correct	1161 ms	320488 KB	Output is correct
10	Correct	1199 ms	318792 KB	Output is correct
11	Correct	1263 ms	326612 KB	Output is correct

Subtask #5

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	3 ms	724 KB	Output is correct
3	Correct	2 ms	852 KB	Output is correct
4	Correct	2 ms	852 KB	Output is correct
5	Correct	3 ms	1108 KB	Output is correct
6	Correct	3 ms	1300 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	3 ms	1108 KB	Output is correct
10	Correct	3 ms	1108 KB	Output is correct
11	Correct	3 ms	1300 KB	Output is correct
12	Correct	3 ms	1300 KB	Output is correct

Subtask #6

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	3 ms	724 KB	Output is correct
3	Correct	2 ms	852 KB	Output is correct
4	Correct	2 ms	852 KB	Output is correct
5	Correct	3 ms	1108 KB	Output is correct
6	Correct	3 ms	1300 KB	Output is correct
7	Correct	1 ms	468 KB	Output is correct
8	Correct	1 ms	468 KB	Output is correct
9	Correct	3 ms	1108 KB	Output is correct
10	Correct	3 ms	1108 KB	Output is correct
11	Correct	3 ms	1300 KB	Output is correct
12	Correct	3 ms	1300 KB	Output is correct
13	Correct	19 ms	6088 KB	Output is correct
14	Correct	20 ms	6324 KB	Output is correct
15	Correct	33 ms	9976 KB	Output is correct
16	Correct	45 ms	14920 KB	Output is correct
17	Correct	1 ms	596 KB	Output is correct
18	Correct	3 ms	980 KB	Output is correct
19	Correct	2 ms	724 KB	Output is correct
20	Correct	36 ms	10848 KB	Output is correct
21	Correct	34 ms	10948 KB	Output is correct
22	Correct	45 ms	13508 KB	Output is correct
23	Correct	43 ms	13588 KB	Output is correct

Subtask #7

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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	468 KB	Output is correct
5	Correct	1 ms	596 KB	Output is correct
6	Correct	2 ms	1108 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	0 ms	340 KB	Output is correct
9	Correct	0 ms	340 KB	Output is correct
10	Correct	2 ms	772 KB	Output is correct
11	Correct	18 ms	6104 KB	Output is correct
12	Correct	441 ms	123880 KB	Output is correct
13	Correct	0 ms	340 KB	Output is correct
14	Correct	0 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	2 ms	976 KB	Output is correct
17	Correct	28 ms	9160 KB	Output is correct
18	Correct	808 ms	207792 KB	Output is correct
19	Correct	874 ms	239132 KB	Output is correct
20	Correct	5 ms	1748 KB	Output is correct
21	Correct	1 ms	448 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	1 ms	444 KB	Output is correct
24	Correct	8 ms	3000 KB	Output is correct
25	Correct	26 ms	9064 KB	Output is correct
26	Correct	29 ms	9056 KB	Output is correct
27	Correct	975 ms	269388 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Correct	3 ms	1428 KB	Output is correct
32	Correct	44 ms	14012 KB	Output is correct
33	Correct	7 ms	2536 KB	Output is correct
34	Correct	8 ms	3024 KB	Output is correct
35	Correct	1263 ms	326512 KB	Output is correct
36	Correct	1161 ms	320488 KB	Output is correct
37	Correct	1199 ms	318792 KB	Output is correct
38	Correct	1263 ms	326612 KB	Output is correct
39	Correct	0 ms	340 KB	Output is correct
40	Correct	3 ms	724 KB	Output is correct
41	Correct	2 ms	852 KB	Output is correct
42	Correct	2 ms	852 KB	Output is correct
43	Correct	3 ms	1108 KB	Output is correct
44	Correct	3 ms	1300 KB	Output is correct
45	Correct	1 ms	468 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	3 ms	1108 KB	Output is correct
48	Correct	3 ms	1108 KB	Output is correct
49	Correct	3 ms	1300 KB	Output is correct
50	Correct	3 ms	1300 KB	Output is correct
51	Correct	19 ms	6088 KB	Output is correct
52	Correct	20 ms	6324 KB	Output is correct
53	Correct	33 ms	9976 KB	Output is correct
54	Correct	45 ms	14920 KB	Output is correct
55	Correct	1 ms	596 KB	Output is correct
56	Correct	3 ms	980 KB	Output is correct
57	Correct	2 ms	724 KB	Output is correct
58	Correct	36 ms	10848 KB	Output is correct
59	Correct	34 ms	10948 KB	Output is correct
60	Correct	45 ms	13508 KB	Output is correct
61	Correct	43 ms	13588 KB	Output is correct
62	Correct	49 ms	12748 KB	Output is correct
63	Correct	52 ms	13032 KB	Output is correct
64	Correct	124 ms	36344 KB	Output is correct
65	Correct	356 ms	90784 KB	Output is correct
66	Correct	528 ms	142732 KB	Output is correct
67	Correct	9 ms	3152 KB	Output is correct
68	Correct	8 ms	2652 KB	Output is correct
69	Correct	446 ms	125024 KB	Output is correct
70	Correct	828 ms	225252 KB	Output is correct
71	Correct	1293 ms	348284 KB	Output is correct
72	Correct	1318 ms	330444 KB	Output is correct
73	Correct	1138 ms	311568 KB	Output is correct
74	Correct	864 ms	212900 KB	Output is correct
75	Correct	833 ms	223392 KB	Output is correct