Submission #301535

#	Time	Username	Problem	Language	Result	Execution time	Memory
301535		qiangbao	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	1 ms	384 KiB

tickets

#include <iostream>
#include <algorithm>
#include <vector>
#include "tickets.h"

#define pb push_back

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

int n, m, kk;
vector<vector<int> > a;
int beg[1501], endi[1501];

vector<pii> subt;

int ansval=0;
vector<int> plamt;
vector<vector<int> > ans;

ll find_maximum(int kkk, vector<vector<int> > x)
{
    int i, j;
    
    n=x.size(), m=x[1].size(), kk=kkk;
    a=x;
    for(i=0;i<m;i++)
        plamt.pb(0);
    for(i=0;i<n;i++)
        ans.pb(plamt);
    
    for(i=0;i<n;i++)
        sort(a[i].begin(), a[i].end());
    for(i=0;i<n;i++)
        endi[i]=m-1;
    
    for(i=0;i<kk;i++){
        subt.clear();
        for(j=0;j<n;j++){
            ansval+=a[j][endi[j]];
            subt.pb({a[j][endi[j]]+a[j][beg[j]], j});
        }
        sort(subt.begin(), subt.end());
        for(j=0;j<n/2;j++){
            ansval-=subt[j].first;
            ans[j][beg[j]]=i;
            beg[subt[j].second]++;
        }
        for(j=n/2;j<n;j++){
            ans[j][endi[j]]=i;
            endi[subt[j].second]--;
        }
    }
    
    allocate_tickets(ans);
    return ansval;
}

• Subtask 1: 0 / 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