結果

問題 No.2674 k-Walk on Bipartite
ユーザー tobisatistobisatis
提出日時 2024-03-15 22:40:46
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 4,102 bytes
コンパイル時間 13,186 ms
コンパイル使用メモリ 168,128 KB
実行使用メモリ 194,320 KB
最終ジャッジ日時 2024-09-30 02:08:44
合計ジャッジ時間 18,380 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
30,464 KB
testcase_01 AC 53 ms
30,456 KB
testcase_02 AC 54 ms
30,336 KB
testcase_03 AC 51 ms
30,592 KB
testcase_04 AC 52 ms
30,568 KB
testcase_05 AC 52 ms
30,720 KB
testcase_06 AC 55 ms
30,592 KB
testcase_07 AC 153 ms
64,156 KB
testcase_08 AC 169 ms
66,260 KB
testcase_09 AC 142 ms
62,040 KB
testcase_10 AC 186 ms
67,200 KB
testcase_11 AC 152 ms
63,156 KB
testcase_12 AC 180 ms
66,432 KB
testcase_13 AC 136 ms
60,788 KB
testcase_14 AC 96 ms
47,908 KB
testcase_15 AC 205 ms
67,712 KB
testcase_16 AC 221 ms
63,888 KB
testcase_17 AC 180 ms
67,004 KB
testcase_18 AC 119 ms
53,820 KB
testcase_19 AC 160 ms
61,772 KB
testcase_20 AC 151 ms
62,612 KB
testcase_21 AC 180 ms
66,236 KB
testcase_22 AC 216 ms
68,208 KB
testcase_23 AC 58 ms
30,592 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 51 ms
30,592 KB
testcase_27 AC 51 ms
30,588 KB
testcase_28 AC 51 ms
30,592 KB
testcase_29 AC 51 ms
30,572 KB
testcase_30 AC 51 ms
30,336 KB
testcase_31 AC 54 ms
30,336 KB
testcase_32 AC 53 ms
30,592 KB
testcase_33 AC 54 ms
30,464 KB
testcase_34 AC 53 ms
30,720 KB
testcase_35 AC 53 ms
30,336 KB
testcase_36 AC 54 ms
30,720 KB
testcase_37 AC 52 ms
30,568 KB
testcase_38 AC 53 ms
194,320 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (84 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

namespace AtCoder;

#nullable enable

using System.Numerics;

static class Extensions
{
    public static T[] Repeat<T>(this int time, Func<T> F) => Enumerable.Range(0, time).Select(_ => F()).ToArray();
}

class Graph<T>
{
    public struct Edge
    {
        public int Ab { get; set; }
        public int Ad { get; set; }
        public T Distance { get; set; }
    }

    public int N { get; private init; }
    public bool Directed { get; private init; }
    public List<List<(int next, int edgeIndex)>> AdjacencyList { get; private init; }
    public List<Edge> Edges { get; private init; }

    public Graph(int verticals, IReadOnlyList<Edge> edges, bool directed)
    {
        N = verticals;
        Directed = directed;
        AdjacencyList = new List<List<(int, int)>>();
        for (var i = 0; i < N; i++) AdjacencyList.Add(new List<(int, int)>());
        Edges = new List<Edge>();
        for (var i = 0; i < edges.Count; i++)
        {
            var edge = edges[i];
            Edges.Add(edge);
            AdjacencyList[edge.Ab].Add((edge.Ad, i));
            if (!Directed) AdjacencyList[edge.Ad].Add((edge.Ab, i));
        }
    }
}

class GraphBuilder
{
    public static Graph<int> SimpleGraph(int verticals, (int ab, int ad)[] edges, bool directed)
    {
        var e = edges.Select(e => new Graph<int>.Edge { Ab = e.ab, Ad = e.ad, Distance = 1 }).ToList();
        return new(verticals, e, directed);
    }

    public static Graph<T> Graph<T>(int verticals, (int ab, int ad, T edge)[] edges, bool directed)
    {
        var e = edges.Select(e => new Graph<T>.Edge { Ab = e.ab, Ad = e.ad, Distance = e.edge }).ToList();
        return new(verticals, e, directed);
    }
}

class AtCoder
{
    object? Solve()
    {
        var n = Int();
        var m = Int();
        var s = Int() - 1;
        var t = Int() - 1;
        var k = Int();
        var edges = m.Repeat(() => (Int() - 1, Int() - 1));
        var g = GraphBuilder.SimpleGraph(n, edges, false).AdjacencyList;
        var max = int.MaxValue / 2;
        var dz = n.Repeat(() => max);
        dz[s] = 0;
        var q = new Queue<int>();
        q.Enqueue(s);
        while (q.Count > 0)
        {
            var v = q.Dequeue();
            var w = dz[v] + 1;
            foreach (var (next, _) in g[v])
            {
                if (dz[next] <= w) continue;
                dz[next] = w;
                q.Enqueue(next);
            }
        }
        var unknown = "Unknown";
        if (dz[t] < max)
        {
            if (k % 2 != dz[t] % 2) return false;
            if (s == t && n == 1) return false;
            if (dz[t] <= k) return true;
            return unknown;
        }
        if (k % 2 == 1) return unknown;
        if (dz.Where(e => e < max && e % 2 == 1).Any()) return unknown;
        if (dz.Where(e => e == max).Count() >= 2) return unknown;
        return false;
    }

    public static void Main() => new AtCoder().Run();
    public void Run()
    {
        var res = Solve();
        if (res != null)
        {
            if (res is bool yes) res = yes ? "Yes" : "No";
            sw.WriteLine(res);
        }
        sw.Flush();
    }

    string[] input = Array.Empty<string>();
    int iter = 0;
    readonly StreamWriter sw = new(Console.OpenStandardOutput()) { AutoFlush = false };

    #pragma warning disable IDE0051
    string String()
    {
        while (iter >= input.Length) (input, iter) = (Console.ReadLine()!.Split(' '), 0);
        return input[iter++];
    }
    T Input<T>() where T : IParsable<T> => T.Parse(String(), null);
    int Int() => Input<int>();
    void Out(object? x, string? separator = null)
    {
        separator ??= Environment.NewLine;
        if (x is System.Collections.IEnumerable obj and not string)
        {
            var firstLine = true;
            foreach (var item in obj)
            {
                if (!firstLine) sw.Write(separator);
                firstLine = false;
                sw.Write(item);
            }
        }
        else sw.Write(x);
        sw.WriteLine();
    }
    #pragma warning restore IDE0051
}
0