제출 #1062932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062932		Kipras	카니발 티켓 (IOI20_tickets)	C++17	0 / 100	1 ms	348 KiB

tickets

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

constexpr ll maxN = 1510;
vector<pair<ll, ll>> colours[maxN];

vector<vector<int>> ans;


long long find_maximum(int k, vector<vector<int>> a) {
    ll coloursN = a.size();
    ll n = a[0].size();
    ll res=0;
    for(int i = 0; i < coloursN; i++) {
        vector<int> tmp;
        for(int x = 0; x < n; x++) {
            colours[i].push_back({a[i][x], x});
            tmp.push_back({-1});
        }
        ans.push_back(tmp);
    }


    for(int i = 0; i < coloursN; i++)
        sort(colours[i].begin(), colours[i].end());

    priority_queue<pair<ll, pair<ll, pair<ll, ll>>>> q;

    for(int i = 0; i < coloursN; i++) {
        for(int x = 0; x < k; x++) {
            res+=colours[i][x].first;
            ans[i][colours[i][x].second]=x;
            q.push({-colours[i][x].first-colours[i][n-k+x].first, {i, {x, n-k+x}}});
        }
    }

    for(int i = 0; i < k*(coloursN/2); i++) {
        pair<ll, pair<ll, pair<ll, ll>>> tmpPair = q.top();
        q.pop();
        res-= tmpPair.first;
        ll color = tmpPair.second.first;
        ll u = tmpPair.second.second.first;
        ll v = tmpPair.second.second.second;

        ans[color][v]=ans[color][u];
        if(u!=v)ans[color][u]=-1;
    }

    allocate_tickets(ans);
    return res;
}

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