제출 #301022

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

tickets

#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

long long find_maximum(int k, std::vector<std::vector<int>> x)
{
    int n = x.size(), m = x[0].size();
    vector<int> fr(n), to(n, m - 1);
    vector<vector<int> > ans(n, vector<int>(m, -1));
    long long res = 0;
    for (int e = 0; e < k; e++)
    {
        long long cur = 0;
        vector<pair<long long, int> > upd;
        for (int i = 0; i < n; i++)
        {
            cur -= x[i][fr[i]];
            upd.push_back({x[i][fr[i]] + x[i][to[i]], i});
        }
        sort(upd.begin(), upd.end());
        reverse(upd.begin(), upd.end());
        for (int i = 0; i < n / 2; i++)
        {
            cur += upd[i].first;
            int id = upd[i].second;
            ans[id][to[id]] = e;
            to[id]--;
        }
        for (int i = n / 2; i < n; i++)
        {
            int id = upd[i].second;
            ans[id][fr[id]] = e;
            fr[id]++;
        }
        res += cur;
    }
    allocate_tickets(ans);
    return res;
}

• 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