結果
| 問題 | No.92 逃走経路 |
| ユーザー |
 eSeF
|
| 提出日時 | 2020-04-22 16:24:00 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
AC
|
| 実行時間 | 67 ms / 5,000 ms |
| コード長 | 7,303 bytes |
| コンパイル時間 | 1,137 ms |
| コンパイル使用メモリ | 118,596 KB |
| 実行使用メモリ | 20,480 KB |
| 最終ジャッジ日時 | 2024-10-11 19:53:00 |
| 合計ジャッジ時間 | 2,973 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 18 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;using System.Collections.Generic;using System.Linq;using System.IO;using System.Text;using System.Numerics;using static System.Math;using static System.Array;using static AtCoder.IO_ShortCut;using static AtCoder.Tool;using static AtCoder.ModInt;namespace AtCoder{class AC{const int MOD = 1000000007;//const int MOD = 998244353;const int INF = int.MaxValue / 2;const long SINF = long.MaxValue / 2;const double EPS = 1e-8;static readonly int[] dI = { 0, 1, 0, -1, 1, -1, -1, 1 };static readonly int[] dJ = { 1, 0, -1, 0, 1, 1, -1, -1 };static List<List<int>> G = new List<List<int>>();//static List<List<Edge>> G = new List<List<Edge>>();//static List<Edge> E = new List<Edge>();static void Main(string[] args){var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };Console.SetOut(sw);Solve();Console.Out.Flush();}static void Solve(){Input(out int N, out int M, out int K);var E = new List<(int, int, int)>();for (var i = 0; i < N; i++) G.Add(new List<int>());for(var i = 0; i < M; i++){Input(out int a, out int b, out int c);a--;b--;G[a].Add(b);G[b].Add(a);E.Add((a, b, c));}var d = _ReadSplitInt;var dp = new bool[K + 1, N];for (var i = 0; i <= K; i++) for (var j = 0; j < N; j++) dp[i, j] = i == 0;for(var i = 0; i < K; i++){for(var j = 0; j < M; j++){if (E[j].Item3 != d[i]) continue;int a = E[j].Item1;int b = E[j].Item2;dp[i + 1, a] |= dp[i, b];dp[i + 1, b] |= dp[i, a];}}var ans = new List<int>();for (var i = 0; i < N; i++) if (dp[K, i]) ans.Add(i + 1);OutL(ans.Count());Out_Sep(ans);}struct Edge{public int from;public int to;public long dist;public Edge(int t, long c){from = -1;to = t;dist = c;}public Edge(int f, int t, long c){from = f;to = t;dist = c;}}}struct ModInt{public long value;private const int MOD = 1000000007;//private const int MOD = 998244353;public ModInt(long value) { this.value = value; }public static implicit operator ModInt(long a){var ret = a % MOD;return new ModInt(ret < 0 ? (ret + MOD) : ret);}public static ModInt operator +(ModInt a, ModInt b) => (a.value + b.value);public static ModInt operator -(ModInt a, ModInt b) => (a.value - b.value);public static ModInt operator *(ModInt a, ModInt b) => (a.value * b.value);public static ModInt operator /(ModInt a, ModInt b) => a * Modpow(b, MOD - 2);public static ModInt operator <<(ModInt a, int n) => (a.value << n);public static ModInt operator >>(ModInt a, int n) => (a.value >> n);public static ModInt operator ++(ModInt a) => a.value + 1;public static ModInt operator --(ModInt a) => a.value - 1;public static ModInt Modpow(ModInt a, long n){var k = a;ModInt ret = 1;while (n > 0){if ((n & 1) != 0) ret *= k;k *= k;n >>= 1;}return ret;}private static readonly List<long> Factorials = new List<long>() { 1 };public static ModInt Fac(long n){for (var i = Factorials.Count(); i <= n; i++){Factorials.Add((Factorials[i - 1] * i) % MOD);}return Factorials[(int)n];}public static ModInt nCr(long n, long r){return n < r ? 0 : Fac(n) / (Fac(r) * Fac(n - r));}public static explicit operator int(ModInt a) => (int)a.value;}static class IO_ShortCut{public static string[] _ReadSplit => Console.ReadLine().Split();public static int[] _ReadSplitInt => ConvertAll(Console.ReadLine().Split(), int.Parse);public static long[] _ReadSplitLong => ConvertAll(Console.ReadLine().Split(), long.Parse);public static double[] _ReadSplit_Double => ConvertAll(Console.ReadLine().Split(), double.Parse);public static string Str => Console.ReadLine();public static int Int => int.Parse(Console.ReadLine());public static long Long => long.Parse(Console.ReadLine());public static double Double => double.Parse(Console.ReadLine());public static T Conv<T>(string input){if (typeof(T).Equals(typeof(ModInt))){return (T)(dynamic)(long.Parse(input));}return (T)Convert.ChangeType(input, typeof(T));}public static void Input<T>(out T a) => a = Conv<T>(Console.ReadLine());public static void Input<T, U>(out T a, out U b){ var q = _ReadSplit;a = Conv<T>(q[0]);b = Conv<U>(q[1]); }public static void Input<T, U, V>(out T a, out U b, out V c){ var q = _ReadSplit;a = Conv<T>(q[0]);b = Conv<U>(q[1]);c = Conv<V>(q[2]); }public static void Input<T, U, V, W>(out T a, out U b, out V c, out W d){ var q = _ReadSplit; a = Conv<T>(q[0]); b = Conv<U>(q[1]); c = Conv<V>(q[2]);d = Conv<W>(q[3]); }public static void OutL(object s) => Console.WriteLine(s);public static void Out_Sep<T>(IEnumerable<T> s) => Console.WriteLine(string.Join(" ", s));public static void Out_Sep<T>(IEnumerable<T> s, string sep) => Console.WriteLine(string.Join($"{sep}", s));public static void Out_Sep(params object[] s) => Console.WriteLine(string.Join(" ", s));public static void Out_One(object s) => Console.Write($"{s} ");public static void Out_One(object s, string sep) => Console.Write($"{s}{sep}");public static void Endl() => Console.WriteLine();}public static class Tool{static public void Initialize<T>(ref T[] array, T initialvalue){array = ConvertAll(array, x => initialvalue);}static public void Swap<T>(ref T a, ref T b){T keep = a;a = b;b = keep;}static public void Display<T>(T[,] array2d, int n, int m){for (var i = 0; i < n; i++){for (var j = 0; j < m; j++){Console.Write($"{array2d[i, j]} ");}Console.WriteLine();}}static public long LPow(int a, int b) => (long)Pow(a, b);static public bool Bit(long x, int dig) => ((1L << dig) & x) != 0;}}