Submission #448222

#	Time	Username	Problem	Language	Result	Execution time	Memory
448222		dxz05	Carnival Tickets (IOI20_tickets)	C++14	27 / 100	3061 ms	51364 KiB

tickets

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

typedef long long ll;

#define MP make_pair

using namespace std;

long long find_maximum(int k, vector<vector<int>> a) {
	int n = a.size();
	int m = a[0].size();

	ll ans = 0;

    vector<vector<int>> answer(n, vector<int>(m, -1));

    for (int it = 0; it < k; it++) {
        vector<pair<pair<ll, int>, pair<int, int>>> v;
        for (int i = 0; i < n; i++) {
            int l = -1, r = -1;
            for (int j = 0; j < m; j++){
                if (answer[i][j] != -1) continue;
                if (l == -1 || a[i][j] < a[i][l]) l = j;
                if (r == -1 || a[i][j] > a[i][r]) r = j;
            }
            answer[i][r] = it;
            ans += a[i][r];
            v.emplace_back(MP(-a[i][r] - a[i][l], i), MP(l, r));
        }

        sort(v.rbegin(), v.rend());

        for (int i = 0; i < n / 2; i++) {
            ans += v[i].first.first;
            answer[v[i].first.second][v[i].second.second] = -1;
            answer[v[i].first.second][v[i].second.first] = it;
        }

    }

    allocate_tickets(answer);

    return ans;
}

• 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