Submission #300952

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300952	2020-09-17 15:25:28	lohacho	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	1114 ms	78776 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 <bits/stdc++.h>
using namespace std;
const int INF = (int)2e9;
using LL = long long;
int L[2004];
vector < int > dif[2004];
priority_queue < pair < int, int > > big, low;
int pos[2004];
vector < int > use_l[2004], use_r[2004];
vector < int > zero;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
  int N = x.size();
  int M = x[0].size();
  std::vector<std::vector<int>> answer;
  answer.resize(N);
  LL sum = 0;
    for(int i = 0; i < N / 2; ++i){
        answer[i].resize(M);
        L[i] = k;
        for(int j = k - 1; j >= 0; --j){
            sum -= x[i][j];
            dif[i].push_back(x[i][M - (k - j)] + x[i][j]);
        }
        dif[i].push_back(-INF);
        big.push(make_pair(dif[i][0], i));
    }
    for(int i = N / 2; i < N; ++i){
        answer[i].resize(M);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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