제출 #576731

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

tickets

#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;

#define ll long long
#define sz(a) (int)a.size()
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define forn(i, n) for(int i=0;i < n; ++i)

long long find_maximum(int k, std::vector<std::vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	std::vector<std::vector<int>> answer(n, vector<int>(m, -1));
	deque<pair<int, int>> d[n];

    for(int i = 0; i < n; ++i) {
        for(int j = 0; j < m; ++j) {
            d[i].pb({x[i][j], j});
        }
        sort(all(d[i]));
    }
    ll ans = 0;

    for(int kk = 0; kk < m; ++kk) {
        priority_queue<pair<int, int>> q;
        forn(i, n) q.push({d[i].front().first + d[i].back().first, i});
        
        for(int j = 0; j < sz(q) / 2; ++j) {
            int i = q.top().second;
            q.pop();
            answer[i][d[i].back().second] = kk;
            ans += d[i].back().first;
            d[i].pop_back();
        }
        for(int j = 0; j < sz(q) / 2; ++j) {
            int i = q.top().second;
            q.pop();
            answer[i][d[i].front().second] = kk;
            ans -= d[i].front().first;
            d[i].pop_front();
        }
    }

    allocate_tickets(answer);
	return ans;
}

• 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