oj.uz

Submission #5008

# Submission time Handle Problem Language Result Execution time Memory
5008 2014-01-26T06:04:30 Z Namnamseo 덩치 (KOI13_body) C++
18 / 18
 0 ms 1088 KB 
#include <stdio.h>

int main()
{
    int n;
    int data[51][2];
    scanf("%d",&n);
    int i,j,c;
    for(i=0;i<n;i++) {
        c=0;
        scanf("%d%d",&data[i][0],&data[i][1]);
    }
    for(i=0;i<n;i++){
        c=1;
        for(j=0;j<n;j++){
            if(i!=j){
                if(data[i][0]<data[j][0] && data[i][1]<data[j][1]) c++;
            }
        }
        printf("%d ",c);
    }
    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