제출 #1066379

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1066379		allin27x	Carnival Tickets (IOI20_tickets)	C++17	25 / 100	806 ms	149668 KiB

tickets

#include <bits/stdc++.h>
using namespace std;
#define int long long

void allocate_tickets(vector<vector<signed>> s);

int find_maximum(signed k, vector<vector<signed>> x) {
    int n = x.size(); int m = x[0].size();
    vector<vector<signed>> s(n, vector<signed>(m,-1));
    vector<queue<int>> pls(n);
    vector<queue<int>> mns(n);
    vector<array<int, 3>> ps;
    for (int i=0; i<n; i++) for (int j=0; j<m; j++) ps.push_back({x[i][j], i, j});
    sort(ps.begin(), ps.end());
    int ans = 0;
    for (int i=0; i<m*n/2; i++) {
        mns[ps[i][1]].push(ps[i][2]);
        ans -= ps[i][0];
    }
    for (int i=m*n/2; i<m*n; i++) {
        pls[ps[i][1]].push(ps[i][2]);
        ans += ps[i][0];
    }
    set<pair<int,int>> pl;
    for (int i=0; i<n; i++) pl.insert({pls[i].size(), i});
    vector<int> bg(n, 0);
    for (int rnd = 0; rnd<k; rnd++){
        bg.assign(n,0);
        for (int i=0; i<n/2; i++) {
            bg[(*pl.rbegin()).second] = 1; pl.erase(*pl.rbegin());
        }
        for (int i=0; i<n; i++) {
            if (bg[i]) {
                s[i][pls[i].front()]=rnd; pls[i].pop();
                pl.insert({pls[i].size(), i});
            } else {
                s[i][mns[i].front()]=rnd; mns[i].pop();
            }
        }
    }
    allocate_tickets(s);
    return ans;
}

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