Submission #1124137

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1124137	2024-12-05 07:19:50	epicci23	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	778 ms	54340 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;
long long find_maximum(int k, vector<vector<int>> x) {
  long long n = x.size(), m = x[0].size(), tot = 0;
    vector<vector<int>> ans(n,vector<int>(m,-1));
      
    priority_queue<array<long long,2>> pq;
    vector<long long> p(n,1);
    for(int i=0;i<n;i++) pq.push({x[i][k-p[i]]+x[i][m-p[i]],i});
    for(int i=0;i<k*n/2;i++){
      array<long long,2> u = pq.top();
      pq.pop();
      long long ind = u[1];
      p[ind]++;
      if(p[ind] <= k)
        pq.push({x[ind][k-p[ind]]+x[ind][m-p[ind]],ind});
    }
     
    vector<long long> lf(n);
    for(int i=0;i<n;i++) lf[i]=p[i]-1;
    
    array<long long,2> tag[n];
    for(int i=0;i<n;i++) tag[i]={0,0};
    for(int i=0;i<k;i++){
      vector<array<long long,2>> v;
      for(int j=0;j<n;j++) v.push_back({lf[j],j});
      sort(v.begin(),v.end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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