Submission #414990

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
414990	2021-05-31 11:43:22	keko37	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	1022 ms	144024 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<bits/stdc++.h>
#include "tickets.h"
using namespace std;
typedef long long llint;
typedef pair <int, int> pi;
const int MAXN = 1505;
int n, m, k;
int bio[MAXN][MAXN];
vector <pi> a[MAXN];
vector < pair <llint, pi> > v;
llint find_maximum (int K, vector < vector <int> > A) {
  k = K;
  n = A.size();
  m = A[0].size();
  memset(bio, -1, sizeof bio);
  llint res = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++) {
      a[i].push_back({A[i][j], j});
    }
    sort(a[i].begin(), a[i].end());
    for (int j = 0; j < k; j++) {
      bio[i][m - 1 - j] = 1;
      res += a[i][m - 1 - j].first;
      llint val = a[i][j].first + a[i][m - (k - j)].first;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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