結果

問題 No.922 東北きりきざむたん
ユーザー uwiuwi
提出日時 2019-11-08 22:30:40
言語 Java21
(openjdk 21)
結果
AC  
実行時間 441 ms / 2,000 ms
コード長 7,543 bytes
コンパイル時間 4,802 ms
コンパイル使用メモリ 82,020 KB
実行使用メモリ 63,960 KB
最終ジャッジ日時 2024-09-15 01:42:31
合計ジャッジ時間 13,385 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 53 ms
36,644 KB
testcase_01 AC 53 ms
36,864 KB
testcase_02 AC 53 ms
37,008 KB
testcase_03 AC 53 ms
36,876 KB
testcase_04 AC 54 ms
37,116 KB
testcase_05 AC 53 ms
37,200 KB
testcase_06 AC 54 ms
36,768 KB
testcase_07 AC 53 ms
36,980 KB
testcase_08 AC 53 ms
36,748 KB
testcase_09 AC 186 ms
50,628 KB
testcase_10 AC 165 ms
46,144 KB
testcase_11 AC 191 ms
49,832 KB
testcase_12 AC 166 ms
54,188 KB
testcase_13 AC 114 ms
42,516 KB
testcase_14 AC 286 ms
60,672 KB
testcase_15 AC 134 ms
54,612 KB
testcase_16 AC 374 ms
63,960 KB
testcase_17 AC 365 ms
63,212 KB
testcase_18 AC 385 ms
63,296 KB
testcase_19 AC 394 ms
62,680 KB
testcase_20 AC 369 ms
62,464 KB
testcase_21 AC 433 ms
62,620 KB
testcase_22 AC 441 ms
63,216 KB
testcase_23 AC 392 ms
63,336 KB
testcase_24 AC 387 ms
62,936 KB
testcase_25 AC 269 ms
63,364 KB
testcase_26 AC 290 ms
63,176 KB
testcase_27 AC 321 ms
62,540 KB
testcase_28 AC 269 ms
62,444 KB
testcase_29 AC 396 ms
62,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

public class C2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	// r-1-2-4
	//   1-1-1
	
	void solve()
	{
		int n = ni(), m = ni(), Q = ni();
		int[] from = new int[n];
		int[] to = new int[n];
		DJSet ds = new DJSet(n);
		for (int i = 0; i < m; i++) {
			from[i] = ni() - 1;
			to[i] = ni() - 1;
			ds.union(from[i], to[i]);
		}
		int p = m;
		for(int i = 0;i < n;i++) {
			if(ds.upper[i] < 0) {
				from[p] = i; to[p] = n;
				p++;
			}
		}
		assert p == n;
		
		int[][] ts = new int[Q][];
		for(int i = 0;i < Q;i++) {
			ts[i] = new int[] {ni()-1, ni()-1};
		}
		
		int[][] g = packU(n+1, from, to);
		int[][] pars = parents3(g, n);
		int[] par = pars[0], ord = pars[1], dep = pars[2];
		int[][] spar = logstepParents(par);
		
		int[] ws = new int[n+1];
		long ans = 0;
		for(int i = 0;i < Q;i++) {
			int lca = lca2(ts[i][0], ts[i][1], spar, dep);
			if(lca == n) {
				ws[ts[i][0]]++;
				ws[ts[i][1]]++;
			}else {
				ans += dep[ts[i][0]] + dep[ts[i][1]] - 2*dep[lca];
			}
		}
		
		long[] dp = new long[n];
		long[] cws = new long[n];
		for(int i = n;i >= 1;i--) {
			int cur = ord[i];
			for(int e : g[cur]) {
				if(par[cur] == e)continue;
				dp[cur] += dp[e] + cws[e];
				cws[cur] += cws[e];
			}
			cws[cur] += ws[cur];
		}
		
		for(int i = 1;i <= n;i++) {
			int cur = ord[i];
			if(par[cur] == n)continue;
			
			dp[cur] = dp[cur] + (dp[par[cur]] - (dp[cur] + cws[cur])) + (cws[par[cur]] - cws[cur]);
			cws[cur] += cws[par[cur]] - cws[cur];
		}
		
		int[] dom = new int[n];
		Arrays.fill(dom, -1);
		
		long[] mins = new long[n];
		Arrays.fill(mins, Long.MAX_VALUE);
		int[] args = new int[n];
		for(int i = 0;i < n;i++)args[i] = i;
		
		for(int i = 0;i < n;i++) {
			int dm = ancestor(i, dep[i]-1, spar);
			if(dp[i] < mins[dm]) {
				mins[dm] = dp[i];
				args[dm] = i;
			}
		}
		
		for(int i = 0;i < n;i++) {
			int dm = ancestor(i, dep[i]-1, spar);
			int y = args[dm];
			ans += (dep[i] + dep[y] - 2 * dep[lca2(i, y, spar, dep)]) * ws[i];
		}
		out.println(ans);
	}
	
	public static int lca2(int a, int b, int[][] spar, int[] depth) {
		if (depth[a] < depth[b]) {
			b = ancestor(b, depth[b] - depth[a], spar);
		} else if (depth[a] > depth[b]) {
			a = ancestor(a, depth[a] - depth[b], spar);
		}

		if (a == b)
			return a;
		int sa = a, sb = b;
		for (int low = 0, high = depth[a], t = Integer.highestOneBit(high), k = Integer
				.numberOfTrailingZeros(t); t > 0; t >>>= 1, k--) {
			if ((low ^ high) >= t) {
				if (spar[k][sa] != spar[k][sb]) {
					low |= t;
					sa = spar[k][sa];
					sb = spar[k][sb];
				} else {
					high = low | t - 1;
				}
			}
		}
		return spar[0][sa];
	}

	protected static int ancestor(int a, int m, int[][] spar) {
		for (int i = 0; m > 0 && a != -1; m >>>= 1, i++) {
			if ((m & 1) == 1)
				a = spar[i][a];
		}
		return a;
	}

	public static int[][] logstepParents(int[] par) {
		int n = par.length;
		int m = Integer.numberOfTrailingZeros(Integer.highestOneBit(n - 1)) + 1;
		int[][] pars = new int[m][n];
		pars[0] = par;
		for (int j = 1; j < m; j++) {
			for (int i = 0; i < n; i++) {
				pars[j][i] = pars[j - 1][i] == -1 ? -1 : pars[j - 1][pars[j - 1][i]];
			}
		}
		return pars;
	}

	
	public static class DJSet {
		public int[] upper;

		public DJSet(int n) {
			upper = new int[n];
			Arrays.fill(upper, -1);
		}

		public int root(int x) {
			return upper[x] < 0 ? x : (upper[x] = root(upper[x]));
		}

		public boolean equiv(int x, int y) {
			return root(x) == root(y);
		}

		public boolean union(int x, int y) {
			x = root(x);
			y = root(y);
			if (x != y) {
				if (upper[y] < upper[x]) {
					int d = x;
					x = y;
					y = d;
				}
				upper[x] += upper[y];
				upper[y] = x;
			}
			return x == y;
		}

		public int count() {
			int ct = 0;
			for (int u : upper)
				if (u < 0)
					ct++;
			return ct;
		}
	}


	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 C2().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