oj.uz

Submission #7732

# Submission time Handle Problem Language Result Execution time Memory
7732 2014-08-17T05:22:26 Z gs14004 덩치 (KOI13_body) C++
18 / 18
 0 ms 1204 KB 
#include <stdio.h>

int main(){
    int n,i,j;
    scanf("%d",&n);
    int a[n],b[n],c[n];
    for (i=0; i<n; i++) {
        scanf("%d %d",&a[i],&b[i]);
        c[i]=1;
    }
    for (i=0; i<n; i++) {
        for (j=0; j<n; j++) c[i]+=(a[i]<a[j])&&(b[i]<b[j]);
    }
    for (i=0; i<n; i++) {
        printf("%d ",c[i]);
    }
}

Subtask #1
2.7 / 2.7

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

Subtask #2
2.7 / 2.7

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

Subtask #3
2.7 / 2.7

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

Subtask #4
2.7 / 2.7

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

Subtask #5
2.7 / 2.7

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

Subtask #6
2.7 / 2.7

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

Subtask #7
1.8 / 1.8

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