Submission #109512

#	Time	Username	Problem	Language	Result	Execution time	Memory
109512		pamaj	Ideal city (IOI12_city)	C++14	0 / 100	9 ms	1024 KiB

city

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;

typedef long long ll;

int prefx[maxn], prefy[maxn];

int DistanceSum(int N, int *X, int *Y)
{
	ll x[maxn];
	ll y[maxn];

	for(int i = 0; i < N; i++)
	{
		x[i] = X[i];
		y[i] = Y[i];
	}

	sort(x, x + N);
	sort(y, y + N);


	for(int i = 0; i < N; i++)
	{
		if(i == 0) prefx[i] = x[i], prefy[i] = y[i];

		else prefx[i] = x[i] + prefx[i - 1], prefy[i] = y[i] + prefy[i - 1];

		
		//cout << prefx[i] << " " << prefy[i] << "\n";
	}

	ll sum = 0;

	for(int i = 0; i < N - 1; i++)
	{
		sum += prefx[N - 1] - prefx[i] - (N - i)*x[i];

		sum += prefy[N - 1] - prefy[i] - (N - i)*y[i];
	}

	return sum;
}

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