oj.uz

Submission #1110

# Submission time Handle Problem Language Result Execution time Memory
1110 2013-06-25T11:07:49 Z skstmdvlf 덩치 (KOI13_body) C++
0 / 18
 0 ms 884 KB 
#include<stdio.h>
int main()
{
    int a[2][51], b[51], i, j, n;
    
    scanf("%d",&n);
    
    for(i=0;i<n;i++)
    {
        scanf("%d %d",&a[0][i],&a[1][i]);
    }
    
    for(i=0;i<n;i++)
    {
        b[i]=n;
    }
    
    for(i=0;i<n;i++)
    {
        for(j=0;j<n;j++)
        {
            if(a[0][i]<=a[0][j] || a[1][i]<=a[1][j])
            {
                b[i]--;
            }
        }
    }
    
    for(i=0;i<n;i++)
    {
        printf("%d ",b[i]);
    }
    return 0;
}

Subtask #1
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #6
0.0 / 2.7

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 1.8

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 884 KB Output isn't correct
2 Halted 0 ms 0 KB -