oj.uz

Submission #623562

# Submission time Handle Problem Language Result Execution time Memory
623562 2022-08-05T22:30:18 Z JeanBombeur Carnival Tickets (IOI20_tickets) C++17
100 / 100
 660 ms 71944 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();
	
	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 = nbRounds;
    vector <int> row(nbTickets, -1);
	vector <vector <int>> Answer(nbColors, row);
	for (int i = 0; i < nbColors; i ++)
	{
	    for (int j = 0; j < NbSmall[i]; j ++)
	    {
	        Answer[i][j] = -- cnt;
	        if (!cnt)
	            cnt = nbRounds;
	    }
	    for (int j = 1; j <= nbRounds - NbSmall[i]; j ++)
	    {
	        Answer[i][nbTickets - j] = cnt - j < 0 ? cnt - j + nbRounds : cnt - j;
	    }
	}

	allocate_tickets(Answer);
	return answer;
}

Subtask #1
11.0 / 11.0

# 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 596 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 20 ms 2380 KB Output is correct
6 Correct 467 ms 51388 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 17 ms 2704 KB Output is correct
6 Correct 448 ms 61108 KB Output is correct
7 Correct 449 ms 64472 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 15 ms 2344 KB Output is correct
14 Correct 16 ms 2516 KB Output is correct
15 Correct 457 ms 67540 KB Output is correct

Subtask #4
14.0 / 14.0

# 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 26 ms 3072 KB Output is correct
6 Correct 4 ms 724 KB Output is correct
7 Correct 5 ms 968 KB Output is correct
8 Correct 646 ms 71888 KB Output is correct
9 Correct 603 ms 66932 KB Output is correct
10 Correct 592 ms 67052 KB Output is correct
11 Correct 640 ms 71836 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 260 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 260 KB Output is correct
2 Correct 2 ms 444 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 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 22 ms 2256 KB Output is correct
14 Correct 20 ms 2388 KB Output is correct
15 Correct 23 ms 2728 KB Output is correct
16 Correct 26 ms 3128 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 22 ms 2772 KB Output is correct
21 Correct 23 ms 2688 KB Output is correct
22 Correct 24 ms 2976 KB Output is correct
23 Correct 26 ms 2908 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 596 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 20 ms 2380 KB Output is correct
12 Correct 467 ms 51388 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 17 ms 2704 KB Output is correct
18 Correct 448 ms 61108 KB Output is correct
19 Correct 449 ms 64472 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 15 ms 2344 KB Output is correct
26 Correct 16 ms 2516 KB Output is correct
27 Correct 457 ms 67540 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 26 ms 3072 KB Output is correct
33 Correct 4 ms 724 KB Output is correct
34 Correct 5 ms 968 KB Output is correct
35 Correct 646 ms 71888 KB Output is correct
36 Correct 603 ms 66932 KB Output is correct
37 Correct 592 ms 67052 KB Output is correct
38 Correct 640 ms 71836 KB Output is correct
39 Correct 0 ms 260 KB Output is correct
40 Correct 2 ms 444 KB Output is correct
41 Correct 2 ms 340 KB Output is correct
42 Correct 2 ms 340 KB Output is correct
43 Correct 2 ms 340 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 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 22 ms 2256 KB Output is correct
52 Correct 20 ms 2388 KB Output is correct
53 Correct 23 ms 2728 KB Output is correct
54 Correct 26 ms 3128 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 22 ms 2772 KB Output is correct
59 Correct 23 ms 2688 KB Output is correct
60 Correct 24 ms 2976 KB Output is correct
61 Correct 26 ms 2908 KB Output is correct
62 Correct 56 ms 5924 KB Output is correct
63 Correct 55 ms 6020 KB Output is correct
64 Correct 71 ms 8064 KB Output is correct
65 Correct 249 ms 27340 KB Output is correct
66 Correct 285 ms 31720 KB Output is correct
67 Correct 5 ms 880 KB Output is correct
68 Correct 5 ms 692 KB Output is correct
69 Correct 488 ms 51416 KB Output is correct
70 Correct 557 ms 61320 KB Output is correct
71 Correct 660 ms 71944 KB Output is correct
72 Correct 579 ms 68696 KB Output is correct
73 Correct 612 ms 68120 KB Output is correct
74 Correct 507 ms 60148 KB Output is correct
75 Correct 534 ms 59700 KB Output is correct