제출 #850639

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
850639		abcvuitunggio	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	418 ms	73144 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector <vector <int>> x) {
	int n=x.size(),m=x[0].size();
	int idx[n];
	long long res=0;
	vector <vector <int>> answer;
	answer.resize(n);
	for (int i=0;i<n;i++){
        idx[i]=0;
        answer[i].resize(m,-1);
    }
    vector <pair <int, int>> v;
    for (int j=0;j<k;j++){
        for (int i=0;i<n;i++){
            res+=x[i].back();
            v.emplace_back(x[i].back()+x[i][idx[i]],i);
        }
        sort(v.begin(),v.end());
        for (int i=0;i<n/2;i++){
            res-=v[i].first;
            answer[v[i].second][idx[v[i].second]]=j;
            idx[v[i].second]++;
        }
        for (int i=n/2;i<n;i++){
            x[v[i].second].pop_back();
            answer[v[i].second][x[v[i].second].size()]=j;
        }
        v.clear();
    }
	allocate_tickets(answer);
	return res;
}

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