Submission #1013617

#	Time	Username	Problem	Language	Result	Execution time	Memory
1013617		Ausp3x	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	393 ms	122184 KiB

tickets

// 人外有人，天外有天
// author: Ausp3x

// #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include "tickets.h"
using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define pb push_back
typedef long long             lng;
typedef pair<int, int>        pi;
typedef vector<int>           vi;
typedef pair<lng, lng>        pl;
typedef vector<lng, lng>      vl;

int const INF32 = 0x3f3f3f3f;
lng const INF64 = 0x3f3f3f3f3f3f3f3f;

lng find_maximum(int k, vector<vi> x) {
    int n = x.size(), m = x[0].size();
    // val, idx
    vector<vector<pi>> sorted_x(n);
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            sorted_x[i].pb({x[i][j], i * m + j});

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

    lng S = 0;
    // val, idx
    vector<priority_queue<pi>> minus(n), unused(n);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < k; j++) {
            S -= sorted_x[i][j].fi;
            minus[i].push(sorted_x[i][j]);
        }

        for (int j = k; j < m; j++)
            unused[i].push(sorted_x[i][j]);
    }

    // sum, col
    priority_queue<pi> max_change;
    for (int i = 0; i < n; i++)
        if (unused[i].size() > 0)
            max_change.push({unused[i].top().fi + minus[i].top().fi, i});

    int cnt = 0;
    vector<tuple<int, deque<int>, deque<int>>> plus(n);
    while (!max_change.empty() && cnt < k * n / 2) {
        auto [sum, col] = max_change.top();
        max_change.pop();

        S += sum;

        pi unused_cur = unused[col].top();
        pi minus_cur = unused[col].top();
        unused[col].pop();
        minus[col].pop();

        unused[col].push(minus_cur);

        get<0>(plus[col])++;
        get<1>(plus[col]).pb(unused_cur.fi);
        get<2>(plus[col]).pb(unused_cur.se);

        if (unused[col].size() > 0 && minus[col].size() > 0)
            max_change.push({unused[col].top().fi + minus[col].top().fi, col});

        cnt++;
    }

    for (int i = 0; i < n; i++)
        while (!minus[i].empty()) {
            get<1>(plus[i]).pb(minus[i].top().fi);
            get<2>(plus[i]).pb(minus[i].top().se);
            minus[i].pop();
        }

    // cout << S << endl;
    // for (int i = 0; i < n; i++) {
    //     cout << get<0>(plus[i]) << ": ";
    //     for (int x : get<1>(plus[i]))
    //         cout << x << ' ';
    //     cout << endl;
    // }

    vector<vi> s(n, vi(m, -1));
    for (int i = 0; i < k; i++) {
        sort(plus.begin(), plus.end(), greater<tuple<int, deque<int>, deque<int>>>());

        // cout << S << endl;
        // for (int j = 0; j < n; j++) {
        //     cout << get<0>(plus[j]) << ": ";
        //     for (int x : get<1>(plus[j]))
        //         cout << x << ' ';
        //     cout << endl;
        // }

        vector<int> used_cols;
        for (int j = 0; j < n / 2; j++) {
            int val = get<1>(plus[j]).front();
            int idx = get<2>(plus[j]).front();
            get<1>(plus[j]).pop_front();
            get<2>(plus[j]).pop_front();

            if (get<0>(plus[j]) > 0)
                get<0>(plus[j])--;
            else 
                S += 2 * val;
            
            s[idx / m][idx % m] = i;
        }

        for (int j = n / 2; j < n; j++) {
            int idx = get<2>(plus[j]).back();
            get<1>(plus[j]).pop_back();
            get<2>(plus[j]).pop_back();

            s[idx / m][idx % m] = i;
        }
    }

    // for (int i = 0; i < n; i++) {
    //     for (int j = 0; j < m; j++)
    //         cout << s[i][j] << ' ';
    //     cout << endl;
    // }

    allocate_tickets(s);
    return S;
}

/*
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    cin >> t;
    while (t--) {
        int n, m, k;
        cin >> n >> m >> k;
        vector<vector<int>> x(n, vector<int>(m));
        for (int i = 0; i < n; i++)
            for (int j = 0; j < m; j++)
                cin >> x[i][j];

        cout << find_maximum(k, x) << endl;
    }

    return 0;
}
//*/

• 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