제출 #622817

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
622817		someone	Carnival Tickets (IOI20_tickets)	C++14	16 / 100	490 ms	73172 KiB

tickets

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

ll find_maximum(int k, vector<vector<int>> x) {
    ll n = x.size(), m = x[0].size(),
       sum = 0, need = k*n/2, id[n];

    vector<vector<int>> s(n);
    priority_queue<pair<ll, ll>> change;
    for(int i = 0; i < n; i++) {
        id[i] = m-k;
        s[i].resize(m);
        sort(x[i].begin(), x[i].end());
        for(int j = 0; j < id[i]; j++)
            s[i][j] = -1;
        for(int j = id[i]; j < m; j++) {
            s[i][j] = j - (m - k);
            sum += x[i][j];
            change.push({- x[i][s[i][j]] - x[i][j], i});
        }
    }
    while(need--) {
        pair<ll, ll> pii = change.top();
        change.pop();
        sum += pii.first;
        ll lig = pii.second;
        s[lig][s[lig][id[lig]]] = s[lig][id[lig]];
        s[lig][id[lig]] = -1;
        id[lig]++;
        if(id[lig] < m)
            change.push({- x[lig][s[lig][id[lig]]] - x[lig][id[lig]], lig});
    }
    allocate_tickets(s);
    return sum;
}

• Subtask 1: 0 / 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