Submission #957109

#	Time	Username	Problem	Language	Result	Execution time	Memory
957109		12345678	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	411 ms	108336 KiB

tickets

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

using namespace std;

#define ll long long

const int nx=1505;

pair<ll, int> dp[nx][nx];

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int>> res(n, vector<int> (m, -1));
    for (int i=1; i<=n; i++) dp[0][i].first=-1e18;
    for (int i=1; i<=n; i++)
    {
        for (int j=0; j<=i; j++)
        {
            dp[i][j].first=-1e18;
            if (j!=0) dp[i][j]=max(dp[i][j], {dp[i-1][j-1].first-x[i-1][0], 1});
            if (j!=i) dp[i][j]=max(dp[i][j], {dp[i-1][j].first+x[i-1][m-1], 0});
        }
    }
    auto cur=dp[n][n/2];
    int cj=n/2;
    for (int i=n; i>=1; i--)
    {
        //printf("here %d %d %d\n", i, cj, cur.second);
        if (cur.second) res[i-1][0]=0;
        else res[i-1][m-1]=0;
        if (cur.second) cur=dp[i-1][--cj];
        else cur=dp[i-1][cj];
    }
	allocate_tickets(res);
	return dp[n][n/2].first;
}

• 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