Submission #300700

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300700	2020-09-17 12:14:24	abeker	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1212 ms	62352 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 ll;
typedef pair <int, int> pii;
ll find_maximum(int K, vector <vector <int>> x) {
  int N = x.size();
  int M = x[0].size();
  ll sol = 0;
  vector <pii> diffs;
  for (int i = 0; i < N; i++)
    for (int j = 1; j <= K; j++) {
      diffs.push_back({x[i][K - j] + x[i][M - j], i});
      sol -= x[i][K - j];
    }
  sort(diffs.begin(), diffs.end(), greater <pii> ());
  vector <int> cnt(N);
  for (int i = 0; i < K * N / 2; i++) {
    cnt[diffs[i].second]++;
    sol += diffs[i].first;
  }
  vector <int> lo(N, 0), hi(N, M - 1);
  vector <vector <int>> round(N, vector <int> (M, -1));
  for (int k = 0; k < K; k++) {
    vector <pii> sorted;
    for (int i = 0; i < N; i++)
      sorted.push_back({cnt[i], i});
    sort(sorted.begin(), sorted.end(), greater <pii> ());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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