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<stdio.h>
int wl[100][3];
int res[100];
int main(){
int N, i, j;
scanf("%d", &N);
for(i=1; i<=N; i++) scanf("%d %d", &wl[i][1], &wl[i][2]);
for(i=1; i<=N; i++){
for(j=1; j<=N; j++) if(wl[i][1]<wl[j][1] && wl[i][2]<wl[j][2]) res[i]++;
printf("%d ", res[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... |