Submission #301472

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
301472	2020-09-18 01:39:48	guangxuan	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	3 ms	896 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, std::vector<std::vector<int>> x) {
  int n = x.size();
  int m = x[0].size();
    int l[n],r[n];
    int neg = 0;
    priority_queue<pair<int,int> >pq;
    multiset<int> rs;
    multiset<int,greater<int> > ls;
    for(int i=0;i<n;i++){
        l[i]=k;r[i]=m-1;
        //cerr<<l[i] << ' ' << r[i] << endl;
        for(int j=0;j<k;j++)ls.insert(x[i][j]);
        //pq.push({x[i][l[i]]-1e9+x[i][r[i]],i});
        neg+=l[i];
    }
    while((int)ls.size()>n*k/2){
    //rs.insert(*ls.begin());
    ls.erase(ls.begin());
  }
  for(int i=0;i<n;i++){
    if(x[i][r[i]]>=*ls.begin())
    pq.push({x[i][l[i]]-1e9+x[i][r[i]],i});
  }
    while(neg>n*k/2){
        assert(pq.size());
        pair<int,int> ctop = pq.top();pq.pop();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 11 / 11
• Subtask 2: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10