Submission #1091515

#TimeUsernameProblemLanguageResultExecution timeMemory
1091515efishel카니발 티켓 (IOI20_tickets)C++17
27 / 100
348 ms73148 KiB
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using ii = pair <ll, ll>;
using vii = vector <ii>;
using vi = vector <int>;
using vvi = vector <vi>;

ll find_maximum (int k, vvi x) {
    ll n = x.size(), m = x[0].size();
    vii th;
    for (ll i = 0; i < n; i++) {
        th.push_back({ x[i][0]+x[i][m-1], i });
    }
    sort(th.begin(), th.end());
    vvi answer(n, vi(m, -1));
    ll ans = 0;
    for (ll i = 0; i < n/2; i++) {
        ll j = th[i].second;
        answer[j][0] = 0;
        ans -= x[j][0];
    }
    for (ll i = n/2; i < n; i++) {
        ll j = th[i].second;
        answer[j][m-1] = 0;
        ans += x[j][m-1];
    }
    allocate_tickets(answer);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...