제출 #1050463

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050463		TahirAliyev	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	269 ms	51368 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int, int>
#define ll long long

ll find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> res;
	res.resize(n);
	for(int i = 0; i < n; i++) res[i].resize(m, -1);
	vector<int> l(n, 0), r(n, m - 1);
	ll ans = 0;
	for(int j = 0; j < k; j++){
		vector<pii> v;
		for(int i = 0; i < n; i++){
			v.push_back({x[i][l[i]] + x[i][r[i]], i});
		}
		sort(v.begin(), v.end());
		for(int i = 0; i < n; i++){
			if(i < n / 2){
				ans -= (x[v[i].second][l[v[i].second]]);
				res[v[i].second][l[v[i].second]] = j;
				l[v[i].second]++;
			}
			else{
				ans += (x[v[i].second][r[v[i].second]]);
				res[v[i].second][r[v[i].second]] = j;
				r[v[i].second]--;
			} 
		}
	}
	allocate_tickets(res);
	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