結果

問題 No.3079 Unite Japanese Prefectures
ユーザー hint908
提出日時 2025-03-28 22:53:23
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 198 ms / 4,000 ms
コード長 4,470 bytes
コンパイル時間 4,901 ms
コンパイル使用メモリ 326,144 KB
実行使用メモリ 16,896 KB
最終ジャッジ日時 2025-03-28 22:53:30
合計ジャッジ時間 7,514 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 27
権限があれば一括ダウンロードができます

ソースコード

diff #

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")


#include<bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template<class T> using V = vector<T>;
template<class T> using VV = V<V<T>>;
template<class T> using VVV = V<VV<T>>;
template<class T> using VVVV = VV<VV<T>>;
#define rep(i,n) for(ll i=0ll;(i)<(n);(i)++)
#define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++)
#define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--)
#define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--)
const long long INF = (1LL << 60);
const long long mod99 = 998244353;
const long long mod107 = 1000000007;
const long long mod = mod99;
#define eb emplace_back
#define be(v) (v).begin(),(v).end()
#define all(v) (v).begin(),(v).end()
#define foa(i,v) for(auto& (i) : (v))
#define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end())
#define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end())
#define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end())
#define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end())
#define LB(x,v) (lower_bound(be(v),(x))-(v).begin())
#define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin())
#define UB(x,v) (upper_bound(be(v),(x))-(v).begin())
#define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin())
#define dout()  cout << fixed << setprecision(20)
#define randinit() srand((unsigned)time(NULL))

template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; }
template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; }


ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;}

struct UnionFind {
    vector<long long> par; 
    long long gn;
    UnionFind(long long N) : par(N, -1), gn(N){ }

    long long root(long long x) { 
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    long long size(long long x) {
        return -par[root(x)];
    }
  
    bool merge(long long x, long long y) { 
        long long rx = root(x), ry = root(y); 
        if (rx == ry) return 0; 
        gn --;
        if (par[rx] < par[ry]) swap(rx, ry);
        par[ry] += par[rx];
        par[rx] = ry; 
        return 1;
    }

    bool same(long long x, long long y) {
        return root(x) == root(y);
    }
};

#include<atcoder/modint>
using namespace atcoder;
using mint = modint998244353;

void solve(){
    ll n,m;
    cin >> n >> m;
    V<tuple<ll,ll,ll>> e;
    rep(i, m){
        ll u,v,c;
        cin >> u >> v >> c;
        u--;
        v--;
        c--;
        e.eb(c, u, v);
    }
    sort(be(e));
    UnionFind uf(n);
    V<ll> a(6, 0);
    for(auto [c,u,v]:e) if(uf.merge(u, v)) a[c]++;
    
    vector dp(a[0]+1, vector(a[1]+1, vector(a[2]+1, vector(a[3]+1, vector(a[4]+1, vector<ld>(a[5]+1, 0))))));
    vector mp(a[0]+1, vector(a[1]+1, vector(a[2]+1, vector(a[3]+1, vector(a[4]+1, vector<bool>(a[5]+1, 0))))));
    mp[0][0][0][0][0][0] = 1;
    
    ld x = 1.0 / 6.0;
    auto dfs = [&](auto&&dfs, ll a, ll b, ll c, ll d, ll e, ll f) -> ld {
        if(mp[a][b][c][d][e][f]) return dp[a][b][c][d][e][f];
        // cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
        ll y = 1;
        if(f){
            dp[a][b][c][d][e][f] += dfs(dfs, a, b, c, d, e, f-1) * y;
            y = 0;
        }
        y++;
        if(e){
            dp[a][b][c][d][e][f] += dfs(dfs, a, b, c, d, e-1, f) * y;
            y = 0;
        }
        y++;
        if(d){
            dp[a][b][c][d][e][f] += dfs(dfs, a, b, c, d-1, e, f) * y;
            y = 0;
        }
        y++;
        if(c){
            dp[a][b][c][d][e][f] += dfs(dfs, a, b, c-1, d, e, f) * y;
            y = 0;
        }
        y++;
        if(b){
            dp[a][b][c][d][e][f] += dfs(dfs, a, b-1, c, d, e, f) * y;
            y = 0;
        }
        y++;
        if(a){
            dp[a][b][c][d][e][f] += dfs(dfs, a-1, b, c, d, e, f) * y;
            y = 0;
        }
        dp[a][b][c][d][e][f] /= (6-y);
        dp[a][b][c][d][e][f] += ld(6) / (6-y);
        
        mp[a][b][c][d][e][f] = 1;
        return dp[a][b][c][d][e][f];
        
    };
    dout();
    cout << dfs(dfs, a[0], a[1], a[2], a[3], a[4], a[5]) << endl;
    
    
    
}





int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t=1;
    // cin >> t;
    rep(i,t) solve();
}
0