Submission #300849

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300849	2020-09-17 14:23:20	Temmie	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1391 ms	78644 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>
typedef long long ll;
typedef unsigned long long ull;
void allocate_tickets(std::vector <std::vector <int>> s);
int n, m;
ull find_maximum(int k, std::vector <std::vector <int>> x) {
  
  n = x.size();
  m = x[0].size();
  ll r = 0;
  for (int i = 0; i < n; i++)
    for (int j = m - 1; j > m - 1 - k; j--)
      r += x[i][j];
  std::vector <std::pair <int, int>> range(n, { -1, m - k });
  std::priority_queue <std::pair <int, int>> pq;
  for (int i = 0; i < n; i++)
    pq.push({ - x[i][range[i].first + 1] - x[i][range[i].second], i });
  for (int i = 0; i < (n * k) >> 1; i++) {
    auto p = pq.top(); pq.pop();
    r += p.first;
    range[p.second].first++, range[p.second].second++;
    if (range[p.second].second == m) continue;
    pq.push({ - x[p.second][range[p.second].first + 1] - x[p.second][range[p.second].second], p.second });
  }
  std::vector <std::vector <int>> mx(n), mn(n), mxi(n), mni(n);
  for (int i = 0; i < n; i++) {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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