oj.uz

Submission #17087

# Submission time Handle Problem Language Result Execution time Memory
17087 2015-11-05T03:53:12 Z taehoon1018 사회적 불평등 (TOKI14_social) C++
29 / 100
 300 ms 1744 KB 
#include <stdio.h>


int Abs(int x)
{
	if (x < 0)
		x = -x;
	return x;
}
int main(void)
{
	int N;
	int L[100000] = { 0 };
	int P[100000] = { 0 };
	long long sum = 0;

	scanf("%d", &N);

	for (int i = 0; i < N; i++)
		scanf("%d%d", &L[i], &P[i]);

	for (int i = 0; i < N - 1; i++)
		for (int j = i + 1; j < N; j++)
			sum += Abs(L[i] - L[j]) * Abs(P[i] - P[j]);

	printf("%lld", sum);

}

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1744 KB Output is correct
2 Correct 0 ms 1740 KB Output is correct
3 Correct 0 ms 1740 KB Output is correct
4 Correct 0 ms 1740 KB Output is correct
5 Correct 0 ms 1740 KB Output is correct
6 Correct 0 ms 1740 KB Output is correct
7 Correct 0 ms 1740 KB Output is correct
8 Correct 5 ms 1744 KB Output is correct
9 Correct 16 ms 1740 KB Output is correct
10 Correct 39 ms 1740 KB Output is correct

Subtask #2
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 300 ms 1736 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 300 ms 1736 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Execution timed out 300 ms 1740 KB Program timed out
2 Halted 0 ms 0 KB -