제출 #300857

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
300857		ainta	카니발 티켓 (IOI20_tickets)	C++17	41 / 100	1292 ms	71996 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
#define pii pair<int,int>
using namespace std;
int n, m, K, cc, L[1600], R[1600];
int PL[1600], PR[1600];
pii CL[1600];

vector<pii>V;
long long find_maximum(int k, std::vector<std::vector<int>> x) {
    vector<vector<int>>res = x;
	n = x.size();
	m = x[0].size();
    K = k;
    int i, j;
    for(i=0;i<n;i++)for(j=0;j<m;j++)res[i][j]=-1;
    for(i=0;i<n;i++){
        for(j=0;j<K;j++){
            int b = x[i][j];
            int e = x[i][m-K+j];
            V.push_back({(e+b+1)/2,i});
        }
    }
    sort(V.begin(),V.end());
    for(i=0;i<n*K/2;i++){
        L[V[i].second]++;
    }
    for(i=0;i<n;i++){
        R[i]=K-L[i];
        PL[i]=0,PR[i]=m-1;
    }
    long long ss=0;
    for(i=0;i<K;i++){
        for(j=0;j<n;j++){
            CL[j]={L[j],j};
        }
        sort(CL,CL+n);
        for(j=0;j<n;j++){
            int t = CL[j].second;
            if(j<n/2){
                R[t]--;
                ss+=x[t][PR[t]];
                res[t][PR[t]--] = i;
            }
            else{
                L[t]--;
                ss-=x[t][PL[t]];
                res[t][PL[t]++] = i;
            }
        }
    }

    allocate_tickets(res);
    return ss;
}

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