제출 #401122

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

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define pb push_back
#define all(x) begin(x),end(x)
#define SZ(x) (int)(x).size()
#define mem(x) memset(&x,y,sizeof(x))
#define ll long long
using namespace std;

ll find_maximum(int k, vector<vector<int>> x) {
	int n=SZ(x),m=SZ(x[0]);
	vector<vector<int>> answer(n,vector<int>(m,-1));
	ll s=0;
	if(k==1) {
		vector<array<int,2>> vec;
		for(int i=0; i<n; i++) {
			s+=x[i][m-1];vec.pb({-x[i][0]-x[i][m-1],i});
			answer[i][m-1]=0;
		}
		sort(all(vec));reverse(all(vec));
		for(int i=0; i<n/2; i++) {
			s+=vec[i][0];
			answer[vec[i][1]][m-1]=-1;
			answer[vec[i][1]][0]=0;
		}
	}
	allocate_tickets(answer);
	return s;
}

• 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