提出 #66333081

---

ソースコード 拡げる

// Author: Andimeo
// Date: 2025-5-31 19:56:29

#include<bits/stdc++.h>
using namespace std;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define int long long
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define pb push_back
#define tc int tt, qq = 0; cin >> tt; while(qq++ < tt)
#define cs cout << "Case " << qq << ": "
#define speed ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using hash_t = uint64_t;

class DSU {
    private:
    vector<int> parent, rank, sz;
    int n;
    public:
    DSU(int n) : parent(n), rank(n, 0), n(n), sz(n) {
        for (int i = 0; i < n; i++) parent[i] = i, sz[i] = 1;
    }

    int find(int x) {
        if (x != parent[x]) parent[x] = find(parent[x]);
        return parent[x];
    }

    void merge(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return;
        if (rank[x] > rank[y]) parent[y] = x, sz[x] += sz[y];
        else if (rank[x] < rank[y]) parent[x] = y, sz[y] += sz[x];
        else parent[y] = x, rank[x] += 1, sz[x] += sz[y];
    }

    int size(int x) {
        return sz[find(x)];
    }
};

void solve() {
    int n, m; cin >> n >> m;
    vector<vector<array<int, 2>>> adj(n);
    for (int i = 0; i < m; i++) {
        int u, v, w; cin >> u >> v >> w; u--; v--;
        adj[u].pb({v, w}); adj[v].pb({u, w});
    }
    int ans = (1 << 30) - 1;
    for (int b = 29; b >= 0; b--) {
        int mask = ans ^ (1 << b);
        DSU dsu(n);
        for (int u = 0; u < n; u++) {
            for (auto [v, w] : adj[u]) {
                if (!((~mask) & w)) {
                    dsu.merge(u, v);
                }
            }
        }
        if (dsu.find(0) == dsu.find(n-1)) {
            ans = mask;
        }
    }
    cout << ans << endl;
}

signed main() {
    speed
    //tc {
        solve();
    //}
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp:51:41: warning: field 'n' will be initialized after field 'sz' [-Wreorder-ctor]
    DSU(int n) : parent(n), rank(n, 0), n(n), sz(n) {
                                        ^~~~  ~~~~~
                                        sz(n) n(n)
./Main.cpp:49:9: warning: private field 'n' is not used [-Wunused-private-field]
    int n;
        ^
2 warnings generated.

ジャッジ結果