oj.uz

Submission #5818

# Submission time Handle Problem Language Result Execution time Memory
5818 2014-05-18T03:46:18 Z jspark19990205 덩치 (KOI13_body) C
18 / 18
 0 ms 1088 KB 
#include<stdio.h>

int cm[200];
int kg[200];

int main()
{
    int N,i,j;
    scanf("%d",&N);
    for(i=0;i<N;i++){
        scanf("%d %d",&kg[i],&cm[i]);
    }

    for(i=0;i<N;i++){
        int prize = 1;
        for(j=0;j<N;j++){
            if(i==j){
                continue;
            }
            else if(kg[j]>kg[i] && cm[j]>cm[i]){
                prize++;
            }
        }
        printf("%d ",prize);
    }
    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