Contest Duration: ~ (local time) (180 minutes)

Submission #485908

Source Code Expand

Copy
```import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.NoSuchElementException;

public class Main implements Runnable {

public static void main(String[] args) {
}

@SuppressWarnings("unchecked")
public void run() {
IO io = new IO();
int n = io.nextInt();
ArrayList<Integer>[] graph = new ArrayList[n];
for(int i=0;i<n;i++) {
graph[i] = new ArrayList<Integer>();
}
for(int i=0;i<n-1;i++) {
int a = io.nextInt() - 1;
int b = io.nextInt() - 1;
}
HashMap<Integer,Integer>[] data = new HashMap[n];
for(int i=0;i<n;i++) {
data[i] = new HashMap<Integer,Integer>();
}
int q = io.nextInt();
int[] k = new int[q];
for(int i=0;i<q;i++) {
int m = io.nextInt();
k[i] = io.nextInt();
for(int j=0;j<m;j++) {
int v = io.nextInt() - 1;
data[v].put(i, 1);
}
}
int[] ans = new int[q];
dfs(0,-1,0,graph,data,k,ans);
for(int i=0;i<q;i++) {
io.println(ans[i]);
}
io.flush();
}

//stack overflow しそう
public static HashMap<Integer,Integer> dfs(int v,int p,int level,ArrayList<Integer>[] graph, HashMap<Integer,Integer>[] data, int[] k,int[] ans) {
HashMap<Integer,Integer> a = data[v];
for(Map.Entry<Integer,Integer> entry: a.entrySet()) {
int day = entry.getKey();
if (k[day] == 1) {
ans[day] = Math.max(ans[day], level);
}
}
for(int u: graph[v]) {
if (u == p) {
continue;
}
HashMap<Integer,Integer> b = dfs(u,v,level+1,graph,data,k,ans);
if (a.size() < b.size()) {
HashMap<Integer,Integer> temp = a;
a = b;
b = temp;
}
for(Map.Entry<Integer,Integer> entry: b.entrySet()) {
int day = entry.getKey();
Integer s1 = a.get(day);
int s2 = (s1 == null ? 0 : s1) + entry.getValue();
if (s2 >= k[day]) {
ans[day] = Math.max(ans[day], level);
}
a.put(day, s2);
}
}
//		System.out.println(v + "," + level + "," + a);
return a;
}

}
class IO extends PrintWriter {
private final InputStream in;
private final byte[] buffer = new byte[1024];
private int ptr = 0;
private int buflen = 0;

public IO() { this(System.in);}
public IO(InputStream source) { super(System.out); this.in = source;}
private boolean hasNextByte() {
if (ptr < buflen) {
return true;
}else{
ptr = 0;
try {
} catch (IOException e) {
e.printStackTrace();
}
if (buflen <= 0) {
return false;
}
}
return true;
}
private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
public String next() {
if (!hasNext()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
while(isPrintableChar(b)) {
sb.appendCodePoint(b);
}
return sb.toString();
}
public char[] nextCharArray(int len) {
if (!hasNext()) {
throw new NoSuchElementException();
}
char[] s = new char[len];
int i = 0;
while(isPrintableChar(b)) {
if (i == len) {
throw new InputMismatchException();
}
s[i++] = (char) b;
}
return s;
}
public String nextLine() {
if (!hasNextLine()) {
throw new NoSuchElementException();
}
StringBuilder sb = new StringBuilder();
while(!isNewLine(b)) {
sb.appendCodePoint(b);
}
return sb.toString();
}
public long nextLong() {
if (!hasNext()) {
throw new NoSuchElementException();
}
long n = 0;
boolean minus = false;
if (b == '-') {
minus = true;
}
if (b < '0' || '9' < b) {
throw new NumberFormatException();
}
while(true){
if ('0' <= b && b <= '9') {
n *= 10;
n += b - '0';
}else if(b == -1 || !isPrintableChar(b)){
return minus ? -n : n;
}else{
throw new NumberFormatException();
}
}
}
public int nextInt() {
long nl = nextLong();
if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
throw new NumberFormatException();
}
return (int) nl;
}
public char nextChar() {
if (!hasNext()) {
throw new NoSuchElementException();
}
}
public double nextDouble() { return Double.parseDouble(next());}
public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
```

#### Submission Info

Submission Time 2015-09-05 15:05:23+0900 F - 根付き木のみさわさん piroz95 Java8 (OpenJDK 1.8.0) 20 5821 Byte WA 2072 ms 143144 KB

#### Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
sample_01.txt 682 ms 27444 KB
sample_02.txt 387 ms 27308 KB
sample_03.txt 405 ms 27128 KB