제출 #1142865

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1142865		PagodePaiva	Carnival Tickets (IOI20_tickets)	C++20	0 / 100	4 ms	9288 KiB

tickets

#include<bits/stdc++.h>
#include "tickets.h"
#include <vector>

using namespace std;

const int N = 1510;
int ans[N][N];
int l[N], r[N];

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>> answer;
	vector <array <int, 3>> trip;
	for(int i = 0;i < n;i++){
		int qtd0 = 0, qtd1 = 0;
		l[i] = 0, r[i] = m-1;
		for(int j = 0;j < m;j++){
			if(x[i][j] == 0) qtd0++;
			else qtd1++;
		}
		trip.push_back({qtd0, qtd1, i});
	}
	memset(ans, -1, sizeof ans);
	int at = 0;
	long long res = 0;
	while(k > 0){
		int cnt0 = 0, cnt1 = 0;
		for(auto [a, b, c] : trip){
			if(a > 0) cnt0++;
			if(b > 0) cnt1++;
		}
		if(cnt0 > cnt1){
			for(auto &p : trip){
				if(p[0] > 0){
					ans[p[2]][l[p[2]]] = at;
					l[p[2]]++;
					p[0]--;
				}
				else{
					ans[p[2]][r[p[2]]] = at;
					r[p[2]]--;
					p[1]--;
					res++;
				}
			}
			at++;
		}
		else{
			for(auto &p : trip){
				if(p[1] == 0){
					ans[p[2]][l[p[2]]] = at;
					l[p[2]]++;
					p[0]--;
					res++;
				}
				else{
					ans[p[2]][r[p[2]]] = at;
					r[p[2]]--;
					p[1]--;
				}
			}
			at++;
		}
		k--;
	}
	for(int i = 0;i < n;i++){
		vector <int> aux;
		for(int j = 0;j < m;j++){
			aux.push_back(ans[i][j]);
		}
		answer.push_back(aux);
	}
	allocate_tickets(answer);
	return res;
}

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