oj.uz

Submission #98213

# Submission time Handle Problem Language Result Execution time Memory
98213 2019-02-21T14:43:41 Z luciocf Ideal city (IOI12_city) C++14
0 / 100
 1000 ms 896 KB 
#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.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1006 ms 640 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1020 ms 896 KB Time limit exceeded
2 Halted 0 ms 0 KB -