Submission #704177

#	Time	Username	Problem	Language	Result	Execution time	Memory
704177		bebra	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	438 ms	51280 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define dbg(x) cerr << #x << ": " << x << endl;
 
 
ll find_maximum(int k, vector<vector<int>> x) {
    int n = x.size();
    int m = x[0].size();

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

    vector<int> a(n);
    iota(a.begin(), a.end(), 0);
    sort(a.begin(), a.end(), [&](int lhs, int rhs) {
        return x[lhs][m - 1] + x[lhs][0] > x[rhs][m - 1] + x[rhs][0];
    });

    ll ans = 0;
    for (int i = 0; i < n / 2; ++i) {
        res[a[i]][m - 1] = 0;
        ans += x[a[i]][m - 1];
    }
    for (int i = n / 2; i < n; ++i) {
        res[a[i]][0] = 0;
        ans -= x[a[i]][0];
    }
    allocate_tickets(res);
    return ans;
}
 
 
// int main() {
 //    int n, m, k;
 //    cin >> n >> m >> k;
 
 //    vector<vector<int>> a(n, vector<int>(m));
 //    for (int i = 0; i < n; ++i) {
 //        for (int j = 0; j < m; ++j) {
 //            cin >> a[i][j];
 //        }
 //    }
 
 //    cout << find_maximum(k, a);
// }

• 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