Submission #1050448

#TimeUsernameProblemLanguageResultExecution timeMemory
1050448TahirAliyevCarnival Tickets (IOI20_tickets)C++17
27 / 100
275 ms51536 KiB
#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());
	vector<int> s;
	for(int i = 0; i < n; i++){
		if(i < n / 2){
			s.push_back(x[v[i].second][0]);
			res[v[i].second][0] = 0;
		}
		else{
			s.push_back(x[v[i].second].back());
			res[v[i].second][m - 1] = 0;
		} 
	}
	sort(s.begin(), s.end());
	ll ans = 0;
	for(int i = 0; i < n; i++){
		ans += abs(s[(n - 1) / 2] - s[i]);
	}
	allocate_tickets(res);
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...