Submission #109504

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

city

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

int prefx[maxn], prefy[maxn];

int DistanceSum(int N, int *X, int *Y)
{
	sort(X, X + N);
	sort(Y, Y + N);

	for(int i = 0; i < N; i++)
	{
		if(!i) prefx[i] = X[i], prefy[i] = Y[i];

		else prefx[i] = X[i] + prefx[i - 1], prefy[i] = Y[i] + prefy[i - 1];
	}

	int sum = 0;

	for(int i = 0; i < N - 1; i++)
	{

		sum += prefx[N] - prefx[i] - (N - i)*X[i];

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

	return sum;
}

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