Submission #304422

#	Time	Username	Problem	Language	Result	Execution time	Memory
304422		urd05	Carnival Tickets (IOI20_tickets)	C++14	0 / 100	23 ms	3584 KiB

tickets

#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
 
long long dp[81][6400];
const long long nn=-1e18;
const long long INF=1e16;
 
long long find_maximum(int k, vector<vector<int>> v) {
	int n = v.size();
	int m = v[0].size();
	vector<vector<int>> answer(n,vector<int>(m));
	dp[0][0]=0;
	for(int i=1;i<=(n*k)/2;i++) {
	    dp[0][i]=-INF;
	}
	for(int i=1;i<=n;i++) {
	    for(int j=0;j<=(n*k)/2;j++) {
	        dp[i][j]=-INF;
	        long long sum=0;
	        for(int l=0;l<k;l++) {
	            sum-=v[i-1][l];
	        }
	        for(int l=0;l<=k&&l<=j;l++) {
	            dp[i][j]=max(dp[i][j],dp[i-1][j-l]+sum);
	            if (l!=k) {
	                sum+=v[i-1][m-l-1];
	                sum+=v[i-1][k-l-1];
	            }
	        }
	    }
	}
	long long ret=dp[n][(n*k)/2];
	int now=(n*k)/2;
	for(int i=n-1;i>=0;i--) {
	    int val=-1;
	    long long sum=0;
	    for(int j=0;j<k;j++) {
	        sum-=v[i][j];
	    }
	    for(int j=0;j<=k&&j<=now;j++) {
	        if (dp[i][now-j]+sum==dp[i+1][now]) {
	            val=j;
	            now-=j;
	            break;
	        }
	        if (j!=k) {
	            sum+=v[i][m-j-1];
	            sum+=v[i][k-j-1];
	        }
	    }
      if (val==-1) {
        exit(-1);
      }
	    int cnt=0;
	    for(int j=0;j<m;j++) {
	        if (j<k-val||j>=m-val) {
	            answer[i][j]=cnt++;
	        }
	        else {
	            answer[i][j]=-1;
	        }
	    }
	}
	allocate_tickets(answer);
	return ret;
}

• 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