結果

問題 No.399 動的な領主
ユーザー threepipes_sthreepipes_s
提出日時 2016-07-16 00:20:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 749 ms / 2,000 ms
コード長 9,051 bytes
コンパイル時間 4,937 ms
コンパイル使用メモリ 94,180 KB
実行使用メモリ 82,392 KB
最終ジャッジ日時 2024-11-07 19:16:59
合計ジャッジ時間 14,294 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
37,436 KB
testcase_01 AC 55 ms
37,276 KB
testcase_02 AC 59 ms
37,432 KB
testcase_03 AC 57 ms
37,348 KB
testcase_04 AC 106 ms
39,532 KB
testcase_05 AC 205 ms
47,012 KB
testcase_06 AC 749 ms
79,436 KB
testcase_07 AC 719 ms
79,324 KB
testcase_08 AC 722 ms
79,856 KB
testcase_09 AC 740 ms
79,352 KB
testcase_10 AC 114 ms
39,528 KB
testcase_11 AC 203 ms
46,796 KB
testcase_12 AC 672 ms
80,296 KB
testcase_13 AC 670 ms
79,736 KB
testcase_14 AC 525 ms
78,128 KB
testcase_15 AC 561 ms
78,388 KB
testcase_16 AC 570 ms
82,392 KB
testcase_17 AC 712 ms
79,212 KB
testcase_18 AC 717 ms
79,364 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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.BitSet;
import java.util.HashMap;
import java.util.List;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	static ContestScanner in;static Writer out;public static void main(String[] args)
	{try{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){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	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){for(int i=0;i<a.length;i++)out.print(a[i]+" ");out.println();}
	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;}
	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 NumberFormatException, IOException{
		final int n = in.nextInt();
		LCA lca = new LCA(n);
		for(int i=0; i<n-1; i++){
			final int u = in.nextInt()-1;
			final int v = in.nextInt()-1;
			lca.edge(u, v);
			lca.edge(v, u);
		}
		lca.checkPar(0);
		final int q = in.nextInt();
		sum = new int[n];
		for(int i=0; i<q; i++){
			int a = in.nextInt()-1;
			int b = in.nextInt()-1;
			sum[a]++;
			sum[b]++;
			int anc = lca.lca(a, b);
			sum[anc]--;
			int par = lca.parent(anc);
			if(par>=0) sum[par]--;
		}
		node = lca.tree;
//		dfs(0, -1);
		int[] cq = new int[n*2+10];
		int[] pq = new int[n*2+10];
		boolean[] fq = new boolean[n*2+10];
		int t = 1;
		pq[0] = -1;
		while(t>0){
			final int cur = cq[--t];
			final int par = pq[t];
			final boolean flg = fq[t];
			if(flg){
				if(par>=0){
					sum[par] += sum[cur];
//					System.out.println("par: "+par+" ;"+(sum[par]-sum[cur])+"->"+sum[par]);
				}
			}else{
				fq[t] = true;
				cq[t] = cur;
				pq[t] = par;
				t++;
				for(int v: node[cur]){
					if(v==par) continue;
					fq[t] = false;
					cq[t] = v;
					pq[t] = cur;
					t++;
				}
			}
		}
		long ans = 0;
		for(int i=0; i<n; i++){
			ans += (long)sum[i]*(sum[i]+1)/2;
		}
		System.out.println(ans);
	}
	int[] sum;
	List<Integer>[] node;
	int dfs(int cur, int par){
		for(int v: node[cur]){
			if(v==par) continue;
			sum[cur] += dfs(v, cur);
		}
		return sum[cur];
	}
}

class LCA{
	List<Integer>[] tree;
	int[][] parent;
	int[] dep;
	int log, sp;
	final int n;
	int[] stc, stp, std;
	public LCA(int n) {
		tree = new List[n];
		for(int i=0; i<n; i++) tree[i] = new ArrayList<>();
		log = 0;
		int m = n;
		while(m>0){
			log++;
			m >>= 1;
		}
		parent = new int[n][log];
		dep = new int[n];
		stc = new int[n];
		stp = new int[n];
		std = new int[n];
		this.n = n;
	}
	void edge(int p, int c){
		tree[p].add(c);
	}
	int parent(int c){
		if(parent[c][0]==c) return -1;
		return parent[c][0];
	}
	public void checkPar(int root){
		stc[0] = stp[0] = root; std[0] = 0; sp = 1;
		while(sp>0){
			final int cur = stc[--sp];
			final int par = stp[sp];
			final int d = std[sp];
			dep[cur] = d;
			parent[cur][0] = par;
			for(int v: tree[cur]){
				if(v==par) continue;
				stc[sp] = v;
				stp[sp] = cur;
				std[sp] = d+1;
				sp++;
			}
		}
		for(int i=1; i<log; i++){
			for(int j=0; j<n; j++){
				parent[j][i] = parent[parent[j][i-1]][i-1];
			}
		}
	}
	int lca(int u, int v){
		if(dep[u]>dep[v]){
			final int tmp = u; u = v; v = tmp;
		}
		for(int i=0, d=dep[v]-dep[u]; d>0; i++, d>>=1){
			if((d&1)==1) v = parent[v][i];
		}
		if(u==v) return u;
		for(int i=log-1; i>=0; i--){
			if(parent[v][i]!=parent[u][i]){
				v = parent[v][i];
				u = parent[u][i];
			}
		}
		return parent[u][0];
	}
}


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;}
}
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();}
}
0