Submission #623556

# Submission time Handle Problem Language Result Execution time Memory
623556 2022-08-05T22:14:29 Z JeanBombeur Carnival Tickets (IOI20_tickets) C++17
100 / 100
607 ms 71884 KB
#include "tickets.h"
#include <vector>
#include <algorithm>
using namespace std;

//  <|°_°|>

//  M. Broccoli

const int MAX_COLORS = (1500);

pair <int, int> Optimal[MAX_COLORS * MAX_COLORS];

int NbSmall[MAX_COLORS];

long long find_maximum(int nbRounds, vector <vector <int>> Tickets) {
    
	int nbColors = Tickets.size();
	int nbTickets = Tickets[0].size();
	
	vector <vector <int>> Answer;
	long long answer = 0;
	
	for (int i = 0; i < nbColors; i ++)
	{
	    for (int j = 0; j < nbRounds; j ++)
	    {
	        Optimal[nbRounds * i + j] = {Tickets[i][j] + Tickets[i][j + nbTickets - nbRounds], i};
	        answer += Tickets[i][j + nbTickets - nbRounds];
	    }
	}
	sort(Optimal, Optimal + nbColors * nbRounds);
	for (int i = 0; i < (nbColors * nbRounds) / 2; i ++)
	{
	    NbSmall[Optimal[i].second] ++;
	    answer -= Optimal[i].first;
	}
	
	int cnt = 0;
    vector <int> row(nbTickets, -1);
	for (int i = 0; i < nbColors; i ++)
	{
        for (int j = 0; j < nbTickets; j ++)
        {
            row[j] = -1;
        }
	    for (int j = 0; j < NbSmall[i]; j ++)
	    {
	        row[j] = cnt ++;
	        if (cnt == nbRounds)
	            cnt = 0;
	    }
	    for (int j = 0; j < nbRounds - NbSmall[i]; j ++)
	    {
	        row[nbTickets - j - 1] = cnt + j >= nbRounds ? cnt + j - nbRounds : cnt + j;
	    }
	    Answer.push_back(row);
	}

	allocate_tickets(Answer);
	return answer;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 19 ms 2424 KB Output is correct
6 Correct 433 ms 51380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 16 ms 2704 KB Output is correct
6 Correct 399 ms 61072 KB Output is correct
7 Correct 406 ms 64448 KB Output is correct
8 Correct 2 ms 596 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 5 ms 852 KB Output is correct
13 Correct 17 ms 2336 KB Output is correct
14 Correct 14 ms 2504 KB Output is correct
15 Correct 434 ms 67388 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 24 ms 3024 KB Output is correct
6 Correct 4 ms 748 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 604 ms 71848 KB Output is correct
9 Correct 566 ms 67064 KB Output is correct
10 Correct 563 ms 67020 KB Output is correct
11 Correct 607 ms 71848 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 468 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 18 ms 2284 KB Output is correct
14 Correct 20 ms 2388 KB Output is correct
15 Correct 20 ms 2672 KB Output is correct
16 Correct 23 ms 3020 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 2 ms 468 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 19 ms 2736 KB Output is correct
21 Correct 21 ms 2732 KB Output is correct
22 Correct 20 ms 2900 KB Output is correct
23 Correct 23 ms 2888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 19 ms 2424 KB Output is correct
12 Correct 433 ms 51380 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 16 ms 2704 KB Output is correct
18 Correct 399 ms 61072 KB Output is correct
19 Correct 406 ms 64448 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 5 ms 852 KB Output is correct
25 Correct 17 ms 2336 KB Output is correct
26 Correct 14 ms 2504 KB Output is correct
27 Correct 434 ms 67388 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 24 ms 3024 KB Output is correct
33 Correct 4 ms 748 KB Output is correct
34 Correct 5 ms 852 KB Output is correct
35 Correct 604 ms 71848 KB Output is correct
36 Correct 566 ms 67064 KB Output is correct
37 Correct 563 ms 67020 KB Output is correct
38 Correct 607 ms 71848 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 1 ms 340 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 468 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 2 ms 468 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 18 ms 2284 KB Output is correct
52 Correct 20 ms 2388 KB Output is correct
53 Correct 20 ms 2672 KB Output is correct
54 Correct 23 ms 3020 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 2 ms 468 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 19 ms 2736 KB Output is correct
59 Correct 21 ms 2732 KB Output is correct
60 Correct 20 ms 2900 KB Output is correct
61 Correct 23 ms 2888 KB Output is correct
62 Correct 50 ms 5956 KB Output is correct
63 Correct 49 ms 5936 KB Output is correct
64 Correct 69 ms 8148 KB Output is correct
65 Correct 222 ms 27308 KB Output is correct
66 Correct 270 ms 31744 KB Output is correct
67 Correct 5 ms 852 KB Output is correct
68 Correct 4 ms 724 KB Output is correct
69 Correct 442 ms 51552 KB Output is correct
70 Correct 515 ms 61104 KB Output is correct
71 Correct 606 ms 71884 KB Output is correct
72 Correct 552 ms 68704 KB Output is correct
73 Correct 576 ms 67980 KB Output is correct
74 Correct 458 ms 60024 KB Output is correct
75 Correct 494 ms 59664 KB Output is correct