oj.uz

Submission #16242

# Submission time Handle Problem Language Result Execution time Memory
16242 2015-08-18T11:17:24 Z eaststar 덩치 (KOI13_body) C++14
18 / 18
 0 ms 1084 KB 
#include<cstdio>
int a[3][60],i=1,j,n;
int main(){
  	scanf("%d",&n);
    for(;i<=n;++i){
        scanf("%d%d",a[0]+i,a[1]+i);
        for(j=1;j<i;++j){
            if(a[0][i]<a[0][j]&&a[1][i]<a[1][j])++a[2][i];
            if(a[0][i]>a[0][j]&&a[1][i]>a[1][j])++a[2][j];
        }
    }
    for(i=1;i<=n;++i)printf("%d ",a[2][i]+1);
    return 0;
}

Subtask #1
2.7 / 2.7

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

Subtask #2
2.7 / 2.7

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

Subtask #3
2.7 / 2.7

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

Subtask #4
2.7 / 2.7

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

Subtask #5
2.7 / 2.7

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

Subtask #6
2.7 / 2.7

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

Subtask #7
1.8 / 1.8

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