oj.uz

답안 #16850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
16850 2015-10-22T07:34:52 Z hjk0553 올림픽 (KOI13_olympic) C
100 / 100
 0 ms 1084 KB 
#include<stdio.h>
int main()
{
    int i,n,k,gold[1001],silver[1001],bronze[1001],sunwe=0;
    scanf("%d %d",&n,&k);
    for(i=1;i<=n;i++)
    {
        int num;
        scanf("%d",&num);
        scanf("%d %d %d",&gold[num],&silver[num],&bronze[num]);
    }
    for(i=1;i<=n;i++)
    {
        if(gold[k]<gold[i])
        {
            sunwe++;
        }
        else if(gold[k]==gold[i])
        {
            if(silver[k]<silver[i])
            {
                sunwe++;
            }
            else if(silver[i]==silver[k])
            {
                if(bronze[k]<bronze[i])
                {
                    sunwe++;
                }
            }
        }
    }
    printf("%d",sunwe+1);
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct

Subtask #4
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct

Subtask #5
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1084 KB Output is correct
2 Correct 0 ms 1084 KB Output is correct
3 Correct 0 ms 1084 KB Output is correct
4 Correct 0 ms 1084 KB Output is correct
5 Correct 0 ms 1084 KB Output is correct
6 Correct 0 ms 1084 KB Output is correct
7 Correct 0 ms 1084 KB Output is correct
8 Correct 0 ms 1084 KB Output is correct
9 Correct 0 ms 1084 KB Output is correct