제출 #1123060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123060		Luvidi	카니발 티켓 (IOI20_tickets)	C++20	27 / 100	437 ms	51364 KiB

tickets

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

#define pii pair<int,int>
#define fs first
#define sc second

long long find_maximum(int k, std::vector<std::vector<int>> a) {
	int n = a.size();
	int m = a[0].size();
	long long x=0;
	vector<vector<int>> ans(n,vector<int>(m,-1));
	vector<pair<pii,pii>> v;
	for(int i=0;i<n;i++){
		pii mx={-1,0},mn={1e9+1,0};
		for(int j=0;j<m;j++){
			mx=max(mx,{a[i][j],j});
			mn=min(mn,{a[i][j],j});
		}
		x-=mn.fs;
		v.push_back({{mn.fs+mx.fs,i},{mx.sc,mn.sc}});
	}
	sort(v.rbegin(),v.rend());
	for(int i=0;i<n/2;i++){
		x+=v[i].fs.fs;
		ans[v[i].fs.sc][v[i].sc.fs]=0;
	}
	for(int i=n/2;i<n;i++){
		ans[v[i].fs.sc][v[i].sc.sc]=0;
	}
	allocate_tickets(ans);
	return x;
}

• 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