제출 #1283821

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1283821		Jawad_Akbar_JJ	카니발 티켓 (IOI20_tickets)	C++20	27 / 100	265 ms	60924 KiB

tickets

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

using namespace std;
int ind[1505];
vector<int> rnd[1505];

long long find_maximum(int k, vector<vector<int>> vec){
	long long n = vec.size(), m = vec[0].size(), Ans = 0;
	vector<vector<int>> alc(n, vector<int> (m, -1));

	for (int it=0;it<k;it++){
		long long ans = 0;
		vector<pair<int,int>> vc;
		for (int i=0;i<n;i++){
			ans += vec[i].back();
			vc.push_back({-vec[i].back() - vec[i][ind[i]], i});
		}
		sort(begin(vc), end(vc));

		for (int i=n-1;i>=0;i--){
			auto [vl, Id] = vc[i];
			if (i < n / 2){
				alc[Id][vec[Id].size() - 1] = it;
				vec[Id].pop_back();
			}
			else{
				alc[Id][ind[Id]++] = it;
				ans += vl;
			}
		}
	}

	for (int i=0;i<n;i++){
		for (int j=0;j<m;j++)
			if (alc[i][j] != -1)
				rnd[alc[i][j]].push_back(vec[i][j]);
	}

	for (int i=0;i<k;i++){
		sort(begin(rnd[i]), end(rnd[i]));
		long long ans = 0;
		for (int j=0;j<n;j++)
			ans += rnd[i][j] * (j < n / 2 ? -1 : +1);
		Ans += ans;
	}

	allocate_tickets(alc);
	return Ans;
}

• 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