結果

問題 No.1153 ねこちゃんゲーム
ユーザー uwiuwi
提出日時 2020-08-20 04:26:50
言語 Java17
(openjdk 17.0.1)
結果
AC  
実行時間 549 ms / 2,500 ms
コード長 5,416 bytes
コンパイル時間 4,383 ms
使用メモリ 60,316 KB
最終ジャッジ日時 2022-12-05 20:50:24
合計ジャッジ時間 33,150 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 73 ms
35,532 KB
testcase_01 AC 53 ms
34,152 KB
testcase_02 AC 81 ms
35,600 KB
testcase_03 AC 61 ms
34,476 KB
testcase_04 AC 80 ms
35,764 KB
testcase_05 AC 62 ms
34,688 KB
testcase_06 AC 79 ms
35,652 KB
testcase_07 AC 505 ms
60,316 KB
testcase_08 AC 466 ms
54,840 KB
testcase_09 AC 476 ms
55,540 KB
testcase_10 AC 444 ms
54,872 KB
testcase_11 AC 514 ms
55,764 KB
testcase_12 AC 484 ms
55,952 KB
testcase_13 AC 461 ms
54,696 KB
testcase_14 AC 500 ms
56,100 KB
testcase_15 AC 432 ms
55,216 KB
testcase_16 AC 481 ms
56,240 KB
testcase_17 AC 458 ms
56,084 KB
testcase_18 AC 444 ms
54,764 KB
testcase_19 AC 487 ms
55,712 KB
testcase_20 AC 452 ms
54,920 KB
testcase_21 AC 508 ms
55,872 KB
testcase_22 AC 493 ms
55,908 KB
testcase_23 AC 455 ms
54,692 KB
testcase_24 AC 471 ms
55,776 KB
testcase_25 AC 474 ms
55,100 KB
testcase_26 AC 511 ms
55,832 KB
testcase_27 AC 522 ms
55,616 KB
testcase_28 AC 543 ms
57,252 KB
testcase_29 AC 549 ms
57,944 KB
testcase_30 AC 516 ms
54,484 KB
testcase_31 AC 545 ms
58,088 KB
testcase_32 AC 517 ms
57,828 KB
testcase_33 AC 522 ms
59,152 KB
testcase_34 AC 514 ms
57,676 KB
testcase_35 AC 483 ms
56,688 KB
testcase_36 AC 453 ms
57,540 KB
testcase_37 AC 409 ms
55,172 KB
testcase_38 AC 440 ms
57,104 KB
testcase_39 AC 425 ms
58,156 KB
testcase_40 AC 405 ms
56,844 KB
testcase_41 AC 431 ms
58,076 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no1xxx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.BitSet;
import java.util.InputMismatchException;

public class No1153 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] a = na(m);
		int[] from = new int[n - 1];
		int[] to = new int[n - 1];
		for (int i = 0; i < n - 1; i++) {
			from[i] = ni() - 1;
			to[i] = ni() - 1;
		}
		int[][] g = packU(n, from, to);
		int[][] pars = parents3(g, 0);
		int[] par = pars[0], ord = pars[1], dep = pars[2];
		
		int[] nim = new int[n];
		for(int i = n-1;i >= 0;i--){
			int cur = ord[i];
			BitSet bs = new BitSet();
			for(int e : g[cur]){
				if(par[cur] == e)continue;
				bs.set(nim[e]);
			}
			nim[cur] = bs.nextClearBit(0);
		}
		int[] fall = new int[n];
		int[] rdp = new int[n];
		for(int i = 0;i < n;i++){
			int cur = ord[i];
			int[] f = new int[g[cur].length + 2];
			BitSet bs = new BitSet();
			if(cur != 0 && fall[cur] < f.length){
				f[fall[cur]]++;
				bs.set(fall[cur]);
			}
			for(int e : g[cur]){
				if(par[cur] == e)continue;
				if(nim[e] < f.length)f[nim[e]]++;
				bs.set(nim[e]);
			}
			int c = bs.nextClearBit(0);
			rdp[cur] = c;
			for(int e : g[cur]){
				if(par[cur] == e)continue;
				if(nim[e] < c && f[nim[e]] == 1){
					fall[e] = nim[e];
				}else{
					fall[e] = c;
				}
			}
		}
		
		int x = 0;
		for(int v : a){
			x ^= rdp[v-1];
		}
		if(x == 0){
			out.println("-1 -1");
		}else{
			int p = 0;
			for(int v : a){
				if((rdp[v-1]^x) <= rdp[v-1]){
					for(int e : g[v-1]){
						if(par[v-1] == e)continue;
						if(nim[e] == (rdp[v-1]^x)){
							out.println((p+1) + " " + (e+1));
							return;
						}
					}
					out.println((p+1) + " " + (par[v-1]+1));
					return;
				}
				p++;
			}
			assert false;
		}
	}

	public static int[][] parents3(int[][] g, int root) {
		int n = g.length;
		int[] par = new int[n];
		Arrays.fill(par, -1);

		int[] depth = new int[n];
		depth[0] = 0;

		int[] q = new int[n];
		q[0] = root;
		for (int p = 0, r = 1; p < r; p++) {
			int cur = q[p];
			for (int nex : g[cur]) {
				if (par[cur] != nex) {
					q[r++] = nex;
					par[nex] = cur;
					depth[nex] = depth[cur] + 1;
				}
			}
		}
		return new int[][] { par, q, depth };
	}

	static int[][] packU(int n, int[] from, int[] to) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int t : to)
			p[t]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]];
		for (int i = 0; i < from.length; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}


	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new No1153().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0