#1154353 (C#) No.3482 Quod Erat Demonstrandum

• 問題: No.3482 Quod Erat Demonstrandum
• ユーザー: kakel-san
• 提出日時: 2026-03-27 23:15:05
• 言語: C# (.NET 10.0.102)
• 結果: WA
• 実行時間: -
• コード長: 4,994 bytes
• コンパイル時間: 7,839 ms
• コンパイル使用メモリ: 171,580 KB
• 実行使用メモリ: 243,968 KB
• 最終ジャッジ日時: 2026-03-27 23:15:25
• 合計ジャッジ時間: 19,807 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge1_0

ファイルパターン	結果
sample	AC * 1
other	AC * 36 WA * 9

コンパイルメッセージ

  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (89 ミリ秒)。
  main -> /home/judge/data/code/bin/Release/net10.0/main.dll
  main -> /home/judge/data/code/bin/Release/net10.0/publish/

ソースコード

using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
using System.Security.Cryptography;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new List<string>();
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            var (n, m) = (c[0], c[1]);
            var map = NArr(m);
            var (res, num) = Quod(n, m, map);
            ans.Add(res);
            if (res != "Unknown") ans.Add(num.ToString());
        }
        WriteLine(string.Join("\n", ans));
    }
    static (string ans, int num) Quod(int n, int m, int[][] map)
    {
        var uf = new UnionFindTree(n + 1);
        foreach (var edge in map) if (edge[2] == 1)
        {
            uf.Unite(edge[0], edge[1]);
        }
        var INF = int.MaxValue / 2;
        var len = new int[n + 1];
        for (var i = 2; i < len.Length; ++i) len[i] = INF;
        if (uf.IsSameTree(1, n))
        {
            var tree = new List<int>[n + 1];
            for (var i = 0; i < tree.Length; ++i) tree[i] = new List<int>();
            foreach (var edge in map) if (edge[2] == 1)
            {
                tree[edge[0]].Add(edge[1]);
                tree[edge[1]].Add(edge[0]);
            }
            var q = new Queue<int>();
            q.Enqueue(1);
            while (q.Count > 0)
            {
                var cur = q.Dequeue();
                foreach (var next in tree[cur])
                {
                    if (len[next] <= len[cur] + 1) continue;
                    len[next] = len[cur] + 1;
                    q.Enqueue(next);
                }
            }
            return ("Same", len[n]);
        }
        else
        {
            var tree = new List<(int to, int kind)>[n + 1];
            for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, int kind)>();
            foreach (var edge in map)
            {
                tree[edge[0]].Add((edge[1], edge[2]));
                tree[edge[1]].Add((edge[0], edge[2]));
            }
            var len2 = new int[n + 1];
            for (var i = 0; i < len2.Length; ++i) len2[i] = INF;
            var q = new Queue<(int id, int kind)>();
            q.Enqueue((1, 1));
            while (q.Count > 0)
            {
                var cur = q.Dequeue();
                foreach (var next in tree[cur.id])
                {
                    if (next.kind == 1)
                    {
                        if (cur.kind == 1)
                        {
                            if (len[next.to] <= len[cur.id] + 1) continue;
                            len[next.to] = len[cur.id] + 1;
                            q.Enqueue((next.to, next.kind));
                        }
                        else
                        {
                            if (len2[next.to] <= len2[cur.id] + 1) continue;
                            len2[next.to] = len2[cur.id] + 1;
                            q.Enqueue((next.to, next.kind));
                        }
                    }
                    else if (cur.kind == 1)
                    {
                        if (len2[next.to] <= len[cur.id] + 1) continue;
                        len2[next.to] = len[cur.id] + 1;
                        q.Enqueue((next.to, next.kind));
                    }
                }
            }
            return (len2[n] == INF ? "Unknown" : "Different", len2[n]);
        }
    }
    static void DFS(int cur, List<int>[] tree, int[] len)
    {
        foreach (var next in tree[cur])
        {
            if (len[next] <= len[cur] + 1) continue;
            len[next] = len[cur] + 1;
            DFS(next, tree, len);
        }
    }
    class UnionFindTree
    {
        int[] roots;
        public UnionFindTree(int size)
        {
            roots = new int[size];
            for (var i = 0; i < size; ++i) roots[i] = -1;
        }
        public int GetRoot(int a)
        {
            if (roots[a] < 0) return a;
            return roots[a] = GetRoot(roots[a]);
        }
        public bool IsSameTree(int a, int b)
        {
            return GetRoot(a) == GetRoot(b);
        }
        public bool Unite(int a, int b)
        {
            var x = GetRoot(a);
            var y = GetRoot(b);
            if (x == y) return false;
            if (-roots[x] < -roots[y]) { var tmp = x; x = y; y = tmp; }
            roots[x] += roots[y];
            roots[y] = x;
            return true;
        }
        public int GetSize(int a)
        {
            return -roots[GetRoot(a)];
        }
    }
}