#1153950 (C++17) No.3482 Quod Erat Demonstrandum

• 問題: No.3482 Quod Erat Demonstrandum
• ユーザー: tombo_
• 提出日時: 2026-03-27 21:35:12
• 言語: C++17 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 154 ms / 2,000 ms
• コード長: 3,610 bytes
• コンパイル時間: 1,340 ms
• コンパイル使用メモリ: 119,252 KB
• 実行使用メモリ: 21,288 KB
• 最終ジャッジ日時: 2026-03-27 21:35:33
• 合計ジャッジ時間: 8,301 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_0

ファイルパターン	結果
sample	AC * 1
other	AC * 45

ソースコード

#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<math.h>
using namespace std;

#define OVERLOAD_REP(_1, _2, _3, name, ...) name
#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))
#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))
#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)
#define REP(i, l, r) rep(i, l, r + 1)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

using ll = long long;
using ld = long double;

struct Edge {
    int to;
    ll w;
};

using Graph = vector<vector<int>>;
// using Graph = vector<vector<Edge> >;
const ll INF = 2e18;
// const int INF = 2e9;

template <class T> using vc = vector<T>;
template <class T> using vv = vector<vector<T>>;
template <class T> using vvv = vector<vector<vector<T>>>;
template <class T> using pq = priority_queue<T>;
template <class T> using pq_g = priority_queue<T, vc<T>, greater<T>>;

template <class T> istream &operator>>(istream &i, vc<T> &v) {
    rep(j, 0, v.size()) i >> v[j];
    return i;
}
template <class T> ostream &operator<<(ostream &o, vc<T> &v) {
    rep(j, 0, v.size()) o << v[j] << " ";
    return o;
}

template <class T> bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

constexpr double EPS = 1e-9;
inline bool eq(double a, double b) { return fabs(a - b) < EPS; }
inline bool lt(double a, double b) { return a < b - EPS; }
inline bool gt(double a, double b) { return a > b + EPS; }
inline int sgn(double x) {
    if (x > EPS) return 1;
    if (x < -EPS) return -1;
    return 0;
}
struct UnionFind {
    std::vector<int> par, siz;

    UnionFind(int n) : par(n, -1), siz(n, 1) {}

    int root(int n) {
        if(par[n] == -1) return n;
        else return par[n] = root(par[n]);
    }

    bool issame(int a, int b) {
        return root(a) == root(b);
    }

    bool unite(int a, int b) {
        a = root(a); b = root(b);
        if(a == b) return false;
        if(siz[a] < siz[b]) swap(a, b);
        par[b] = a;
        siz[a] += siz[b];
        return true;
    }

    int size(int a) {
        return siz[root(a)];
    }
};
int T,N,M,A[2<<17],B[2<<17],C[2<<17];
vc<int>G[2<<17];
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(10);

    cin>>T;
    while(T--){
        cin>>N>>M;
        rep(i,0,M)cin>>A[i]>>B[i]>>C[i],A[i]--,B[i]--;
        rep(i,0,N)G[i].clear();
        rep(i,0,M){
            if(C[i]==1)G[A[i]].push_back(B[i]),G[B[i]].push_back(A[i]);
        }
        auto f=[&](int s)->vc<int>{
            vc<int>res(N,-1);
            queue<int>q;
            res[s]=0,q.push(s);
            while(!q.empty()){
                int v=q.front();q.pop();
                for(int u:G[v]){
                    if(res[u]!=-1)continue;
                    res[u]=res[v]+1;
                    q.push(u);
                }
            }
            return res;
        };
        vc<int>d1=f(0),d2=f(N-1);
        if(d1[N-1]!=-1){
            cout<<"Same"<<endl<<d1[N-1]<<endl;
            continue;
        }
        int res=1e9;
        rep(i,0,M){
            if(C[i]==2){
                if(d1[A[i]]!=-1&&d2[B[i]]!=-1)chmin(res,d1[A[i]]+d2[B[i]]+1);
                if(d1[B[i]]!=-1&&d2[A[i]]!=-1)chmin(res,d1[B[i]]+d2[A[i]]+1);
            }
        }
        if(res==1e9)cout<<"Unknown"<<endl;
        else cout<<"Different"<<endl<<res<<endl;
    }
    return 0;
}