Submission #1074363
Source Code Expand
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.TreeMap;
public class Main implements Runnable{
static ContestScanner in;static Writer out;
public static void main(String[] args) {
new Thread(null, new Main(), "", 16 * 1024 * 1024).start();
}
public void run() {
try {
// in = new ContestScanner("in.txt");
// out = new Writer("out.txt");
in = new ContestScanner();
out = new Writer();
Main solve = new Main();
solve.solve();
in.close();
out.flush();
out.close();
} catch (IOException e) {
e.printStackTrace();
}
}
static void dump(int[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)
s.append(a[i]).append(" ");out.println(s.toString().trim());}
static void dump(int[]a,int n){for(int i=0;i<a.length;i++)out.printf("%"+n+"d ",a[i]);out.println();}
static void dump(long[]a){StringBuilder s=new StringBuilder();for(int i=0;i<a.length;i++)
s.append(a[i]).append(" ");out.println(s.toString().trim());}
static void dump(char[]a){for(int i=0;i<a.length;i++)out.print(a[i]);out.println();}
static long pow(long a,int n){long r=1;while(n>0){if((n&1)==1)r*=a;a*=a;n>>=1;}return r;}
static String itob(int a,int l){return String.format("%"+l+"s",Integer.toBinaryString(a)).replace(' ','0');}
static void sort(int[]a){m_sort(a,0,a.length,new int[a.length]);}
static void sort(int[]a,int l){m_sort(a,0,l,new int[l]);}
static void sort(int[]a,int l,int[]buf){m_sort(a,0,l,buf);}
static void sort(int[]a,int s,int l,int[]buf){m_sort(a,s,l,buf);}
static void m_sort(int[]a,int s,int sz,int[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];
} /* qsort(3.5s)<<msort(9.5s)<<<shuffle+qsort(17s)<Arrays.sort(Integer)(20s) */
static void sort(long[]a){m_sort(a,0,a.length,new long[a.length]);}
static void sort(long[]a,int l){m_sort(a,0,l,new long[l]);}
static void sort(long[]a,int l,long[]buf){m_sort(a,0,l,buf);}
static void sort(long[]a,int s,int l,long[]buf){m_sort(a,s,l,buf);}
static void m_sort(long[]a,int s,int sz,long[]b)
{if(sz<7){for(int i=s;i<s+sz;i++)for(int j=i;j>s&&a[j-1]>a[j];j--)swap(a, j, j-1);return;}
m_sort(a,s,sz/2,b);m_sort(a,s+sz/2,sz-sz/2,b);int idx=s;int l=s,r=s+sz/2;final int le=s+sz/2,re=s+sz;
while(l<le&&r<re){if(a[l]>a[r])b[idx++]=a[r++];else b[idx++]=a[l++];}
while(r<re)b[idx++]=a[r++];while(l<le)b[idx++]=a[l++];for(int i=s;i<s+sz;i++)a[i]=b[i];}
static void swap(long[] a,int i,int j){final long t=a[i];a[i]=a[j];a[j]=t;}
static void swap(int[] a,int i,int j){final int t=a[i];a[i]=a[j];a[j]=t;}
static int binarySearchSmallerMax(int[]a,int v)// get maximum index which a[idx]<=v
{int l=-1,r=a.length-1,s=0;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
static int binarySearchSmallerMax(int[]a,int v,int l,int r)
{int s=-1;while(l<=r){int m=(l+r)/2;if(a[m]>v)r=m-1;else{l=m+1;s=m;}}return s;}
@SuppressWarnings("unchecked")
static List<Integer>[]createGraph(int n)
{List<Integer>[]g=new List[n];for(int i=0;i<n;i++)g[i]=new ArrayList<>();return g;}
void solve() throws IOException{
int n = in.nextInt();
node = createGraph(n);
for(int i=1; i<n; i++){
int a = in.nextInt()-1;
node[a].add(i);
}
System.out.println(rec(0)-1);
}
List<Integer>[] node;
int rec(int cur){
if(node[cur].size()==0) return 1;
int[] arr = new int[node[cur].size()];
int i = 0;
for(int v: node[cur]){
arr[i++] = rec(v);
}
Arrays.sort(arr);
int j = 1;
int max = 0;
for(i=arr.length-1; i>=0; i--){
max = Math.max(max, arr[i]+j++);
}
return max;
}
}
@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public MultiSet<T> merge(MultiSet<T> set)
{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}
@SuppressWarnings("serial")
class OrderedMultiSet<T> extends TreeMap<T, Integer>{
@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
public void add(T key,int v){put(key,get(key)+v);}
public void add(T key){put(key,get(key)+1);}
public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
public OrderedMultiSet<T> merge(OrderedMultiSet<T> set)
{OrderedMultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
while(!s.isEmpty()){l.add(s.firstEntry().getKey(),s.pollFirstEntry().getValue());}return l;}
}
class Pair implements Comparable<Pair>{
int a,b;final int hash;Pair(int a,int b){this.a=a;this.b=b;hash=(a<<16|a>>16)^b;}
public boolean equals(Object obj){Pair o=(Pair)(obj);return a==o.a&&b==o.b;}
public int hashCode(){return hash;}
public int compareTo(Pair o){if(a!=o.a)return a<o.a?-1:1;else if(b!=o.b)return b<o.b?-1:1;return 0;}
}
class Timer{
long time;public void set(){time=System.currentTimeMillis();}
public long stop(){return time=System.currentTimeMillis()-time;}
public void print(){System.out.println("Time: "+(System.currentTimeMillis()-time)+"ms");}
@Override public String toString(){return"Time: "+time+"ms";}
}
class Writer extends PrintWriter{
public Writer(String filename)throws IOException
{super(new BufferedWriter(new FileWriter(filename)));}
public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
private BufferedReader in;private int c=-2;
public ContestScanner()throws IOException
{in=new BufferedReader(new InputStreamReader(System.in));}
public ContestScanner(String filename)throws IOException
{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
public String nextToken()throws IOException {
StringBuilder sb=new StringBuilder();
while((c=in.read())!=-1&&Character.isWhitespace(c));
while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
return sb.toString();
}
public String readLine()throws IOException{
StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
return sb.toString();
}
public long nextLong()throws IOException,NumberFormatException
{return Long.parseLong(nextToken());}
public int nextInt()throws NumberFormatException,IOException
{return(int)nextLong();}
public double nextDouble()throws NumberFormatException,IOException
{return Double.parseDouble(nextToken());}
public void close() throws IOException {in.close();}
}
Submission Info
Submission Time |
|
Task |
B - Tournament |
User |
threepipes_s |
Language |
Java8 (OpenJDK 1.8.0) |
Score |
800 |
Code Size |
7388 Byte |
Status |
AC |
Exec Time |
561 ms |
Memory |
44608 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
800 / 800 |
Status |
|
|
Set Name |
Test Cases |
Sample |
s1.txt, s2.txt, s3.txt |
All |
01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, s1.txt, s2.txt, s3.txt |
Case Name |
Status |
Exec Time |
Memory |
01.txt |
AC |
277 ms |
33516 KB |
02.txt |
AC |
276 ms |
33460 KB |
03.txt |
AC |
272 ms |
33504 KB |
04.txt |
AC |
277 ms |
33220 KB |
05.txt |
AC |
284 ms |
33516 KB |
06.txt |
AC |
276 ms |
33124 KB |
07.txt |
AC |
277 ms |
33328 KB |
08.txt |
AC |
279 ms |
33248 KB |
09.txt |
AC |
285 ms |
33336 KB |
10.txt |
AC |
277 ms |
33120 KB |
11.txt |
AC |
561 ms |
44608 KB |
12.txt |
AC |
284 ms |
44204 KB |
13.txt |
AC |
291 ms |
41512 KB |
14.txt |
AC |
277 ms |
38672 KB |
15.txt |
AC |
272 ms |
37300 KB |
16.txt |
AC |
270 ms |
35736 KB |
17.txt |
AC |
273 ms |
34744 KB |
18.txt |
AC |
270 ms |
33604 KB |
19.txt |
AC |
266 ms |
33584 KB |
20.txt |
AC |
273 ms |
33544 KB |
21.txt |
AC |
244 ms |
30876 KB |
22.txt |
AC |
242 ms |
31988 KB |
23.txt |
AC |
251 ms |
31240 KB |
24.txt |
AC |
245 ms |
31236 KB |
25.txt |
AC |
255 ms |
31156 KB |
26.txt |
AC |
245 ms |
31744 KB |
27.txt |
AC |
246 ms |
30932 KB |
28.txt |
AC |
259 ms |
31716 KB |
29.txt |
AC |
252 ms |
31708 KB |
30.txt |
AC |
255 ms |
31412 KB |
31.txt |
AC |
263 ms |
33376 KB |
32.txt |
AC |
265 ms |
32876 KB |
33.txt |
AC |
251 ms |
31688 KB |
34.txt |
AC |
259 ms |
32372 KB |
35.txt |
AC |
256 ms |
31996 KB |
36.txt |
AC |
242 ms |
31976 KB |
37.txt |
AC |
235 ms |
31532 KB |
38.txt |
AC |
249 ms |
31816 KB |
39.txt |
AC |
251 ms |
32084 KB |
40.txt |
AC |
247 ms |
31812 KB |
41.txt |
AC |
99 ms |
8580 KB |
42.txt |
AC |
97 ms |
8456 KB |
43.txt |
AC |
98 ms |
8528 KB |
44.txt |
AC |
98 ms |
8452 KB |
45.txt |
AC |
99 ms |
8580 KB |
46.txt |
AC |
99 ms |
8580 KB |
47.txt |
AC |
99 ms |
8528 KB |
48.txt |
AC |
99 ms |
8580 KB |
49.txt |
AC |
100 ms |
8528 KB |
50.txt |
AC |
99 ms |
8528 KB |
s1.txt |
AC |
97 ms |
8456 KB |
s2.txt |
AC |
99 ms |
8452 KB |
s3.txt |
AC |
99 ms |
8452 KB |