Submission #319948

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
319948	2020-11-06 21:55:52	eriksuenderhauf	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	1508 ms	107920 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;
typedef long long ll;
pair<int,int> a[2000][2000];
int cnt[2000], vis[2000], cnt2[2000];
ll find_maximum(int k, vector<vector<int>> x) {
  int n = x.size(), m = x[0].size();
  vector<vector<int>> y(n, vector<int>(m, -1));
  priority_queue<array<int,2>> pq;
  ll ans = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < m; j++)
      a[i][j] = make_pair(x[i][j], j);
    sort(a[i], a[i]+m);
    for (int j1 = k-1, j2 = m-1; ~j1; j1--, j2--)
      pq.push({a[i][j1].first + a[i][j2].first, i}), ans -= a[i][j1].first;
  }
  for (int i = 0; i < k * n / 2; i++, pq.pop())
    ans += pq.top()[0], cnt[pq.top()[1]]++;
  while (!pq.empty()) pq.pop();
  for (int i = 0; i < n; i++)
    pq.push({cnt[i], i});
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < n / 2; j++, pq.pop())
      vis[pq.top()[1]] = 1;
    for (int j = 0; j < n; j++) {
      if (vis[j]) {
        vis[j] = 0;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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