This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |