oj.uz

Submission #5313

# Submission time Handle Problem Language Result Execution time Memory
5313 2014-03-22T06:20:23 Z baneling100 점 모으기 (KOI13_collect) C++
4.8 / 24
 4 ms 1164 KB 
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>

using namespace std;

int n, m, y[10001], x[10001], ans;

void input(void)
{
    int i;

    scanf("%d %d",&n,&m);
    for(i=1 ; i<=m ; i++)
        scanf("%d %d",&y[i],&x[i]);
    sort(y+1,y+m+1);
    sort(x+1,x+m+1);
}

void process(void)
{
    int i;

    for(i=1 ; i<=m ; i++)
        ans+=abs(y[(m+1)/2]-y[i])+abs(x[(m+1)/2]-x[i]);
}

void output(void)
{
    printf("%d",ans);
}

int main(void)
{
    input();
    process();
    output();

    return 0;
}

Subtask #1
2.4 / 2.4

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1164 KB Output is correct
2 Correct 0 ms 1164 KB Output is correct
3 Correct 0 ms 1164 KB Output is correct
4 Correct 0 ms 1164 KB Output is correct

Subtask #2
2.4 / 2.4

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1164 KB Output is correct
2 Correct 0 ms 1164 KB Output is correct
3 Correct 0 ms 1164 KB Output is correct

Subtask #3
0.0 / 2.4

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1164 KB Output is correct
2 Incorrect 0 ms 1164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 3.36

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

Subtask #5
0.0 / 3.36

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

Subtask #6
0.0 / 3.36

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

Subtask #7
0.0 / 3.36

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

Subtask #8
0.0 / 3.36

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