제출 #1009756

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009756		vjudge1	Carnival Tickets (IOI20_tickets)	C++17	27 / 100	352 ms	73288 KiB

tickets

#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
long long find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
    long long ans=0;
	vector<vector<int>> answer(n,vector<int>(m,-1));
    vector<int> indl(n), indr(n,m-1);
    for(int q=0;q<k;q++){
        vector<pair<int,int>>gree;
        for(int i=0;i<n;i++)
            gree.push_back({x[i][indl[i]]+x[i][indr[i]],i});
        sort(gree.begin(),gree.end());
        vector<int>round; int g=0;
        for(auto[b,i]:gree)
            if(g++<n/2) answer[i][indl[i]]=q,
                round.push_back(x[i][indl[i]++]);
            else answer[i][indr[i]]=q,
                round.push_back(x[i][indr[i]--]);
        sort(round.begin(),round.end());
        int med=round[n/2];
        for(auto i:round)
            ans+=abs(med-i);
    }
	allocate_tickets(answer);
	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