제출 #420461

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

tickets

#include "tickets.h"
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair

ll sum[1505],ans=1e18;

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;
	if(m==1){
		// subtask 1
		for(int i=0; i<n; i++){
			sum[i]+=x[i][0];
			if(i!=0) sum[i]+=sum[i-1];
		}
		for(int i=0; i<n; i++){
			// x[i][0]
			ll cnt=x[i][0]*(i+1)-sum[i];
			cnt+=sum[n-1]-sum[i]-(n-i-1)*x[i][0];
			ans=min(ans,cnt);	
		}
		answer.resize(n);
		for(int i=0; i<n; i++){
			answer[i].resize(m);
		}
		for(int i=0; i<n; i++){
			for(int j=0; j<m; j++){
				answer[i][j]=0;
			}
		}
		allocate_tickets(answer);
		return ans;
	}
	
	allocate_tickets(answer);
	return 1;
}

• 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