제출 #1059113

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1059113		Lalic	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	280 ms	90856 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define mp make_pair

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef complex<double> cd;

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans(n, vector<int>(m, -1));
	
	vector<vector<ll>> dp(n, vector<ll>(n/2+1, -1e17));
	vector<vector<pii>> prev(n, vector<pii>(n/2+1));
	dp[0][0]=x[0][m-1]; prev[0][0]={-1, 0};
	dp[0][1]=-x[0][0]; prev[0][1]={-1, 0};
	
	for(int i=1;i<n;i++){
		for(int j=n/2;j>=0;j--){
			dp[i][j]=dp[i-1][j]+x[i][m-1]; prev[i][j]={i-1, j};
			
			if(j && dp[i-1][j-1]-x[i][0]>dp[i][j]){
				dp[i][j]=dp[i-1][j-1]-x[i][0];
				prev[i][j]={i-1, j-1};
			}
		}
	}
	
	pii curr={n-1, n/2};
	while(curr.fi!=-1){
		pii ant=prev[curr.fi][curr.se];
		if(ant.se==curr.se) ans[curr.fi][m-1]=0;
		else ans[curr.fi][0]=0;
		curr=ant;
	}
	allocate_tickets(ans);
	
	return dp[n-1][n/2];
}

• Subtask 1: 11 / 11
• Subtask 2: 16 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10