Submission #433447

#	Time	Username	Problem	Language	Result	Execution time	Memory
433447		OttoTheDino	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	604 ms	51348 KiB

tickets

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

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
typedef vector<int> vi;
typedef pair<int,int> ii;

long long find_maximum(int k, vector<vi> x) {
	int n = x.size(), m = x[0].size();
    long long ans = 0;
    vector<vi> answer(n, vi(m, -1));
    priority_queue<pair<int,int>> pq;
    int used[n]={}, hi[n]={}, unused[n]={};
    rep (i,0,n-1) {
        rep (j,0,k-1) ans -= x[i][j];
        pq.push({x[i][m-1]+x[i][k-1],i});
    }
    rep (i,1,n*k/2) {
        int ma = pq.top().first, c = pq.top().second;
        pq.pop();
        ans += ma;
        if (used[c]++<k-1) pq.push({x[c][m-1-used[c]]+x[c][k-1-used[c]],c});
    }
    ii used2[n] = {};
    rep (i,0,n-1) used2[i] = {used[i],i};
    rep (i,0,n-1) unused[i] = k-used[i];
    rep (i,0,k-1) {
        sort(used2, used2+n, greater<ii>());
        rep (j,0,n/2-1) {
            int c = used2[j].second;
            used2[j] = {--used[j], c};
            answer[c][m-1-hi[c]++] = i;
        }
        rep (j,n/2,n-1) {
            int c = used2[j].second;
            answer[c][--unused[c]] = i;
        }
    }
	allocate_tickets(answer);
	return ans;
}

• 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