Submission #98213

#	Time	Username	Problem	Language	Result	Execution time	Memory
98213		luciocf	Ideal city (IOI12_city)	C++14	0 / 100	1020 ms	896 KiB

city

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e5+10;
const int mod = 1e9;

typedef long long ll;

int n;
int x[maxn], y[maxn];

int DistanceSum(int N, int *X, int *Y)
{
	n = N;
	for (int i = 0; i < n; i++)
		x[i] = X[i], y[i] = Y[i];

	ll ans = 0LL;
	for (int i = 0; i < n; i++)
	{
		for (int j = i+1; j < n; j++)
		{
			ans = (ans+(ll)abs(x[i]-x[j]))%mod;
			ans = (ans+(ll)abs(y[i]-y[j]))%mod;
		}
	}

	return ans;
}

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