Submission #577491

#	Time	Username	Problem	Language	Result	Execution time	Memory
577491		keta_tsimakuridze	카니발 티켓 (IOI20_tickets)	C++14	11 / 100	2 ms	732 KiB

tickets

#include "tickets.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define f first
#define s second

long long find_maximum(int k, std::vector<std::vector<int> > x) {
	int n = x.size();
	int m = x[0].size();
	vector<pair<int, pii> > v;
	vector<vector<int> > vans;
	vans.resize(n, vector<int> (m));
	for (int i = 0; i < n; i++) {
		std::vector<int> row(m);
		for (int j = 0; j < m; j++) {
			v.push_back({x[i][j], {i ,j}});
			vans[i][j] = -1;
		}
	}
	sort(v.begin(), v.end());
	deque<pair<int, pii > > d;
	for(int i = 0; i < v.size(); ++i) d.push_back(v[i]);
	long long ans = 0, T = -1;
	while(k--) {
		int x = n / 2; ++T;
		vector<int> f(n);
		vector<pair<int, pii > > add;
		while(x) {
			if(f[d.front().s.f]) add.push_back(d.front()), d.pop_front();
			else ans -= d.front().f, f[d.front().s.f] = 1, vans[d.front().s.f][d.front().s.s] = T,d.pop_front(), --x;
		}
		for(int i = (int)add.size() - 1; i >= 0; i--) d.push_front(add[i]); add.clear();
		x = n / 2;
		while(x) {
			if(f[d.back().s.f]) add.push_back(d.back()), d.pop_back();
			else ans += d.back().f, f[d.back().s.f] = 1, vans[d.back().s.f][d.back().s.s] = T, d.pop_back(), --x;
		}
		for(int i = (int)add.size() - 1; i >= 0; i--) d.push_back(add[i]);
		
	}
	allocate_tickets(vans);
	return ans;
}

Compilation message (stderr)

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:24:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |  for(int i = 0; i < v.size(); ++i) d.push_back(v[i]);
      |                 ~~^~~~~~~~~~
tickets.cpp:34:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   34 |   for(int i = (int)add.size() - 1; i >= 0; i--) d.push_front(add[i]); add.clear();
      |   ^~~
tickets.cpp:34:71: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   34 |   for(int i = (int)add.size() - 1; i >= 0; i--) d.push_front(add[i]); add.clear();
      |                                                                       ^~~

• 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