제출 #625306

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

tickets

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
//#define int ll;

#include "tickets.h"

int pick[1505][1505];

ll find_maximum(int k, vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
	vector<vector<int>> v;
	for(int i=0;i<n;i++){
		v.push_back({x[i][0]+x[i][m-1],i});
	}
	sort(v.begin(),v.end());
	vector<int> nums;
	for(int i=0;i<n/2;i++){
		nums.push_back(x[v[i][1]][0]);
		pick[v[i][1]][0] = 1;
	}
	for(int i=n/2;i<n;i++){
		nums.push_back(x[v[i][1]][m-1]);
		pick[v[i][1]][m-1] = 1;
	}
	sort(nums.begin(),nums.end());
	//
	int ret=0,comp=nums[n/2];
	for(int i:nums){
		ret += abs(i-comp);
	}
	//
	vector<vector<int>> answer;
	for(int i=0;i<n;i++) {
		vector<int> row(m);
		for(int j=0;j<m;j++) {
			row[j] = pick[i][j]-1;
		}
		answer.push_back(row);
	}
	allocate_tickets(answer);
	return ret;
}

• 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