oj.uz

Submission #5864

# Submission time Handle Problem Language Result Execution time Memory
5864 2014-05-20T11:06:47 Z cki86201 Company Planning (TOKI14_company) C++
0 / 100
 12 ms 1476 KB 
//test
#include<stdio.h>
int n,i,x,p[100010],ans;
int main(){scanf("%d",&n);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 12 ms 1476 KB Output is correct
3 Correct 12 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 8 ms 1476 KB Output is correct
7 Correct 8 ms 1476 KB Output is correct
8 Incorrect 12 ms 1476 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 7.0

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

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 -