結果

問題 No.1054 Union add query
コンテスト
ユーザー 37zigen
提出日時 2019-11-09 06:07:06
言語 Java
(openjdk 23)
結果
AC  
実行時間 470 ms / 2,000 ms
コード長 3,650 bytes
コンパイル時間 2,409 ms
コンパイル使用メモリ 77,892 KB
実行使用メモリ 55,204 KB
最終ジャッジ日時 2024-11-27 23:59:21
合計ジャッジ時間 7,150 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 8
権限があれば一括ダウンロードができます

ソースコード

diff # 

//check violation of constraints

import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

public class Main {

	class DJSet {
		int n;
		int[] upper;
		long[] weight;

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

		void add_weight(int x, long w) {
			x = (int) rw(x)[0];
			weight[x] += w;
		}

		// [root, weight]
		long[] rw(int x) {
			if (upper[x] < 0) {
				return new long[] { x, weight[x] };
			} else {
				long[] ret = new long[2];
				long[] rw = rw(upper[x]);
				ret[0] = rw[0];
				ret[1] = rw[1] + weight[x];
				weight[(int) x] = ret[1] - weight[(int) rw[0]];
				upper[x] = (int) rw[0];
				return ret;
			}
		}

		boolean equiv(int x, int y) {
			return rw(x)[0] == rw(y)[0];
		}

		void setUnion(int x, int y) {
			x = (int) rw(x)[0];
			y = (int) rw(y)[0];
			if (x == y)
				return;
			if (upper[x] < upper[y]) {
				x ^= y;
				y ^= x;
				x ^= y;
			}
			upper[y] += upper[x];
			upper[x] = y;
			weight[x] -= weight[y];
		}
	}

	void run() {
		FastScanner sc = new FastScanner();
		int N = sc.nextInt();
		int Q = sc.nextInt();
		if (!(1 <= N && N <= 5e5 && 1 <= Q && Q <= 5e5))
			throw new AssertionError();
		DJSet ds = new DJSet(N);
		PrintWriter pw = new PrintWriter(System.out);
		for (int q = 0; q < Q; ++q) {
			int T = sc.nextInt();
			int A = sc.nextInt();
			int B = sc.nextInt();

			--A;
			if (T == 1) {
				--B;
				if (ds.equiv(A, B))
					continue;
				ds.setUnion(A, B);
			} else if (T == 2) {
				ds.add_weight(A, B);
			} else if (T == 3) {
				pw.println(ds.rw(A)[1]);
			}
		}
		pw.close();
	}

	public static void main(String[] args) throws FileNotFoundException {
		new Main().run();
	}

	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		} else {
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} 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;
	}

	public boolean hasNext() {
		while (hasNextByte() && !isPrintableChar(buffer[ptr]))
			ptr++;
		return hasNextByte();
	}

	public String next() {
		if (!hasNext())
			throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while (isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}

	public long nextLong() {
		if (!hasNext())
			throw new NoSuchElementException();
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		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();
			}
			b = readByte();
		}
	}

	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE)
			throw new NumberFormatException();
		return (int) nl;
	}

	public double nextDouble() {
		return Double.parseDouble(next());
	}
}
0