結果

問題 No.1190 Points
ユーザー りあんりあん
提出日時 2020-08-22 15:38:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 540 ms / 2,000 ms
コード長 8,063 bytes
コンパイル時間 4,215 ms
コンパイル使用メモリ 116,052 KB
実行使用メモリ 51,444 KB
最終ジャッジ日時 2023-08-05 12:45:10
合計ジャッジ時間 15,137 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 64 ms
23,604 KB
testcase_01 AC 63 ms
23,624 KB
testcase_02 AC 62 ms
21,628 KB
testcase_03 AC 328 ms
44,312 KB
testcase_04 AC 282 ms
40,752 KB
testcase_05 AC 270 ms
41,300 KB
testcase_06 AC 413 ms
45,292 KB
testcase_07 AC 457 ms
48,976 KB
testcase_08 AC 425 ms
51,444 KB
testcase_09 AC 423 ms
47,828 KB
testcase_10 AC 439 ms
51,408 KB
testcase_11 AC 314 ms
45,688 KB
testcase_12 AC 448 ms
51,116 KB
testcase_13 AC 302 ms
41,512 KB
testcase_14 AC 124 ms
35,800 KB
testcase_15 AC 505 ms
51,200 KB
testcase_16 AC 102 ms
33,924 KB
testcase_17 AC 501 ms
50,416 KB
testcase_18 AC 220 ms
35,320 KB
testcase_19 AC 119 ms
39,516 KB
testcase_20 AC 275 ms
37,736 KB
testcase_21 AC 159 ms
37,640 KB
testcase_22 AC 192 ms
45,168 KB
testcase_23 AC 532 ms
49,780 KB
testcase_24 AC 540 ms
49,964 KB
testcase_25 AC 430 ms
50,252 KB
testcase_26 AC 295 ms
45,656 KB
testcase_27 AC 418 ms
48,360 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    int[] dist(List<int>[] edge, int s) {
        int n = edge.Length;
        var dist = new int[n];
        for (int i = 0; i < n; i++)
        {
            dist[i] = M;
        }
        var q = new Queue<int>();
        dist[s] = 0;
        q.Enqueue(s);
        while (q.Any()) {
            int p = q.Dequeue();
            foreach (var item in edge[p])
            {
                if (dist[item] > dist[p] + 1) {
                    dist[item] = dist[p] + 1;
                    q.Enqueue(item);
                }
            }
        }
        return dist;
    }

    public void solve() {
        int n, m, p, s, t;
        sc.Multi(out n, out m, out p);
        sc.Multi(out s, out t);
        --s;
        --t;
        var edge = new List<int>[n * 2];
        for (int i = 0; i < n * 2; i++)
        {
            edge[i] = new List<int>();
        }
        for (int i = 0; i < m; i++)
        {
            int u, v;
            sc.Multi(out u, out v);
            --u;
            --v;
            edge[u * 2].Add(v * 2 + 1);
            edge[u * 2 + 1].Add(v * 2);
            edge[v * 2].Add(u * 2 + 1);
            edge[v * 2 + 1].Add(u * 2);
        }
        var ds0 = dist(edge, s * 2);
        var ds1 = dist(edge, s * 2 + 1);
        var dt0 = dist(edge, t * 2);
        var dt1 = dist(edge, t * 2 + 1);
        var lis = new List<int>();
        for (int i = 0; i < n; i++)
        {
            if (p % 2 == 0) {
                if (ds0[i * 2] + dt0[i * 2] <= p || ds0[i * 2 + 1] + dt0[i * 2 + 1] <= p || ds1[i * 2] + dt1[i * 2] <= p || ds1[i * 2 + 1] + dt1[i * 2 + 1] <= p) {
                    lis.Add(i + 1);
                }
            }
            else {
                if (ds0[i * 2] + dt1[i * 2] <= p || ds0[i * 2 + 1] + dt1[i * 2 + 1] <= p || ds1[i * 2] + dt0[i * 2] <= p || ds1[i * 2 + 1] + dt0[i * 2 + 1] <= p) {
                    lis.Add(i + 1);
                }
            }
        }
        if (lis.Count == 0) {
            Prt(-1);
            return;
        }
        Prt(lis.Count);
        foreach (var item in lis)
        {
            Prt(item);
        }
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}
0