結果

問題 No.1769 Don't Stop the Game
ユーザー rianoriano
提出日時 2021-11-27 23:06:00
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 936 ms / 3,000 ms
コード長 7,752 bytes
コンパイル時間 2,247 ms
コンパイル使用メモリ 197,452 KB
実行使用メモリ 99,448 KB
最終ジャッジ日時 2024-06-30 14:26:51
合計ジャッジ時間 17,628 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,816 KB
testcase_01 AC 4 ms
6,940 KB
testcase_02 AC 4 ms
6,940 KB
testcase_03 AC 5 ms
6,944 KB
testcase_04 AC 4 ms
6,940 KB
testcase_05 AC 5 ms
6,944 KB
testcase_06 AC 4 ms
6,940 KB
testcase_07 AC 5 ms
6,940 KB
testcase_08 AC 243 ms
24,176 KB
testcase_09 AC 254 ms
22,784 KB
testcase_10 AC 557 ms
44,416 KB
testcase_11 AC 176 ms
19,456 KB
testcase_12 AC 202 ms
27,980 KB
testcase_13 AC 212 ms
28,308 KB
testcase_14 AC 218 ms
28,372 KB
testcase_15 AC 233 ms
28,264 KB
testcase_16 AC 337 ms
28,536 KB
testcase_17 AC 578 ms
35,984 KB
testcase_18 AC 841 ms
61,152 KB
testcase_19 AC 931 ms
73,104 KB
testcase_20 AC 927 ms
74,892 KB
testcase_21 AC 936 ms
75,200 KB
testcase_22 AC 914 ms
75,176 KB
testcase_23 AC 204 ms
28,336 KB
testcase_24 AC 205 ms
28,336 KB
testcase_25 AC 81 ms
27,428 KB
testcase_26 AC 762 ms
74,300 KB
testcase_27 AC 121 ms
54,464 KB
testcase_28 AC 872 ms
99,448 KB
testcase_29 AC 875 ms
88,236 KB
testcase_30 AC 887 ms
88,428 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In member function 'void tree::dfs_(long long int, long long int, bool)':
main.cpp:179:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  179 |         for(auto[nx,cost]:G[s]){
      |                 ^
main.cpp: In member function 'std::vector<long long int> tree::adj(long long int)':
main.cpp:260:17: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  260 |         for(auto[x,c]:G[i]){
      |                 ^
main.cpp: In function 'int main()':
main.cpp:278:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  278 |     for(auto[x,c]:top_cc){
      |             ^

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rrep2(i,n,k) for(int i=n-1;i>=n-k;i--)
#define vll(n,i) vector<long long>(n,i)
#define v2ll(n,m,i) vector<vector<long long>>(n,vll(m,i))
#define v3ll(n,m,k,i) vector<vector<vector<long long>>>(n,v2ll(m,k,i))
#define v4ll(n,m,k,l,i) vector<vector<vector<vector<long long>>>>(n,v3ll(m,k,l,i))
#define all(v) v.begin(),v.end()
#define chmin(k,m) k = min(k,m)
#define chmax(k,m) k = max(k,m)
#define Pr pair<ll,ll>
#define Tp tuple<int,int,int>
#define riano_ std::ios::sync_with_stdio(false);std::cin.tie(nullptr)
using Graph = vector<vector<int>>;

const ll mod = 998244353;
template<uint64_t mod>
struct modint{
    uint64_t val;
    constexpr modint(const int64_t val_=0) noexcept:val((val_%int64_t(mod)+int64_t(mod))%int64_t(mod)){}
    constexpr modint operator-() const noexcept{
        return modint(*this)=mod-val;
    }
    constexpr modint operator+(const modint rhs) const noexcept{
        return modint(*this)+=rhs;
    }
    constexpr modint operator-(const modint rhs) const noexcept{
        return modint(*this)-=rhs;
    }
    constexpr modint operator*(const modint rhs) const noexcept{
        return modint(*this)*=rhs;
    }
    constexpr modint operator/(const modint rhs) const noexcept{
        return modint(*this)/=rhs;
    }
    constexpr modint &operator+=(const modint rhs) noexcept{
        val+=rhs.val;
        val-=((val>=mod)?mod:0);
        return (*this);
    }
    constexpr modint &operator-=(const modint rhs) noexcept{
        val+=((val<rhs.val)?mod:0);
        val-=rhs.val;
        return (*this);
    }
    constexpr modint &operator*=(const modint rhs) noexcept{
        val=val*rhs.val%mod;
        return (*this);
    }
    constexpr modint &operator/=(modint rhs) noexcept{
        uint64_t ex=mod-2;
        modint now=1;
        while(ex){
            now*=((ex&1)?rhs:1);
            rhs*=rhs,ex>>=1;
        }
        return (*this)*=now;
    }
    modint & operator++(){
        val++;
        if (val == mod) val = 0;
        return *this;
    }
    modint operator++(int){
        modint<mod> res = *this;
        ++*this;
        return res;
    }
    constexpr bool operator==(const modint rhs) noexcept{
        return val==rhs.val;
    }
    constexpr bool operator!=(const modint rhs) noexcept{
        return val!=rhs.val;
    }
    friend constexpr ostream &operator<<(ostream& os,const modint x) noexcept{
        return os<<(x.val);
    }
    friend constexpr istream &operator>>(istream& is,modint& x) noexcept{
        uint64_t t;
        is>>t,x=t;
        return is;
    }
};
typedef modint<mod> mint;
mint pw(long long a,long long b,long long m = mod){
    if(a%m==0) return mint(0);
    if(b==0) return mint(1);
    else if(b%2==0){
        long long x = pw(a,b/2,m).val;
        return mint(x*x);
    }
    else{
        long long x = pw(a,b-1,m).val;
        return mint(a*x);
    }
}
mint modinv(long long a, long long m = mod) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    return mint(u);
}
#define vm(n,i) vector<mint>(n,i)
#define v2m(n,m,i) vector<vector<mint>>(n,vm(m,i))
#define v3m(n,m,k,i) vector<vector<vector<mint>>>(n,v2m(m,k,i))
#define v4m(n,m,k,l,i) vector<vector<vector<vector<mint>>>>(n,v3m(m,k,l,i))

map<ll,vector<ll>> prv;
auto cc = vll(2e5+1,0);
auto ss = vll(2e5+1,0);
ll ans = 0;
map<ll,ll> top_cc;
map<ll,ll> top_ss;


//map add
template <typename T>
void add(map<T,ll> &cnt,T a,ll n = 1){
    if(cnt.count(a)) cnt[a] += n;
    else cnt[a] = n;
}

//tree
#define type long long
type el = 0;
vector<type> emp = {};
struct tree {
    long long N;
	vector<vector<pair<long long,long long>>> G;
    vector<long long> depth;
    vector<long long> subtree_size; //部分木のサイズ
    vector<long long> deg;
    vector<long long> par;
    vector<int> vis;
    vector<type> dp; //DPの結果
    vector<vector<type>> dp_cand;
    long long len;
    long long euler_time;
    long long limit_len = 2e9;
    vector<long long> from_e1; //直径の端点からの距離
    vector<long long> from_e2; //直径の端点からの距離
    long long cen,end1,end2,diam; //中心、直径の端点、直径
    vector<vector<type>> fr; 
    vector<vector<type>> bc;
    vector<type> from_par;
    vector<type> reroot_dp; //全方位DPの結果
	tree(long long n) {
        N = n;
		G = vector<vector<pair<long long,long long>>>(N);
        depth = vector<long long>(N,-1);
        par = vector<long long>(N,-1);
        subtree_size = vector<long long>(N,1);
        deg = vector<long long>(N,0);
	}
 
    //DP 操作: 書き換え必須
    void dp_operation(long long s){
        
    }
 
    //Euler Tour で何かする場合は書き足す
    void dfs_(long long s,long long i,bool dp_){
        len++;
        euler_time++;
        ll d = depth[s];
        if(prv.count(d)){
            prv[d].push_back(s);
        }
        else{
            prv[d] = {s};
        }
        for(auto[nx,cost]:G[s]){
            if(len>=limit_len) break;
            if(vis[nx]==i) continue;
            ss[s] = 0; cc[s] = 0;
            depth[nx] = depth[s] ^ cost;
            vis[nx] = i;
            par[nx] = s;
            dfs_(nx,i,dp_);
            ans -= cc[s]*(ss[s]+(N-1)-subtree_size[nx]);
        }
        if(par[s]!=-1){
            subtree_size[par[s]] += subtree_size[s];
        }
        if(dp_) dp_operation(s);
        len--;
        prv[d].pop_back();
        if(prv[d].size()!=0){
            ll k = prv[d].size()-1;
            ll p1 = prv[d][k];
            cc[p1]++; ss[p1] += subtree_size[s];
        }
        else{
            add(top_cc,d);
            add(top_ss,d,subtree_size[s]);
        }
    }
 
    //c は辺の重み
    void unite(long long a,long long b,long long c = 1){
        G[a].emplace_back(b,c);
        G[b].emplace_back(a,c);
        deg[a]++; deg[b]++;
    }
 
    //lim は探索長さ制限 dfs_count は探索累積回数（前回訪問済情報を残す場合）
    void dfs(long long rt,bool dp_ = false,long long lim = 2e9,long long dfs_count = 0){
        if(dfs_count==0) vis.assign(N,-1);
        if(dp_){
            dp.assign(N,el);
            dp_cand.assign(N,emp);
        }
        limit_len = lim;
        euler_time = -1;
        len = -1;
        vis[rt] = dfs_count; depth[rt] = 0;
        dfs_(rt,dfs_count,dp_);
    }
 
    long long diameter(void){
        dfs(1);
        from_e2 = depth;
        long long mx = -1;
        for(int i=0;i<N;i++){
            if(from_e2[i]>mx){
                end1 = i; mx = from_e2[i];
            }
        }
        dfs(end1);
        from_e1 = depth;
        mx = -1;
        for(int i=0;i<N;i++){
            if(from_e1[i]>mx){
                end2 = i; mx = from_e1[i];
            }
        }
        dfs(end2);
        from_e2 = depth;
        diam = mx;
        center();
        return diam;
    }
    long long center(void){
        for(int i=0;i<N;i++){
            if(from_e1[i]==from_e2[i]&&from_e2[i]==diam/2){
                cen = i; break;
            }
        }
        return cen;
    }
    vector<long long> adj(long long i){
        vector<long long> res;
        for(auto[x,c]:G[i]){
            res.push_back(x);
        }
        return res;
    }
};
    

int main() {
    riano_; //ll ans = 0;
    ll N; cin >> N; ans = N*(N-1);
    //main関数内で
    tree tr(N+1);
    rep(i,N-1){
        ll a,b,c; cin >> a >> b >> c;
        tr.unite(a,b,c);
    }
    tr.dfs(1);
    for(auto[x,c]:top_cc){
        ans -= (c-1)*top_ss[x];
    }
    cout << ans << endl;
}
0