#610566 (C++17(gcc12)) No.1442 I-wate Shortest Path Problem

• 問題: No.1442 I-wate Shortest Path Problem
• ユーザー: first_vil
• 提出日時: 2021-01-28 20:26:59
• 言語: C++17(gcc12) (gcc 12.4.0 + boost 1.89.0)
• 結果: WA
• 実行時間: -
• コード長: 4,634 bytes
• コンパイル時間: 6,403 ms
• コンパイル使用メモリ: 336,536 KB
• 実行使用メモリ: 23,180 KB
• 最終ジャッジ日時: 2026-06-17 10:26:37
• 合計ジャッジ時間: 9,113 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge2_0

ファイルパターン	結果
sample	WA * 2
other	WA * 21 RE * 4

ソースコード

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n);++i)
#define rFOR(i,a,n) for(int i=(n)-1;i>=(a);--i)
#define erFOR(i,a,n) for(int i=(n);i>=(a);--i)
#define SORT(a) sort(a.begin(),a.end())
#define rSORT(a) sort(a.rbegin(),a.rend())
#define fSORT(a,f) sort(a.begin(),a.end(),f)
#define all(a) a.begin(),a.end()
#define out(y,x) ((y)<0||h<=(y)||(x)<0||w<=(x))
#define tp(a,i) get<i>(a)
#ifdef _DEBUG
#define line cout << "-----------------------------\n"
#define stop system("pause")
#define debug(x) print(x)
#endif
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template<class T>inline bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; }return false; }
template<class T>inline bool chmin(T& a, const T& b) { if (a > b) { a = b; return true; }return false; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }
template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& a : v)is >> a; return is; }
template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }
template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }
template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }
template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }
template<class T>inline void print(const T& a) { cout << a << "\n"; }
template<class T, class... Ts>inline void print(const T& a, const Ts&... ts) { cout << a << " "; print(ts...); }
template<class T>inline void print(const vector<T>& v) { for (int i = 0; i < v.size(); ++i)cout << v[i] << (i == v.size() - 1 ? "\n" : " "); }
template<class T>inline void print(const vector<vector<T>>& v) { for (auto& a : v)print(a); }
inline string reversed(const string& s) { string t = s; reverse(all(t)); return t; }
template<class T>inline T sum(const vector<T>& a, int l, int r) { return a[r] - (l == 0 ? 0 : a[l - 1]); }
template<class T>inline void END(T s) { print(s); exit(0); }
void END() { exit(0); }

class unionfind {
    VI par, rank;
    int forest_num;
public:
    unionfind(const int& n) : par(n), rank(n, 1), forest_num(n) {
        FOR(i, 0, n)par[i] = i;
    }
    int root(int x) {
        if (par[x] == x)return x;
        return par[x] = root(par[x]);
    }
    int size(int x) {
        if (par[x] == x)return rank[x];
        return size(par[x]);
    }
    void unite(int x, int y) {
        int rx = root(x), ry = root(y);
        if (rx == ry)return;
        if (rank[rx] < rank[ry]) {
            par[rx] = ry;
            rank[ry] += rank[rx];
        }
        else {
            par[ry] = rx;
            rank[rx] += rank[ry];
        }
        --forest_num;
    }
    bool same(int x, int y) { return root(x) == root(y); }
    int fnum() { return forest_num; }
};

#include "testlib.h"
int main() {
    init();

    registerValidation();

    int n = inf.readInt(2, 100000);
    inf.readSpace();
    int k = inf.readInt(0, 5);
    inf.readEoln();

    unionfind uf(n);
    FOR(i, 0, n - 1) {
        int a = inf.readInt(1, n - 1);
        inf.readSpace();
        int b = inf.readInt(a + 1, n);
        inf.readSpace();
        int c = inf.readInt(1, 1000000000);
        inf.readEoln();

        uf.unite(--a, --b);
    }
    assert(uf.size(0) == n);

    int m_sum = 0;
    FOR(_, 0, k) {
        int m = inf.readInt(2, n);
        inf.readSpace();
        int p = inf.readInt(1, 1000000000);
        inf.readEoln();

        m_sum += m;

        set<int> s;
        FOR(i, 0, m) {
            if (i)inf.readSpace();
            int x = inf.readInt(1, n);
            s.insert(--x);
        }
        inf.readEoln();
        assert(s.size() == m);
    }
    assert(m_sum <= 100000);

    int q = inf.readInt(1, 100000);
    inf.readEoln();
    FOR(i, 0, q) {
        int u = inf.readInt(1, n - 1);
        inf.readSpace();
        int v = inf.readInt(u + 1, n);
        inf.readEoln();
    }
    inf.readEof();

    return 0;
}