# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950854 | imabhideep | Railway (BOI17_railway) | Java | 1030 ms | 287328 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.sql.Array;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;
public class railway {
static int n;
static ArrayList<Integer> tree[];
static ArrayList<ArrayList<Integer>> pathBinaryLifting[][];
static HashMap<ArrayList<Integer>,Integer> userPathIndex;
static Tree t;
static int k;
public static void main(String[] args)throws IOException {
BufferedReader x=new BufferedReader(new InputStreamReader(System.in));
PrintWriter pw=new PrintWriter(System.out);
StringTokenizer st=new StringTokenizer(x.readLine());
userPathIndex=new HashMap<>();
n=Integer.parseInt(st.nextToken());
int m=Integer.parseInt(st.nextToken());
k=Integer.parseInt(st.nextToken());
pathBinaryLifting=new ArrayList[n+1][20];
tree=new ArrayList[n+1];
for(int i=0;i<=n;i++)tree[i]=new ArrayList<>();
for(int i=0;i<n-1;i++){
st=new StringTokenizer(x.readLine());
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |