Submission #478998

#	Time	Username	Problem	Language	Result	Execution time	Memory
478998		khoabright	Carnival Tickets (IOI20_tickets)	C++17	100 / 100	868 ms	98048 KiB

tickets

#include <bits/stdc++.h>
using namespace std;

//#define int long long 
#define ff first
#define ss second
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define rep1(i, a, b) for (int i = (int)a; i >= (int)b; --i)
#define mp make_pair
#define vii vector<vector<int>>
#define ll long long 

const int N = 2e5 + 5;  
const ll inf = 2e9 + 5;

void allocate_tickets(vii a);
// void allocate_tickets(vii a) {
//     int n = a.size(), m = a[0].size();
//     rep(i, 0, n - 1) {
//         rep(j, 0, m - 1) {
//             cout << a[i][j] << ' ';
//         }
//         cout << '\n';
//     }
// }

struct ticket{
    int color, order, value;
};

bool operator < (const ticket &x, const ticket &y) {
    if (x.value == y.value) {
        return mp(x.color, x.order) < mp(y.color, y.order);
    }
    return x.value < y.value;
}  

ll find_maximum(int k, vii a) {
    function<int()> sub1 = [&]() {
        int n = a.size();
        vector<int> v(n);
        rep(i, 0, n - 1) v[i] = a[i][0];
        sort(all(v));
        int bound = v[n / 2];
        int prize = 0;
        rep(i, 0, n - 1) prize += abs(v[i] - bound);
        rep(i, 0, n - 1) a[i][0] = 0;
        allocate_tickets(a);
        return prize;
    };

    function<ll()> sub2 = [&]() {
        int n = a.size(), m = a[0].size();
        vii allo(n, vector<int> (m));
        
        ll prize = 0;
        vector<ticket> Replace;
        vector<int> Plus(n + 1, k);

        rep(i, 0, n - 1) {
            rep1(j, m - 1, m - k) {
                prize += a[i][j];
                allo[i][j] = 1;
            }

            rep(j, 0, k - 1) {
                ticket tmp;
                tmp.color = i;
                tmp.order = j;
                tmp.value = a[i][j] + a[i][m - k + j];
                Replace.push_back(tmp);
            }
        }

        sort(all(Replace));
        
        //cout<<"prize,m="<<prize<<' '<<m<<'\n';
        rep(i, 1, k * (n / 2)) {
            auto [color, order, value] = Replace[i - 1];
            //cout<<"123="<<color<<' '<<order<<' '<<value<<'\n';
            prize -= value;

            --Plus[color];            
            allo[color][m - k + order] = 0;
            allo[color][order] = -1;
        }

        vector<int> v(n);
        rep(i, 0, n - 1) v[i] = i;

        sort(all(v), [&](int x, int y) {
            return Plus[x] < Plus[y];
        });


        vector<int> cnt(k);
        // cout<<'\n';
        // rep(i, 0, n - 1) {
        //     rep(j, 0, m - 1) {
        //         cout << allo[i][j] << ' ';
        //     }
        //     cout << '\n';
        // }
        // cout<<'\n';

        int start = -1;
        rep(ii, 0, n - 1) {
            int i = v[ii];
            while (start < k && cnt[start] >= n / 2) {++start;}
            //cout<<"i,start="<<i<<' '<<start<<'\n';

            vector<bool> used(m);

            rep(j, 0, m - 1) {
                if (allo[i][j] != -1) break;
                start = (start + 1) % k;
                allo[i][j] = start + 1;
                used[start] = 1;
            }

            int fin = 0;
            rep1(j, m - 1, 0) {
                if (allo[i][j] != 1) break;
                while (fin < k && used[fin]) ++ fin;
                if (fin >= k) break;
                allo[i][j] = fin + 1;
                ++fin;
            }
        }
        

        rep(i, 0, n - 1) rep(j, 0, m - 1) --allo[i][j];
    
        allocate_tickets(allo);
        return prize;
    };

    return sub2();
}

// signed main() {
//     //freopen("ticket.inp", "r", stdin);
//     int n, m, k; cin >> n >> m >> k;
//     vii a(n, vector<int> (m));
//     rep(i, 0, n - 1) rep(j, 0, m - 1) cin >> a[i][j];   
//     cout << find_maximum(k, a);
// }

• 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