제출 #1143767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1143767		PagodePaiva	카니발 티켓 (IOI20_tickets)	C++20	0 / 100	796 ms	10004 KiB

tickets

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

using namespace std;

const int N = 85;
vector <vector <int>> x;
int n, m, k;
int l[N], r[N];
int cnt[N];
int ans[N][N];
long long dp[N][N*N];
int best[N][N*N];
long long pref[N][N];
vector <vector <int>> answer;

/*
X <= (N/2)*K
dp[i][j] = estou na linha i e quero pegar j bons
O(n*n*k*m)
*/

long long query(int linha, int l, int r){
	if(r < l) return 0;
	if(l == 0) return pref[linha][r];
	return pref[linha][r]-pref[linha][l-1];
}

void solve(){
	memset(ans, -1, sizeof ans);
	vector<array <int, 3>> valores;
	for(int i = 0;i < n;i++){
		cnt[i] = 0;
		for(int j = 0;j <= l[i];j++){
			valores.push_back({x[i][j], i, j});
		}
		for(int j = r[i];j < m;j++){
			valores.push_back({x[i][j], i, j});
		}
	}	
	sort(valores.begin(), valores.end());
	for(int i = 0;i < (n/2)*k;i++){
		cnt[valores[i][1]]++;
	}
	long long res = 0;
	int turno = 0;
	for(int i = 0;i < n;i++){
		r[i] = m-1;
		l[i] = 0;
	}
	for(int i = 0;i < k;i++){
		vector <pair <int, int>> contadores;
		for(int i = 0;i < n;i++){
			contadores.push_back({cnt[i], i});
		}
		sort(contadores.begin(), contadores.end());
		for(int i = 0;i < n/2;i++){
			swap(contadores[i].first, contadores[i].second);
			ans[contadores[i].first][r[contadores[i].first]] = turno;
			res += x[contadores[i].first][r[contadores[i].first]];
			r[contadores[i].first]--;
		}
		for(int i = n/2;i < n;i++){
			swap(contadores[i].first, contadores[i].second);
			ans[contadores[i].first][l[contadores[i].first]] = turno;
			res -= x[contadores[i].first][l[contadores[i].first]];
			l[contadores[i].first]++;
			cnt[contadores[i].first]--;
		}
		turno++;
	}
	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);
}

long long find_maximum(int kk, std::vector<std::vector<int>> xx) {
	x = xx;
	memset(ans, -1, sizeof ans);
	n = x.size();
	m = x[0].size();
	k = kk;
	vector<array <int, 3>> valores;
	for(int i = 0;i < n;i++){
		for(int j = 0;j < m;j++){
			valores.push_back({x[i][j], i, j});
			pref[i+1][j] = (j == 0 ? 0 : pref[i+1][j-1]) + x[i][j];
		}
	}	
	sort(valores.begin(), valores.end());
	for(int i = 0;i < (n/2)*m;i++){
		cnt[valores[i][1]+1]++;
	}
	long long res = 0;
	dp[0][0] = 0;
	for(int i = 1;i <= n*k;i++){
		dp[0][i] = -1e11;
	}
	for(int i = 1;i <= n;i++){
		for(int j = 0;j <= (n/2)*k;j++){
			dp[i][j] = -1e11;
			best[i][j] = -1;
			for(int t = 0;t <= k;t++){
				if(j-t < 0) break;
				if(t > cnt[i]) continue;
				if(k-t > m-cnt[i]) continue;
				if(dp[i][j] < dp[i-1][j-t] - query(i, 0, t-1) + query(i, m-(k-t), m-1)){
					dp[i][j] = dp[i-1][j-t] - query(i, 0, t-1) + query(i, m-(k-t), m-1);
					best[i][j] = t;
				}
			}
		}
	}
	int nn = n, qtd = (n/2)*k;
	while(nn > 0){
		int v = best[nn][qtd];
		l[nn-1] = v-1;
		r[nn-1] = m-(k-v);
		qtd -= v;
		nn--;
	}
	solve();
	return dp[n][(n/2)*k];
}

• 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