Submission #300859

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
300859	2020-09-17 14:30:44	milisav	Carnival Tickets (IOI20_tickets)	C++14	100 / 100	2004 ms	84132 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>
#pragma GCC optimize("O3")
#define maxn 2000
using namespace std;
priority_queue<pair<int,int>> pq;
vector<int> fr[maxn];
vector<int> bk[maxn];
int tt[maxn];
//vector<vector<int>> s;
long long find_maximum(int k,vector<vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
    vector<vector<int>> s;
    for(int i=0;i<n;i++) {
        vector<int> row;
        for(int j=0;j<m;j++) row.push_back(-1);
        s.push_back(row);
    }
  for(int i=0;i<n;i++) for(int j=0;j<k;j++) pq.push({x[i][m-j-1]+x[i][k-1-j],i});
  long long ans=0;
  for(int i=0;i<n;i++) for(int j=0;j<k;j++) ans-=x[i][j];
  for(int i=0;i<n*k/2;i++) {
        ans+=pq.top().first;
        tt[pq.top().second]++;
        pq.pop();
  }
    for(int i=0;i<n;i++) {
        for(int j=0;j<k-tt[i];j++) fr[i].push_back(k-tt[i]-1-j);
        for(int j=0;j<tt[i];j++) bk[i].push_back(m-tt[i]+j);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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