제출 #430787

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
430787		juggernaut	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	204 KiB

tickets

#include"tickets.h"
#include<bits/stdc++.h>
using namespace std;
#ifndef EVAL
#include"grader.cpp"
#endif
typedef long long ll;
ll find_maximum(int k,vector<vector<int>>x){
	int n=x.size();
	int m=x[0].size();
	vector<vector<int>>answer;
	answer.assign(n,vector<int>(m,-1));
	vector<pair<int,int>>vec;
	ll sum=0;
	for(int i=0;i<n;i++)
        vec.emplace_back(x[i][m-1],i);
    sort(vec.rbegin(),vec.rend());
    for(int i=0;i<n/2;i++){
        sum+=vec[i].first;
        answer[vec[i].second][m-1]=0;
    }
    for(int i=0;i<n;i++)if(~answer[i][m-1])answer[i][0]=0,sum-=x[i][0];
	allocate_tickets(answer);
	return sum;
}

• 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