oj.uz

Submission #5308

# Submission time Handle Problem Language Result Execution time Memory
5308 2014-03-22T04:56:41 Z baneling100 덩치 (KOI13_body) C++
18 / 18
 0 ms 1088 KB 
#include <stdio.h>

int n, x[51], y[51], big[51];

void input(void)
{
    int i;

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

void process(void)
{
    int i, j;

    for(i=1 ; i<=n ; i++)
        for(j=1 ; j<=n ; j++)
            if(x[i]<x[j] && y[i]<y[j])
                big[i]++;
}

void output(void)
{
    int i;

    for(i=1 ; i<=n ; i++)
        printf("%d ",big[i]+1);
}

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

    return 0;
}

Subtask #1
2.7 / 2.7

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

Subtask #2
2.7 / 2.7

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

Subtask #3
2.7 / 2.7

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

Subtask #4
2.7 / 2.7

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

Subtask #5
2.7 / 2.7

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

Subtask #6
2.7 / 2.7

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

Subtask #7
1.8 / 1.8

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