Submission #4581

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
4581	2013-11-06 15:17:07	ansol4328	올림픽 (KOI13_olympic)	C++98	100 / 100	0 ms	1116 KiB

olympic

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
#include<stdio.h>
int n, find, m[1002][7];
int main()
{
    int i, num, cnt=1;
    scanf("%d %d",&n,&find);
    for(i=1 ; i<=n ; i++)
    {
        scanf("%d %d %d %d",&m[i][1],&m[i][2],&m[i][3],&m[i][4]);
        if(m[i][1]==find) num=i;
    }
    for(i=1 ; i<=n ; i++)
    {
        if(m[i][2]>m[num][2]) cnt++;
        if(m[i][2]==m[num][2] && m[i][3]>m[num][3]) cnt++;
        if(m[i][2]==m[num][2] && m[i][3]==m[num][3] && m[i][4]>m[num][4]) cnt++;
    }
    printf("%d",cnt);
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 20 / 20
• Subtask 4: 25 / 25
• Subtask 5: 35 / 35