Submission #623554

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
623554	2022-08-05 22:07:11	JeanBombeur	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	657 ms	71984 KiB

tickets

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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 NbBigs[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];
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 14 / 14
• Subtask 4: 14 / 14
• Subtask 5: 12 / 12
• Subtask 6: 23 / 23
• Subtask 7: 10 / 10