oj.uz

Submission #1837

# Submission time Handle Problem Language Result Execution time Memory
1837 2013-07-18T03:38:58 Z alephnull 덩치 (KOI13_body) C++
18 / 18
 0 ms 884 KB 
#include <cstdio> 
int main(){ 
    int n;scanf("%d",&n);    
    int x[n],y[n]; 
    for(int i=0;i<n;i++)scanf("%d %d",x+i,y+i); 
    int ans[n]; 
    for(int i=0;i<n;i++){ 
        ans[i]=1; 
        for(int j=0;j<n;j++){ 
            if(x[j]>x[i]&&y[j]>y[i])ans[i]++; 
        } 
    } 
    for(int i=0;i<n;i++)printf("%d ",ans[i]); 
}

Subtask #1
2.7 / 2.7

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

Subtask #2
2.7 / 2.7

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

Subtask #3
2.7 / 2.7

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

Subtask #4
2.7 / 2.7

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

Subtask #5
2.7 / 2.7

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

Subtask #6
2.7 / 2.7

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

Subtask #7
1.8 / 1.8

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