제출 #1024144

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1024144		TheWilp	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	2 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;
	}	
};

class name2{
public:
	int value;
	int i;
	bool operator<(const name2& 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(N,std::vector<int>(M,-1));
	std::vector<int> group(N,0);
	std::vector<std::vector<int>> round(k);
	std::vector<name> s;
	std::vector<std::vector<name2>> ss(N);
	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);
			name2 n2;
			n2.value = x[q][w];
			n2.i = w;
			ss[q].push_back(n2);
		}
	}
	std::sort(s.begin(),s.end());
	for(int q = 0;q < N;q++) std::sort(ss[q].begin(),ss[q].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++) {
		int count1 = 0;
		while(group[q] < k) {
			name n;
			n.i = q;
			n.j = ss[q][count1++].i;
			n.value = x[q][group[q]++];
			lower[q].push_back(n);
		}
	}
	
	int r = 0;
	int j = 0;
	std::vector<int> start_pos(N);
	while(j < upper.size()) {
		for(int q = 0;q < upper[j].size();q++) {
			round[r].push_back(upper[j][q].value);
			ans[upper[j][q].i][upper[j][q].j] = r;
			++r;
			r%=k;
		}
		start_pos[j] = r;
		++j;
	}

	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][q].value);
			ans[lower[j][q].i][lower[j][q].j] = r;
			++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;
}

컴파일 시 표준 에러 (stderr) 메시지

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:77:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<name> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |  while(j < upper.size()) {
      |        ~~^~~~~~~~~~~~~~
tickets.cpp:78:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<name>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |   for(int q = 0;q < upper[j].size();q++) {
      |                 ~~^~~~~~~~~~~~~~~~~
tickets.cpp:90:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<name> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |  while(j < lower.size()) {
      |        ~~^~~~~~~~~~~~~~
tickets.cpp:92:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<name>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |   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