제출 #1204902

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204902		ansori	Carnival Tickets (IOI20_tickets)	C++20	27 / 100	318 ms	51380 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
void allocate_tickets(vector<vector<int>> _d) ;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<std::vector<int>> answ(n , vector<int> (m , -1));
	vector<pair<int , int>> ps(n , {0 , m - 1});
	long long ans = 0;
	for(int i = 0;i < k; ++ i){
		vector<pair<int , int>> vc;
		for(int j = 0;j < n; ++ j){
			vc.push_back({x[j][ps[j].fi] + x[j][ps[j].se] , j});
		}
		sort(vc.rbegin() , vc.rend());
		for(int j = 0;j < n / 2; ++ j){
			int p = vc[j].se;
			ans += x[p][ps[p].se];
			// cout << x[p][ps[p].se] << ' ';
			answ[p][ps[p].se] = i;
			ps[p].se --;
		}
		for(int j = n / 2;j < n; ++ j){
			int p = vc[j].se;
			ans -= x[p][ps[p].fi];
			// cout << x[p][ps[p].fi] << ' ';
			answ[p][ps[p].fi] = i;
			ps[p].fi ++;
		}
		// cout << '\n';
	}
	allocate_tickets(answ);
	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