Submission #116514

#	Time	Username	Problem	Language	Result	Execution time	Memory
116514		faustaadp	이상적인 도시 (IOI12_city)	C++17	0 / 100	8 ms	1024 KiB

city

#include<bits/stdc++.h>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
ll i,has,mo=1e9;
ll x[101010];
ll y[101010];
ll p[101010];
int DistanceSum(int N, int *X, int *Y) 
{
	for(i=0;i<N;i++)
	{
		x[i]=X[i];
		y[i]=Y[i];
	//	cout<<x[i]<<" "<<y[i]<<"\n";
	}
	if(1)
	{
		sort(x,x+N);
		sort(y,y+N);
		p[0]=x[0];for(i=1;i<N;i++)p[i]=p[i-1]+x[i];
		for(i=0;i<N;i++)
			has+=(p[N-1]-p[i])-(x[i]*(N-i-1));
		p[0]=y[0];for(i=1;i<N;i++)p[i]=p[i-1]+y[i];
		for(i=0;i<N;i++)
			has+=(p[N-1]-p[i])-(y[i]*(N-i-1));
	}
  	return has;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 21
• Subtask 3: 0 / 23
• Subtask 4: 0 / 45