제출 #406009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
406009		tiberiu	카니발 티켓 (IOI20_tickets)	C++14	0 / 100	1 ms	204 KiB

tickets

#include "tickets.h"
#include <vector>
#include <algorithm>
#include <iostream>
#include <set>


using namespace std;

typedef pair<int, int> pii;

long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> ans = vector<vector<int>>(n, vector<int>(m, -1));

	set<pii> t[n];
	for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            t[i].insert({x[i][j], j});

    int win = 0;
    for (int r = 0; r < k; r++) {
        vector<pii> c;
        for (int j = 0; j < n; j++) {
            c.push_back({t[j].begin()->first + t[j].rbegin()->first, j});
//            cout << c.back().first << ' ';
        }
//        cout << endl;
        sort(c.begin(), c.end());

        for (int i = 0; i < n / 2; i++) {
            int col = c[i].second;
            int ix = t[col].begin()->second;
            win -= x[col][ix];
            ans[col][ix] = r;
            t[col].erase({x[col][ix], ix});
        }
        for (int i = n / 2; i < n; i++) {
            int col = c[i].second;
            int ix = t[col].rbegin()->second;
            win += x[col][ix];
            ans[col][ix] = r;
            t[col].erase({x[col][ix], ix});
        }
    }

	allocate_tickets(ans);
	return win;
}

• Subtask 1: 0 / 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