#740641 (C++17) No.1843 Tree ANDistance

提出ソース

結果

問題	No.1843 Tree ANDistance
ユーザー	heno239
提出日時	2022-02-18 23:53:44
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	386 ms / 2,000 ms
コード長	5,088 bytes
コンパイル時間	1,937 ms
コンパイル使用メモリ	155,304 KB
実行使用メモリ	18,048 KB
最終ジャッジ日時	2024-06-29 09:57:43
合計ジャッジ時間	9,293 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	364 ms 17,280 KB
testcase_01	AC	343 ms 17,408 KB
testcase_02	AC	317 ms 16,896 KB
testcase_03	AC	386 ms 16,896 KB
testcase_04	AC	361 ms 18,048 KB
testcase_05	AC	226 ms 17,936 KB
testcase_06	AC	238 ms 17,792 KB
testcase_07	AC	324 ms 17,152 KB
testcase_08	AC	330 ms 17,220 KB
testcase_09	AC	302 ms 16,580 KB
testcase_10	AC	290 ms 16,512 KB
testcase_11	AC	345 ms 17,984 KB
testcase_12	AC	204 ms 17,336 KB
testcase_13	AC	222 ms 17,280 KB
testcase_14	AC	16 ms 11,844 KB
testcase_15	AC	16 ms 11,776 KB
testcase_16	AC	12 ms 11,648 KB
testcase_17	AC	11 ms 11,588 KB
testcase_18	AC	10 ms 11,588 KB
testcase_19	AC	16 ms 11,904 KB
testcase_20	AC	12 ms 11,776 KB
testcase_21	AC	8 ms 11,584 KB
testcase_22	AC	9 ms 11,648 KB
testcase_23	AC	8 ms 11,712 KB
testcase_24	AC	8 ms 11,520 KB
testcase_25	AC	8 ms 11,648 KB
testcase_26	AC	8 ms 11,648 KB
testcase_27	AC	9 ms 11,520 KB
testcase_28	AC	202 ms 16,068 KB
testcase_29	AC	136 ms 14,404 KB
testcase_30	AC	124 ms 14,336 KB
testcase_31	AC	206 ms 16,068 KB
testcase_32	AC	209 ms 16,640 KB
testcase_33	AC	61 ms 13,124 KB
testcase_34	AC	143 ms 15,428 KB
testcase_35	AC	9 ms 11,648 KB
testcase_36	AC	9 ms 11,592 KB
testcase_37	AC	9 ms 11,716 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 100005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

struct edge {
	int to, cost;
};
void solve() {
	int n; cin >> n;
	vector<vector<edge>> G(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b; a--; b--;
		int c; cin >> c;
		G[a].push_back({ b,c });
		G[b].push_back({ a,c });
	}
	modint ans = 0;
	rep(j, 30) {
		vector<bool> used(n);
		rep(i, n) {
			if (used[i])continue;
			ll cnt = 0;
			used[i] = true;
			queue<int> q; q.push(i);
			while (!q.empty()) {
				cnt++;
				int id = q.front(); q.pop();
				for (edge e : G[id])if(e.cost&(1<<j))if(!used[e.to]) {
					used[e.to] = true;
					q.push(e.to);
				}
			}
			modint val = cnt * (cnt - 1) / 2;
			val *= (1 << j);
			ans += val;
		}
	}
	cout << ans << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	//init();
	//while(true)
	//useexpr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}

yukicoder

結果

テストケース

ソースコード