oj.uz

답안 #542209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
542209 2022-03-25T18:01:46 Z LucaDantas 카니발 티켓 (IOI20_tickets) C++17
55 / 100
 797 ms 84200 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();

	if(k == 1) {
		long long ans = 0;
		vector<vector<int>> build(n, vector<int>(m, -1));

		for(int i = 0; i < n; i++)
			ans -= x[i][0], build[i][0] = 0;

		vector<pair<int,int>> opt;
		for(int i = 0; i < n; i++)
			opt.push_back({x[i].back() + x[i].front(), i});
		sort(opt.begin(), opt.end(), greater<pair<int,int>>());
		
		for(int i = 0; i < n/2; i++)
			build[opt[i].second].front() = -1, build[opt[i].second].back() = 0, ans += opt[i].first;

		allocate_tickets(build);
		return ans;
	}

	if(k == m) {
		long long ans = 0;
		vector<pair<int,pair<int,int>>> all;
		vector<vector<int>> build(n, vector<int>(m, -1));

		for(int i = 0; i < n; i++)
			for(int j = 0; j < m; j++)
				all.push_back({x[i][j], {i, j}});
		sort(all.begin(), all.end());
		
		vector<vector<int>> rm(n), add(n);
		
		for(int i = 0; i < n*m/2; i++)
			rm[all[i].second.first].push_back(all[i].second.second), ans -= all[i].first;
		
		for(int i = n*m/2; i < n*m; i++)
			add[all[i].second.first].push_back(all[i].second.second), ans += all[i].first;
		
		vector<vector<bool>> mark(n, vector<bool>(m));
		int index = 0;
		for(int i = 0; i < n; i++)
			for(int j = 0; j < (int)rm[i].size(); j++, index = (index+1)%k)
				build[i][rm[i][j]] = index, mark[i][index] = 1;
		
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < (int)add[i].size(); j++, index = (index+1)%k) {
				while(mark[i][index]) index = (index + 1) % k;
				build[i][add[i][j]] = index;
				mark[i][index] = 1;
			}
		}

		allocate_tickets(build);
		return ans;
	}

	int mx = 0;
	for(auto vetor : x)
		for(int sla : vetor)
			mx = max(mx, sla);

	if(mx <= 1) {
		vector<vector<int>> build(n, vector<int>(m, -1));
		
		vector<pair<int,pair<vector<int>, vector<int>>>> pares;

		for(int i = 0; i < n; i++) {
			vector<int> p, n;
			for(int j = 0; j < m; j++)
				if(x[i][j]) p.push_back(j);
				else n.push_back(j);
			pares.push_back({i, {p, n}});
		}

		for(int round = 0; round < k; round++) {
			sort(pares.begin(), pares.end(), [](const auto& a, const auto& b) { return a.second.first.size() > b.second.first.size(); });

			for(int i = 0; i < n/2; i++) {
				int id = pares[i].first;
				bool swp = 0;
				if(!pares[i].second.first.size()) swp = 1;
				
				if(swp) swap(pares[i].second.first, pares[i].second.second);
				
				build[id][pares[i].second.first.back()] = round;
				pares[i].second.first.pop_back();

				if(swp) swap(pares[i].second.first, pares[i].second.second);
			}

			for(int i = n/2; i < n; i++) {
				swap(pares[i].second.first, pares[i].second.second);

				int id = pares[i].first;
				bool swp = 0;
				if(!pares[i].second.first.size()) swp = 1;
				
				if(swp) swap(pares[i].second.first, pares[i].second.second);
				
				build[id][pares[i].second.first.back()] = round;
				pares[i].second.first.pop_back();

				if(swp) swap(pares[i].second.first, pares[i].second.second);

				swap(pares[i].second.first, pares[i].second.second);
			}
		}

		int soma = 0;
		for(int i = 0; i < n; i++)
			for(int j = 0; j < m; j++)
				if(build[i][j] != -1) soma += x[i][j];

		allocate_tickets(build);
		return min(soma, k*n - soma);
	}

	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 21 ms 2276 KB Output is correct
6 Correct 475 ms 51372 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 22 ms 2912 KB Output is correct
6 Correct 489 ms 61896 KB Output is correct
7 Correct 585 ms 62316 KB Output is correct
8 Correct 4 ms 724 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 300 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 6 ms 980 KB Output is correct
13 Correct 23 ms 2412 KB Output is correct
14 Correct 16 ms 2460 KB Output is correct
15 Correct 570 ms 63144 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 3 ms 468 KB Output is correct
5 Correct 29 ms 3784 KB Output is correct
6 Correct 7 ms 764 KB Output is correct
7 Correct 7 ms 1304 KB Output is correct
8 Correct 778 ms 84200 KB Output is correct
9 Correct 735 ms 79480 KB Output is correct
10 Correct 706 ms 78452 KB Output is correct
11 Correct 797 ms 84072 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Incorrect 1 ms 312 KB WA in grader: failure to call allocate_tickets
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Incorrect 1 ms 312 KB WA in grader: failure to call allocate_tickets
4 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 724 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 21 ms 2276 KB Output is correct
12 Correct 475 ms 51372 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 22 ms 2912 KB Output is correct
18 Correct 489 ms 61896 KB Output is correct
19 Correct 585 ms 62316 KB Output is correct
20 Correct 4 ms 724 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 300 KB Output is correct
23 Correct 1 ms 300 KB Output is correct
24 Correct 6 ms 980 KB Output is correct
25 Correct 23 ms 2412 KB Output is correct
26 Correct 16 ms 2460 KB Output is correct
27 Correct 570 ms 63144 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 29 ms 3784 KB Output is correct
33 Correct 7 ms 764 KB Output is correct
34 Correct 7 ms 1304 KB Output is correct
35 Correct 778 ms 84200 KB Output is correct
36 Correct 735 ms 79480 KB Output is correct
37 Correct 706 ms 78452 KB Output is correct
38 Correct 797 ms 84072 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 2 ms 340 KB Output is correct
41 Incorrect 1 ms 312 KB WA in grader: failure to call allocate_tickets
42 Halted 0 ms 0 KB -