結果
問題 | No.1 道のショートカット |
ユーザー | nokonoko |
提出日時 | 2015-06-28 16:51:55 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,715 bytes |
コンパイル時間 | 1,108 ms |
コンパイル使用メモリ | 108,800 KB |
実行使用メモリ | 20,480 KB |
最終ジャッジ日時 | 2024-07-08 04:08:35 |
合計ジャッジ時間 | 3,624 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 32 ms
18,944 KB |
testcase_01 | AC | 30 ms
18,944 KB |
testcase_02 | AC | 30 ms
19,328 KB |
testcase_03 | AC | 31 ms
19,200 KB |
testcase_04 | AC | 30 ms
19,200 KB |
testcase_05 | AC | 30 ms
18,944 KB |
testcase_06 | AC | 30 ms
19,328 KB |
testcase_07 | AC | 32 ms
19,328 KB |
testcase_08 | AC | 36 ms
20,352 KB |
testcase_09 | AC | 36 ms
19,968 KB |
testcase_10 | AC | 37 ms
20,096 KB |
testcase_11 | AC | 38 ms
20,224 KB |
testcase_12 | AC | 38 ms
20,480 KB |
testcase_13 | AC | 39 ms
20,480 KB |
testcase_14 | AC | 30 ms
19,200 KB |
testcase_15 | RE | - |
testcase_16 | AC | 35 ms
19,584 KB |
testcase_17 | RE | - |
testcase_18 | AC | 31 ms
19,200 KB |
testcase_19 | AC | 30 ms
19,328 KB |
testcase_20 | AC | 33 ms
19,584 KB |
testcase_21 | AC | 36 ms
19,584 KB |
testcase_22 | AC | 31 ms
19,328 KB |
testcase_23 | AC | 38 ms
20,096 KB |
testcase_24 | AC | 37 ms
20,352 KB |
testcase_25 | AC | 35 ms
19,584 KB |
testcase_26 | AC | 36 ms
19,328 KB |
testcase_27 | AC | 37 ms
20,096 KB |
testcase_28 | AC | 28 ms
19,200 KB |
testcase_29 | AC | 34 ms
20,352 KB |
testcase_30 | AC | 33 ms
19,712 KB |
testcase_31 | AC | 35 ms
19,840 KB |
testcase_32 | AC | 34 ms
19,840 KB |
testcase_33 | AC | 33 ms
20,096 KB |
testcase_34 | AC | 34 ms
20,096 KB |
testcase_35 | AC | 33 ms
20,224 KB |
testcase_36 | AC | 35 ms
20,096 KB |
testcase_37 | AC | 34 ms
19,712 KB |
testcase_38 | AC | 30 ms
19,200 KB |
testcase_39 | AC | 34 ms
19,584 KB |
testcase_40 | AC | 33 ms
19,456 KB |
testcase_41 | AC | 34 ms
19,584 KB |
testcase_42 | RE | - |
testcase_43 | RE | - |
コンパイルメッセージ
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; namespace YukiCoderNo1 { class Program { private class RoadData { public int nextTown { get; private set; } public int cost { get; private set; } public int time { get; private set; } public RoadData(int nextTown, int cost, int time) { this.nextTown = nextTown; this.cost = cost; this.time = time; } } private static Dictionary<int, List<RoadData>> roadData = new Dictionary<int, List<RoadData>>(); private static int minTime = int.MaxValue; static void Main() { int targetTown = int.Parse(Console.ReadLine()) - 1; int money = int.Parse(Console.ReadLine()); int roadCount = int.Parse(Console.ReadLine()); int[] townStart = (Console.ReadLine()).Split(' ').Select(value => int.Parse(value) - 1).ToArray(); int[] townEnd = (Console.ReadLine()).Split(' ').Select(value => int.Parse(value) - 1).ToArray(); int[] cost = (Console.ReadLine()).Split(' ').Select(value => int.Parse(value)).ToArray(); int[] time = (Console.ReadLine()).Split(' ').Select(value => int.Parse(value)).ToArray(); for (int i = 0; i < roadCount; i++) { roadData.Add(i, new List<RoadData>()); } for (int i = 0; i < roadCount; i++) { roadData[townStart[i]].Add(new RoadData(townEnd[i], cost[i], time[i])); } GetTimeList(0, targetTown, money, 0); if (minTime == int.MaxValue) { minTime = -1; } Console.WriteLine("{0}", minTime); } private static void GetTimeList(int nowTown, int targetTown, int nowMoney, int nowTime) { if (nowTown == targetTown) { if (nowTime < minTime) { minTime = nowTime; } } else { foreach (RoadData buffer in roadData[nowTown]) { if ((nowMoney - buffer.cost) >= 0) { if (nowTime < minTime) { GetTimeList(buffer.nextTown, targetTown, (nowMoney - buffer.cost), (nowTime + buffer.time)); } } } } } } }