제출 #704577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704577		bebra	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	459 ms	51440 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> first(n, 0);
    vector<int> last(n, m - 1);
    ll ans = 0;
    for (int t = 0; t < k; ++t) {
        vector<int> a(n);
        iota(a.begin(), a.end(), 0);
        nth_element(a.begin(), a.begin() + n / 2, a.end(), [&](int lhs, int rhs) {
            return x[lhs][first[lhs]] + x[lhs][last[lhs]] > x[rhs][first[rhs]] + x[rhs][last[rhs]];
        });
        for (int i = 0; i < n / 2; ++i) {
            res[a[i]][last[a[i]]] = t;
            ans += x[a[i]][last[a[i]]];
            --last[a[i]];
        }
        for (int i = n / 2; i < n; ++i) {
            res[a[i]][first[a[i]]] = t;
            ans -= x[a[i]][first[a[i]]];
            ++first[a[i]];
        }
    }

    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