제출 #301214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
301214		IgorI	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	757 ms	51504 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<vector<int> > ans(n, vector<int>(m, -1));

    vector<pair<long long, pair<int, int> > > moo;
    for (int e = 0; e < k; e++)
    {
        for (int i = 0; i < n; i++)
        {
            ans[i][e] = e;
            moo.push_back({x[i][e] + x[i][e + m - k], {i, e}});
        }
    }
    sort(moo.begin(), moo.end());
    reverse(moo.begin(), moo.end());
    for (int i = 0; i < n / 2 * k; i++)
    {
        int a = moo[i].second.first;
        int b = moo[i].second.second;
        int z = ans[a][b];
        ans[a][b] = -1;
        ans[a][b + m - k] = z;
    }
    allocate_tickets(ans);
    long long res = 0;
    vector<vector<int> > day(k);
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            if (ans[i][j] != -1)
            {
                day[ans[i][j]].push_back(x[i][j]);
            }
        }
    }
    for (int i = 0; i < k; i++)
    {
        sort(day[i].begin(), day[i].end());
        for (int j = 0; j < n / 2; j++)
        {
            res += day[i][j + n / 2] - day[i][j];
        }
    }
    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