oj.uz

답안 #3150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
3150 2013-08-26T08:41:42 Z movie_jo 점 모으기 (KOI13_collect) C++
24 / 24
 40 ms 1868 KB 
#include <stdio.h>
#include "algorithm"

using namespace std;

int x[100000], y[100000];

int main(void)
{
	int N, M, i, cx, cy, s = 0;

	scanf("%d %d", &N, &M);

	for(i = 0; i < M; i++)
		scanf("%d %d",&x[i], &y[i]);

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

	cx = x[M / 2];
	cy = y[M / 2];

	for(i = 0; i < M; i++)
	{
		s += cx > x[i] ? cx - x[i] : x[i] - cx;
		s += cy > y[i] ? cy - y[i] : y[i] - cy;
	}

	printf("%d\n", s);
}

Subtask #1
2.4 / 2.4

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1868 KB Output is correct
2 Correct 0 ms 1868 KB Output is correct
3 Correct 0 ms 1868 KB Output is correct
4 Correct 0 ms 1868 KB Output is correct

Subtask #2
2.4 / 2.4

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1868 KB Output is correct
2 Correct 0 ms 1868 KB Output is correct
3 Correct 0 ms 1868 KB Output is correct

Subtask #3
2.4 / 2.4

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 1868 KB Output is correct
2 Correct 8 ms 1868 KB Output is correct
3 Correct 0 ms 1868 KB Output is correct

Subtask #4
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 1868 KB Output is correct
2 Correct 12 ms 1868 KB Output is correct
3 Correct 12 ms 1868 KB Output is correct

Subtask #5
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 1868 KB Output is correct
2 Correct 20 ms 1868 KB Output is correct
3 Correct 20 ms 1868 KB Output is correct

Subtask #6
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 1868 KB Output is correct
2 Correct 36 ms 1868 KB Output is correct
3 Correct 20 ms 1868 KB Output is correct

Subtask #7
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1868 KB Output is correct
2 Correct 32 ms 1868 KB Output is correct
3 Correct 36 ms 1868 KB Output is correct

Subtask #8
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 1868 KB Output is correct
2 Correct 32 ms 1868 KB Output is correct
3 Correct 40 ms 1868 KB Output is correct