# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
4475 |
2013-10-08T02:25:10 Z |
gs13068 |
올림픽 (KOI13_olympic) |
C++ |
|
0 ms |
1104 KB |
#include<cstdio>
int a[1000][4];
int main()
{
int i,j,n,k;
scanf("%d%d",&n,&k);
for(i=0;i<n;i++)for(j=0;j<4;j++)scanf("%d",&a[i][j]);
for(i=0;i<n;i++)if(a[i][0]==k)break;
k=1;
for(j=0;j<n;j++)
{
if(a[j][1]>a[i][1])k++;
else if(a[j][1]==a[i][1]&&a[j][2]>a[i][2])k++;
else if(a[j][1]==a[i][1]&&a[j][2]==a[i][2]&&a[j][3]>a[i][3])k++;
}
printf("%d",k);
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1104 KB |
Output is correct |
2 |
Correct |
0 ms |
1104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1104 KB |
Output is correct |
2 |
Correct |
0 ms |
1104 KB |
Output is correct |
3 |
Correct |
0 ms |
1104 KB |
Output is correct |
4 |
Correct |
0 ms |
1104 KB |
Output is correct |
5 |
Correct |
0 ms |
1104 KB |
Output is correct |
6 |
Correct |
0 ms |
1104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1104 KB |
Output is correct |
2 |
Correct |
0 ms |
1104 KB |
Output is correct |
3 |
Correct |
0 ms |
1104 KB |
Output is correct |
4 |
Correct |
0 ms |
1104 KB |
Output is correct |
5 |
Correct |
0 ms |
1104 KB |
Output is correct |
6 |
Correct |
0 ms |
1104 KB |
Output is correct |
7 |
Correct |
0 ms |
1104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1104 KB |
Output is correct |
2 |
Correct |
0 ms |
1104 KB |
Output is correct |
3 |
Correct |
0 ms |
1104 KB |
Output is correct |
4 |
Correct |
0 ms |
1104 KB |
Output is correct |
5 |
Correct |
0 ms |
1104 KB |
Output is correct |
6 |
Correct |
0 ms |
1104 KB |
Output is correct |
7 |
Correct |
0 ms |
1104 KB |
Output is correct |
8 |
Correct |
0 ms |
1104 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
1104 KB |
Output is correct |
2 |
Correct |
0 ms |
1104 KB |
Output is correct |
3 |
Correct |
0 ms |
1104 KB |
Output is correct |
4 |
Correct |
0 ms |
1104 KB |
Output is correct |
5 |
Correct |
0 ms |
1104 KB |
Output is correct |
6 |
Correct |
0 ms |
1104 KB |
Output is correct |
7 |
Correct |
0 ms |
1104 KB |
Output is correct |
8 |
Correct |
0 ms |
1104 KB |
Output is correct |
9 |
Correct |
0 ms |
1104 KB |
Output is correct |