제출 #1050442

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1050442		TahirAliyev	Carnival Tickets (IOI20_tickets)	C++17	0 / 100	0 ms	348 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<pii> v;
	for(int i = 0; i < n; i++){
		v.push_back({x[i][0] + x[i].back(), i});
	}
	sort(v.begin(), v.end());
	int ans = 0;
	for(int i = 0; i < n; i++){
		if(i < n / 2){
			ans -= x[v[i].second][0];
			res[v[i].second][0] = 0;
		}
		else{
			ans += x[v[i].second].back();
			res[v[i].second][m - 1] = 0;
		} 
	}
	allocate_tickets(res);
	return ans;
}

• 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