Submission #5866

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
5866	2014-05-20T11:11:00 Z	cki86201	Company Planning (TOKI14_company)	C++	7 / 100	16 ms	1476 KB

company

//test
#include<stdio.h>
int n,m,i,x,p[100010],ans;
int main(){scanf("%d%d",&n,&m);for(i=1;i<n;i++)scanf("%d",&x),p[x]++;for(i=1;i<=n;i++)if(ans<p[i])ans=p[i];printf("%d",ans);return 0;}

Subtask #1

0.0 / 12.0

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

Subtask #2

0.0 / 20.0

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

Subtask #3

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1476 KB	Output is correct
2	Correct	8 ms	1476 KB	Output is correct
3	Correct	4 ms	1476 KB	Output is correct
4	Correct	12 ms	1476 KB	Output is correct
5	Correct	12 ms	1476 KB	Output is correct
6	Correct	12 ms	1476 KB	Output is correct
7	Correct	12 ms	1476 KB	Output is correct
8	Correct	12 ms	1476 KB	Output is correct
9	Correct	12 ms	1476 KB	Output is correct
10	Correct	8 ms	1476 KB	Output is correct
11	Correct	12 ms	1476 KB	Output is correct
12	Correct	12 ms	1476 KB	Output is correct
13	Correct	8 ms	1476 KB	Output is correct
14	Correct	8 ms	1476 KB	Output is correct
15	Correct	12 ms	1476 KB	Output is correct
16	Correct	0 ms	1476 KB	Output is correct
17	Correct	12 ms	1476 KB	Output is correct
18	Correct	0 ms	1476 KB	Output is correct
19	Correct	4 ms	1476 KB	Output is correct
20	Correct	12 ms	1476 KB	Output is correct
21	Correct	4 ms	1476 KB	Output is correct
22	Correct	4 ms	1476 KB	Output is correct
23	Correct	12 ms	1476 KB	Output is correct
24	Correct	12 ms	1476 KB	Output is correct
25	Incorrect	0 ms	1476 KB	Output isn't correct

Subtask #4

7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1476 KB	Output is correct
2	Correct	8 ms	1476 KB	Output is correct
3	Correct	8 ms	1476 KB	Output is correct
4	Correct	12 ms	1476 KB	Output is correct
5	Correct	8 ms	1476 KB	Output is correct
6	Correct	12 ms	1476 KB	Output is correct
7	Correct	12 ms	1476 KB	Output is correct
8	Correct	12 ms	1476 KB	Output is correct
9	Correct	16 ms	1476 KB	Output is correct
10	Correct	12 ms	1476 KB	Output is correct
11	Correct	4 ms	1476 KB	Output is correct
12	Correct	8 ms	1476 KB	Output is correct
13	Correct	8 ms	1476 KB	Output is correct
14	Correct	8 ms	1476 KB	Output is correct
15	Correct	8 ms	1476 KB	Output is correct
16	Correct	0 ms	1476 KB	Output is correct
17	Correct	4 ms	1476 KB	Output is correct
18	Correct	8 ms	1476 KB	Output is correct
19	Correct	12 ms	1476 KB	Output is correct
20	Correct	4 ms	1476 KB	Output is correct
21	Correct	4 ms	1476 KB	Output is correct
22	Correct	4 ms	1476 KB	Output is correct
23	Correct	0 ms	1476 KB	Output is correct
24	Correct	8 ms	1476 KB	Output is correct
25	Correct	0 ms	1476 KB	Output is correct
26	Correct	12 ms	1476 KB	Output is correct
27	Correct	12 ms	1476 KB	Output is correct
28	Correct	8 ms	1476 KB	Output is correct
29	Correct	12 ms	1476 KB	Output is correct
30	Correct	12 ms	1476 KB	Output is correct
31	Correct	12 ms	1476 KB	Output is correct
32	Correct	0 ms	1476 KB	Output is correct
33	Correct	4 ms	1476 KB	Output is correct
34	Correct	4 ms	1476 KB	Output is correct
35	Correct	0 ms	1476 KB	Output is correct

Subtask #5

0.0 / 43.0

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