結果

問題 No.1843 Tree ANDistance
ユーザー nishi5451nishi5451
提出日時 2022-02-21 00:06:14
言語 Java21
(openjdk 21)
結果
AC  
実行時間 311 ms / 2,000 ms
コード長 3,984 bytes
コンパイル時間 2,220 ms
コンパイル使用メモリ 78,788 KB
実行使用メモリ 63,568 KB
最終ジャッジ日時 2024-06-29 10:58:47
合計ジャッジ時間 9,581 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 248 ms
61,992 KB
testcase_01 AC 278 ms
63,092 KB
testcase_02 AC 275 ms
63,076 KB
testcase_03 AC 267 ms
63,044 KB
testcase_04 AC 290 ms
63,568 KB
testcase_05 AC 232 ms
62,184 KB
testcase_06 AC 277 ms
63,100 KB
testcase_07 AC 283 ms
58,880 KB
testcase_08 AC 239 ms
59,956 KB
testcase_09 AC 279 ms
58,996 KB
testcase_10 AC 256 ms
58,728 KB
testcase_11 AC 281 ms
63,320 KB
testcase_12 AC 311 ms
59,104 KB
testcase_13 AC 249 ms
59,120 KB
testcase_14 AC 94 ms
52,080 KB
testcase_15 AC 93 ms
52,056 KB
testcase_16 AC 79 ms
51,360 KB
testcase_17 AC 74 ms
51,404 KB
testcase_18 AC 58 ms
50,312 KB
testcase_19 AC 95 ms
52,076 KB
testcase_20 AC 79 ms
51,292 KB
testcase_21 AC 45 ms
50,208 KB
testcase_22 AC 45 ms
49,932 KB
testcase_23 AC 46 ms
50,124 KB
testcase_24 AC 46 ms
49,924 KB
testcase_25 AC 46 ms
49,948 KB
testcase_26 AC 45 ms
50,272 KB
testcase_27 AC 45 ms
50,168 KB
testcase_28 AC 206 ms
55,748 KB
testcase_29 AC 184 ms
56,848 KB
testcase_30 AC 187 ms
56,520 KB
testcase_31 AC 179 ms
57,756 KB
testcase_32 AC 177 ms
55,784 KB
testcase_33 AC 163 ms
56,428 KB
testcase_34 AC 161 ms
55,608 KB
testcase_35 AC 46 ms
50,080 KB
testcase_36 AC 46 ms
49,820 KB
testcase_37 AC 47 ms
49,976 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*;
import java.util.stream.*;
import java.io.*;

class UFT {
	int[] par;
	int[] rank;
	int[] size;
	int n;
	int groups;
	public UFT(int n){
		this.n = n;
		groups = n;
		par = new int[n];
		rank = new int[n];
		size = new int[n];
		for(int i = 0; i < n; i++){
			par[i] = i;
			rank[i] = 0;
			size[i] = 1;
		}
	}
	public int root(int x){
		if(par[x] == x) return x;
		else return par[x] = root(par[x]);
	}
	public boolean merge(int x, int y){
		x = root(x);
		y = root(y);
		if(x == y) return false;
		if(rank[x] < rank[y]){
			par[x] = y;
			size[y] += size[x];
			size[x] = 0;
		} else {
			par[y] = x;
			size[x] += size[y];
			size[y] = 0;
			if(rank[x] == rank[y]) rank[x]++;
		}
		groups--;
		return true;
	}
	public boolean isSame(int x, int y){
		return root(x) == root(y);
	}
	public boolean isConnected(){
		int s = root(0);
		if(s == n) return true;
		else return false;
	}
	public int connectedComponents(){
		return groups;
	}
	public int groupSize(int i){
		return size[root(i)];
	}
}

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		int n = fs.nextInt();
		int[] a = new int[n-1];
		int[] b = new int[n-1];
		long[] c = new long[n-1];
		for(int i = 0; i < n-1; i++){
			a[i] = fs.nextInt() - 1;
			b[i] = fs.nextInt() - 1;
			c[i] = fs.nextLong();
		}
		long ans = 0;
		for(int i = 0; i < 31; i++){
			UFT uft = new UFT(n);
			for(int j = 0; j < n-1; j++){
				if((c[j] & 1L<<i) > 0){
					uft.merge(a[j], b[j]);
				}
			}
			long cnt = 0;
			for(int j = 0; j < n; j++){
				if(uft.root(j) == j){
					long size = (long)uft.size[j] * (uft.size[j] - 1) / 2;
					size %= MOD;
					cnt = (cnt + size) % MOD;
				}
			}
			ans = (ans + (cnt * 1L<<i) % MOD) % MOD;
		}
		pw.println(ans);
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}
0