oj.uz

답안 #18700

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
18700 2016-02-14T06:58:33 Z pichulia 점 모으기 (KOI13_collect) C++
24 / 24
 43 ms 1864 KB 
#include<stdio.h>
#include<algorithm>
int n, m;
int x[100004],y[100005];
int p;
int main()
{
    int i, j;
    scanf("%d %d",&n,&m);
    for(i=0; i<m; i++)
        scanf("%d %d",&x[i],&y[i]);
    std::sort(x,x+m);std::sort(y,y+m);
    for(i=0;i<m;i++)
        p+=std::abs(x[i]-x[m/2]) + std::abs(y[i]-y[m/2]);
    printf("%d",p);
}

Subtask #1
2.4 / 2.4

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

Subtask #2
2.4 / 2.4

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

Subtask #3
2.4 / 2.4

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

Subtask #4
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 1864 KB Output is correct
2 Correct 18 ms 1864 KB Output is correct
3 Correct 13 ms 1864 KB Output is correct

Subtask #5
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 23 ms 1864 KB Output is correct
2 Correct 22 ms 1864 KB Output is correct
3 Correct 31 ms 1864 KB Output is correct

Subtask #6
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 1864 KB Output is correct
2 Correct 36 ms 1864 KB Output is correct
3 Correct 21 ms 1864 KB Output is correct

Subtask #7
3.36 / 3.36

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

Subtask #8
3.36 / 3.36

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 1864 KB Output is correct
2 Correct 42 ms 1864 KB Output is correct
3 Correct 31 ms 1864 KB Output is correct