제출 #704066

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
704066		bebra	카니발 티켓 (IOI20_tickets)	C++17	11 / 100	2 ms	700 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>> s(n, vector<int>(m, -1));
    vector<pair<int, int>> a;
    for (int i = 0; i < n; ++i) {
        s[i][0] = 0;
        a.emplace_back(x[i][0], i);
    }
    sort(a.begin(), a.end());
    for (int i = 0; i < n / 2; ++i) {
        auto [val, idx] = a[i];
        s[idx][0] = 0;
    }
    ll ans = 0;
    int mn = 1e9 + 5;
    for (int i = n / 2; i < n; ++i) {
        auto [val, idx] = a[i];
        s[idx][m - 1] = 0;
        mn = min(mn, x[idx][m - 1]);
    }
    for (int i = 0; i < n / 2; ++i) {
        auto [val, idx] = a[i];
        ans += abs(val - mn);
    }
    for (int i = n / 2; i < n; ++i) {
        auto [val, idx] = a[i];
        ans += abs(x[idx][m - 1] - mn); 
    }
    // bipartite graph? 

    allocate_tickets(s);
    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: 0 / 16
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 12
• Subtask 6: 0 / 23
• Subtask 7: 0 / 10