#18086 (C#(csc)) No.92 逃走経路

• 問題: No.92 逃走経路
• ユーザー: femto
• 提出日時: 2015-04-03 19:09:32
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 269 ms / 5,000 ms
• コード長: 4,739 bytes
• コンパイル時間: 986 ms
• コンパイル使用メモリ: 117,668 KB
• 実行使用メモリ: 33,232 KB
• 最終ジャッジ日時: 2024-07-04 01:40:01
• 合計ジャッジ時間: 3,733 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	88 ms; 31,300 KB
testcase_01	AC	41 ms; 26,596 KB
testcase_02	AC	41 ms; 28,784 KB
testcase_03	AC	41 ms; 26,612 KB
testcase_04	AC	41 ms; 28,656 KB
testcase_05	AC	130 ms; 27,016 KB
testcase_06	AC	70 ms; 29,184 KB
testcase_07	AC	68 ms; 24,880 KB
testcase_08	AC	47 ms; 29,016 KB
testcase_09	AC	93 ms; 33,232 KB
testcase_10	AC	269 ms; 31,328 KB
testcase_11	AC	253 ms; 31,200 KB
testcase_12	AC	187 ms; 31,200 KB
testcase_13	AC	73 ms; 31,084 KB
testcase_14	AC	79 ms; 29,316 KB
testcase_15	AC	90 ms; 31,332 KB
testcase_16	AC	80 ms; 31,088 KB
testcase_17	AC	83 ms; 31,332 KB
testcase_18	AC	78 ms; 30,892 KB
testcase_19	AC	70 ms; 33,124 KB

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Diagnostics;
using System.Collections.Generic;
using System.Linq;
using Enu = System.Linq.Enumerable;

class Solution {
    int N, M, K;
    List<edge>[] G;
    int[] d;
    void calc() {
        rio(out N, out M, out K);
        G = new List<edge>[N + 1];
        for (int i = 0; i <= N; i++) G[i] = new List<edge>();

        for (int loop = 0; loop < M; loop++) {
            var r = ria(3);
            G[r[0]].Add(new edge(r[0], r[1], r[2]));
            G[r[1]].Add(new edge(r[1], r[0], r[2]));
        }
        d = ria(K);

        HashSet<int> nowpos = new HashSet<int>();
        for (int i = 1; i <= N; i++) nowpos.Add(i);

        foreach (var cost in d) {
            HashSet<int> nextpos = new HashSet<int>();
            foreach (var p in nowpos) {
                foreach (var np in G[p].Where(e => e.cost == cost).Select(e => e.to).Distinct()) {
                    if (!nextpos.Contains(np)) nextpos.Add(np);
                }
            }
            nowpos = nextpos;
        }

        Console.WriteLine(nowpos.Count);
        Console.WriteLine(String.Join(" ", nowpos.OrderBy(e => e)));
    }
    [DebuggerDisplay("from : {from}, to : {to}, cost : {cost}")]
    private class edge {
        public int from, to;
        public int cost;
        public edge(int from, int to, int cost) {
            this.from = from; this.to = to; this.cost = cost;
        }
    }
    static void Main(string[] args) {
        new Solution().calc();
    }

    #region
    static int ri() { return int.Parse(Console.ReadLine()); }
    static int[] ria(int n) {
        if (n <= 0) { Console.ReadLine(); return new int[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(int.Parse).ToArray();
    }
    static void rio(out int p1) { p1 = ri(); }
    static void rio(out int p1, out int p2) { var r = ria(2); p1 = r[0]; p2 = r[1]; }
    static void rio(out int p1, out int p2, out int p3) { var r = ria(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rio(out int p1, out int p2, out int p3, out int p4) { var r = ria(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rio(out int p1, out int p2, out int p3, out int p4, out int p5) { var r = ria(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static long rl() { return long.Parse(Console.ReadLine()); }
    static long[] rla(int n) {
        if (n <= 0) { Console.ReadLine(); return new long[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(long.Parse).ToArray();
    }
    static void rlo(out long p1) { p1 = rl(); }
    static void rlo(out long p1, out long p2) { var r = rla(2); p1 = r[0]; p2 = r[1]; }
    static void rlo(out long p1, out long p2, out long p3) { var r = rla(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4) { var r = rla(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rlo(out long p1, out long p2, out long p3, out long p4, out long p5) { var r = rla(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static double rd() { return double.Parse(Console.ReadLine()); }
    static double[] rda(int n) {
        if (n <= 0) { Console.ReadLine(); return new double[0]; }
        else return Console.ReadLine().Trim().Split(' ').Select(double.Parse).ToArray();
    }
    static void rdo(out double p1) { p1 = rd(); }
    static void rdo(out double p1, out double p2) { var r = rda(2); p1 = r[0]; p2 = r[1]; }
    static void rdo(out double p1, out double p2, out double p3) { var r = rda(3); p1 = r[0]; p2 = r[1]; p3 = r[2]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4) { var r = rda(4); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; }
    static void rdo(out double p1, out double p2, out double p3, out double p4, out double p5) { var r = rda(5); p1 = r[0]; p2 = r[1]; p3 = r[2]; p4 = r[3]; p5 = r[4]; }
    static void swap<T>(ref T x, ref T y) { T temp = x; x = y; y = temp; }
    static void wa1<T>(T[] a) { Debug.WriteLine(string.Join(" ", a)); }
    static void wa2<T>(T[][] a) {
        foreach (var row in a) {
            Debug.WriteLine(String.Join(" ", row));
        }
    }
    [DebuggerDisplay("{x} , {y}")]
    class point {
        public int x, y;
        public point(int x, int y) {
            this.x = x; this.y = y;
        }
    }
    #endregion
}

static class Extention {
    public static T[][] ToJagArray<T>(this T[,] a) {
        int n = a.GetLength(0), m = a.GetLength(1);
        var ret = new T[n][];
        for (int i = 0; i < n; i++) {
            ret[i] = new T[m];
            for (int j = 0; j < m; j++) {
                ret[i][j] = a[i, j];
            }
        }
        return ret;
    }
}