結果

問題 No.1843 Tree ANDistance
ユーザー suta28407928suta28407928
提出日時 2022-02-18 21:59:16
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 419 ms / 2,000 ms
コード長 3,838 bytes
コンパイル時間 2,288 ms
コンパイル使用メモリ 190,944 KB
実行使用メモリ 14,628 KB
最終ジャッジ日時 2024-06-29 08:52:38
合計ジャッジ時間 10,316 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 402 ms
14,080 KB
testcase_01 AC 405 ms
14,080 KB
testcase_02 AC 372 ms
14,080 KB
testcase_03 AC 380 ms
13,952 KB
testcase_04 AC 419 ms
14,628 KB
testcase_05 AC 280 ms
13,432 KB
testcase_06 AC 299 ms
13,396 KB
testcase_07 AC 384 ms
13,440 KB
testcase_08 AC 391 ms
13,708 KB
testcase_09 AC 349 ms
13,376 KB
testcase_10 AC 333 ms
13,184 KB
testcase_11 AC 391 ms
14,540 KB
testcase_12 AC 243 ms
12,492 KB
testcase_13 AC 275 ms
12,580 KB
testcase_14 AC 11 ms
5,376 KB
testcase_15 AC 12 ms
5,376 KB
testcase_16 AC 5 ms
5,376 KB
testcase_17 AC 5 ms
5,376 KB
testcase_18 AC 3 ms
5,376 KB
testcase_19 AC 10 ms
5,376 KB
testcase_20 AC 6 ms
5,376 KB
testcase_21 AC 2 ms
5,376 KB
testcase_22 AC 2 ms
5,376 KB
testcase_23 AC 2 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 2 ms
5,376 KB
testcase_26 AC 2 ms
5,376 KB
testcase_27 AC 2 ms
5,376 KB
testcase_28 AC 176 ms
11,520 KB
testcase_29 AC 116 ms
8,832 KB
testcase_30 AC 102 ms
9,020 KB
testcase_31 AC 176 ms
12,288 KB
testcase_32 AC 175 ms
12,288 KB
testcase_33 AC 45 ms
5,964 KB
testcase_34 AC 116 ms
9,620 KB
testcase_35 AC 2 ms
5,376 KB
testcase_36 AC 2 ms
5,376 KB
testcase_37 AC 2 ms
5,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#pragma GCC ta g("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << '(' << p.first << ',' << p.second << ')';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
for(int i = 0; i < (int)v.size(); i++) {
if(i) { os << ','; }
os << v[i];
}
os << '}';
return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
cerr << " " << x;
debugg(args...);
}
#define debug(...) \
cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
if(a>b){
a = b; return true;
}
else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
if(a<b){
a = b; return true;
}
else return false;
}
template<typename T> inline void print(T &a){
int sz = a.size();
for(auto itr = a.begin(); itr != a.end(); itr++){
cout << *itr;
sz--;
if(sz) cout << " ";
}
cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//#include <atcoder/mincostflow>
//using namespace atcoder;
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 5100000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-9;
const int mod = 1e9 + 7;
//const int mod = 998244353;
struct UnionFind{
vl p;
vl rank;
vl cnt;
UnionFind(ll n){
rank.resize(n,0);
p.resize(n,0);
cnt.resize(n,0);
rep(i,n){
p[i] = i;
rank[i] = 0;
cnt[i] = 1;
}
}
ll find(ll x){
if(x != p[x]) p[x] = find(p[x]);
return p[x];
}
bool same(ll x, ll y){
return find(x) == find(y);
}
void unite(ll x, ll y){
x = find(x);
y = find(y);
if(x == y) return;
if(rank[x] > rank[y]){
p[y] = x;
cnt[x] += cnt[y];
}else{
p[x] = y;
cnt[y] += cnt[x];
if(rank[x] == rank[y]) rank[y]++;
}
}
ll size(ll x){
return cnt[find(x)];
}
};
int main(){
int n; cin >> n;
vector<vpl> G(n);
rep(i,n-1){
ll a,b,c; cin >> a >> b >> c; a--; b--;
G[a].emplace_back(b,c);
G[b].emplace_back(a,c);
}
ll ans = 0;
rep(i,31){
UnionFind uf(n);
rep(j,n) for(auto v : G[j]){
if(v.second>>i & 1) uf.unite(j,v.first);
}
vl cnt(n,0);
rep(j,n) cnt[uf.find(j)]++;
rep(j,n) ans += (cnt[j] * (cnt[j]-1) / 2) % mod * (1<<i) % mod;
ans %= mod;
}
cout << ans << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0