제출 #346427

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
346427		two_sides	카니발 티켓 (IOI20_tickets)	C++17	100 / 100	865 ms	64876 KiB

tickets

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

using namespace std;

const int N = 1505;

int a[N][N], l[N], r[N], b[N][N], p[N];
priority_queue <pair <int, int>> pq;

long long find_maximum(int k, vector <vector <int>> x) {
    long long res = 0;
    int n = x.size(), m = x[0].size();
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)
            a[i][j] = x[i - 1][j - 1];
        for (int j = 1; j <= k; j++)
            res -= a[i][j];
        l[i] = k; r[i] = m;
        pq.emplace(a[i][k] + a[i][m], i);
    }
    int cntr = 0;
    for (int i = 1; i <= n; i++) p[i] = i;
    while (cntr < n / 2 * k) {
        int v, i; tie(v, i) = pq.top(); pq.pop();
        res += v; l[i]--; r[i]--; cntr++;
        if (l[i] > 0)
            pq.emplace(a[i][l[i]] + a[i][r[i]], i);
    }
    memset(b, -1, sizeof b);
    while (k--) {
        sort(p + 1, p + n + 1,
        [](int i, int j) {return l[i] > l[j];});
        for (int i = 1; i <= n / 2; i++) {
            b[p[i]][l[p[i]]] = k; l[p[i]]--;
        }
        for (int i = n / 2 + 1; i <= n; i++) {
            r[p[i]]++; b[p[i]][r[p[i]]] = k;
        }
    }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            x[i][j] = b[i + 1][j + 1];
    allocate_tickets(x); return res;
}

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