제출 #829994

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

tickets

#include "tickets.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fr first
#define sc second
//#define int long long
long long find_maximum(int k, vector<vector<int>> x) {
	int n=x.size(),m=x[0].size();
	if(k==1){
		vector<vector<int>> ans(n,vector<int>(m,-1));
		vector<pair<int,int>> v(n);
		vector<int> a;
		for(int i=0;i<n;i++){
			v[i]={x[i][0]+x[i][m-1],i};
		}
		sort(v.begin(),v.end());
		for(int i=0;i<n/2;i++){
			ans[v[i].sc][0]=0;
			a.pb(x[v[i].sc][0]);
		}
		for(int i=n/2;i<n;i++){
			ans[v[i].sc][m-1]=0;
			a.pb(x[v[i].sc][m-1]);
		}
		allocate_tickets(ans);
		sort(a.begin(),a.end());
		int s=(a[n/2]),res=0;
		for(int i=0;i<n;i++) res+=abs(s-a[i]);
		return res;
	}
	
}

컴파일 시 표준 에러 (stderr) 메시지

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:34:1: warning: control reaches end of non-void function [-Wreturn-type]
   34 | }
      | ^

• 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