제출 #1201880

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1201880		Triseedot	카니발 티켓 (IOI20_tickets)	C++20	27 / 100	318 ms	51380 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
#define len(v) (int) (v.size())
#define all(v) v.begin(), v.end()
using ll = long long;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = len(x);
	int m = len(x[0]);

	vector answer(n, vector(m, -1));

    vector<int> cnt(n, 0);
    priority_queue<pair<int, int>> delta;
    for (int i = 0; i < n; i++) {
        delta.push({x[i][k - 1] + x[i][m - 1], i});
    }
    for (int z = 0; z < n * k / 2; z++) {
        auto [_, i] = delta.top();
        delta.pop();
        cnt[i]++;
        if (cnt[i] < k) {
            delta.push({x[i][k - 1 - cnt[i]] + x[i][m - 1 - cnt[i]], i});
        }
    }

    vector<int> idx(n);
    iota(all(idx), 0ll);
    vector<int> ptr_l(n, 0), ptr_r(n, m - 1);
    ll score = 0;
    for (int ki = 0; ki < k; ki++) {
        sort(all(idx), [&] (int i, int j) {
            return cnt[i] < cnt[j];
        });
        for (int i = 0; i < n / 2; i++) {
            int j = idx[i];
            score -= x[j][ptr_l[j]];
            answer[j][ptr_l[j]++] = ki;
        }
        for (int i = n / 2; i < n; i++) {
            int j = idx[i];
            score += x[j][ptr_r[j]];
            answer[j][ptr_r[j]--] = ki;
        }
    }

	allocate_tickets(answer);
	return score;
}

• 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