Submission #1024128

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024128		TheWilp	Carnival Tickets (IOI20_tickets)	C++14	11 / 100	1 ms	860 KiB

tickets

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

using ll = long long;

class name {
public:
	int value;
	int i,j;
	bool operator<(const name& other) const {
		return value < other.value;
	}	
};

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int N = x.size();
	int M = x[0].size();
	std::vector<std::vector<int>> ans(x.size(),std::vector<int>(x[0].size(),-1));
	std::vector<name> s;
	std::vector<int> group(x.size(),0);
	std::vector<std::vector<int>> round(k);
	for(int q = 0;q < N;q++) {
		for(int w = 0;w < M;w++) {
			name n;
			n.value = x[q][w];
			n.i = q;
			n.j = w;
			s.push_back(n);
		}
	}
	std::sort(s.begin(),s.end());
	int i = s.size() - 1;
	int t = 0;
	std::vector<std::vector<name>> upper(N);
	while(i >= 0 && t < k * N / 2) {
		name e = s[i--];
		if(group[e.i] == k) continue;
		upper[e.i].push_back(e);
		group[e.i]++;
		t++;
	}
	i = 0;
	t = 0;
	std::vector<std::vector<name>> lower(N);
	for(int q = 0;q < N;q++) {
		while(group[q] != k) {
			name n;
			n.i = q;
			n.j = group[q];
			n.value = x[q][group[q]++];
			lower[q].push_back(n);
		}
	}
	std::vector<int> start_pos(N);
	int r = 0;
	int j = 0;
	while(true) {
		if (upper[j].size() == 0) {
			start_pos[j] = r;
			++j;
			if(j == upper.size()) break;
		}
		if(upper[j].size() == 0) continue;
		round[r].push_back(upper[j].back().value);
		ans[upper[j].back().i][upper[j].back().j] = r;
		upper[j].pop_back();
		++r;
		r%=k;
	}
	r = 0;
	j = 0;
	while(j < lower.size()) {
		r = start_pos[j];
		for(int q = 0;q < lower[j].size();q++) {
			round[r].push_back(lower[j].back().value);
			ans[lower[j].back().i][lower[j].back().j] = r;
			lower[j].pop_back();
			++r;
			r%=k;
		}
		++j;
	}

	ll res = 0;
	for(int q = 0;q < k;q++) {
		std::sort(round[q].begin(),round[q].end());
		for(int w = 0;w < N / 2;w++) {
			res -= round[q][w];
		}
		for(int w = N / 2;w < N;w++) {
			res += round[q][w];
		}
	}
	allocate_tickets(ans);
	return res;
}

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:62:9: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<name> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |    if(j == upper.size()) break;
      |       ~~^~~~~~~~~~~~~~~
tickets.cpp:73:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<name> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  while(j < lower.size()) {
      |        ~~^~~~~~~~~~~~~~
tickets.cpp:75:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<name>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for(int q = 0;q < lower[j].size();q++) {
      |                 ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 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