제출 #734691

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
734691		Elvin_Fritl	카니발 티켓 (IOI20_tickets)	C++17	27 / 100	532 ms	73048 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
 
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;
    vector<int> s;
    for (int i = 0; i < n / 2; ++i) {
        res[a[i]][m - 1] = 0;
        s.push_back(x[a[i]][m - 1]);
    }
    for (int i = n / 2; i < n; ++i) {
        res[a[i]][0] = 0;
        s.push_back(x[a[i]][0]);
    }
    sort(s.begin(), s.end());
    for (int i = 0; i < n / 2; ++i) {
        ans -= s[i];
    }
    for (int i = n / 2; i < n; ++i) {
        ans += s[i];
    }
    allocate_tickets(res);
    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