제출 #928609

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
928609		SUNWOOOOOOOO	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	417 ms	73284 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using pLL = array <LL, 2>;
using tLL = array <LL, 3>;

LL find_maximum(int k, vector<vector<int>> x) {
    LL ans = 0;
	int n = x.size(), m = x[0].size();
    vector <pLL> A;
    vector<vector<int>> s;
    s.resize(n, vector <int> (m, -1));
    priority_queue <tLL> pq;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            ans -= x[i][j];
            s[i][j] = j;
        }
    }
    for (int i = 0; i < n; i++) pq.push({x[i][k - 1] + x[i][m - 1], i, k - 1});
    for (int i = 0; i < n * k / 2; i++){
        tLL now = pq.top(); pq.pop();
        ans += now[0];
        s[now[1]][now[2]] = -1;
        s[now[1]][now[2] + m - k] = now[2];
        if (now[2]) pq.push({x[now[1]][now[2] - 1] + x[now[1]][now[2] + m - k - 1], now[1], now[2] - 1});
    }
    allocate_tickets(s);
    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