Submission #1078107

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1078107	2024-08-27 12:49:54	mickey080929	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	578 ms	111444 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;
typedef pair<ll,ll> pll;
void allocate_tickets( std::vector<std::vector<int>> _d);
ll find_maximum(int k, vector<vector<int>> x) {
  ll n = x.size(), m = x[0].size();
  vector<vector<pll>> x2(n, vector<pll>(m));
  for (ll i=0; i<n; i++) {
    for (ll j=0; j<m; j++) {
      x2[i][j] = {x[i][j], j};
    }
    sort(x2[i].begin(), x2[i].end());
  }
  ll sum = 0;
  vector<ll> cnt(n, k);
  priority_queue<pll> pq;
  for (ll i=0; i<n; i++) {
    for (ll j=0; j<k; j++) {
      sum -= x2[i][j].first;
    }
    pq.push({x2[i][k-1].first + x2[i].back().first, i});
  }
  for (ll rep=0; rep<n/2*k; rep++) {
    sum += pq.top().first;
    ll i = pq.top().second;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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