結果
| 問題 |
No.1 道のショートカット
|
| コンテスト | |
| ユーザー |
 紙ぺーぱー
|
| 提出日時 | 2015-01-17 01:50:16 |
| 言語 | C#(csc) (csc 3.9.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,309 bytes |
| コンパイル時間 | 3,238 ms |
| コンパイル使用メモリ | 117,868 KB |
| 実行使用メモリ | 26,824 KB |
| 最終ジャッジ日時 | 2024-07-08 03:40:41 |
| 合計ジャッジ時間 | 5,820 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 4 |
| other | AC * 36 WA * 4 |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
namespace Program
{
public class Solver
{
public void Solve()
{
var n = sc.Integer();
var c = sc.Integer();
var m = sc.Integer();
var s = sc.Integer(m);
var t = sc.Integer(m);
for (int i = 0; i < m; i++)
{
s[i]--; t[i]--;
}
var cost = sc.Integer(m);
var dt = sc.Integer(m);
var G = Enumerate(n, x => new List<Trinity<int>>());
for (int i = 0; i < m; i++)
{
G[s[i]].Add(new Trinity<int>(t[i], cost[i], dt[i]));
G[t[i]].Add(new Trinity<int>(s[i], cost[i], dt[i]));
}
var dp = new long[n, c + 1];
for (int i = 0; i < n; i++)
for (int j = 0; j <= c; j++)
dp[i, j] = long.MaxValue;
dp[0, 0] = 0;
var q = new Queue<int>();
var inQ = new bool[n];
q.Enqueue(0);
while (q.Any())
{
var p = q.Dequeue();
inQ[p] = false;
for (int i = 0; i <= c; i++)
{
if (dp[p, i] == long.MaxValue) continue;
foreach (var next in G[p])
{
var to = next.I;
var u = i + next.J;
var v = dp[p, i] + next.K;
if (u > c) continue;
if (v < dp[to, u])
{
dp[to, u] = v;
if (!inQ[to])
{
q.Enqueue(to);
inQ[to] = true;
}
}
}
}
}
var min = long.MaxValue;
for (int i = 0; i <= c; i++)
min = Math.Min(min, dp[n - 1, i]);
if (min == long.MaxValue) min = -1;
IO.Printer.Out.WriteLine(min);
}
internal IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
static T[] Enumerate<T>(int n, Func<T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; }
static T[] Enumerate<T>(int n, Func<int, T> f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; }
}
}
#region Ex
namespace Program.IO
{
using System.IO;
using System.Linq;
public class Printer : StreamWriter
{
static Printer()
{
Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false };
}
public static Printer Out { get; set; }
public override IFormatProvider FormatProvider { get { return System.Globalization.CultureInfo.InvariantCulture; } }
public Printer(System.IO.Stream stream) : base(stream, new System.Text.UTF8Encoding(false, true)) { }
public void Write<T>(string format, IEnumerable<T> source) { base.Write(format, source.OfType<object>().ToArray()); }
public void WriteLine<T>(string format, IEnumerable<T> source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
}
public class StreamScanner
{
public StreamScanner(Stream stream) { str = stream; }
private readonly Stream str;
private readonly byte[] buf = new byte[1024];
private int len, ptr;
public bool isEof = false;
public bool IsEndOfStream { get { return isEof; } }
private byte read()
{
if (isEof) return 0;
if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } }
return buf[ptr++];
}
public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; }
public char[] Char(int n) { var a = new char[n]; for (int i = 0; i < n; i++) a[i] = Char(); return a; }
public string Scan()
{
var sb = new StringBuilder();
for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
sb.Append(b);
return sb.ToString();
}
public long Long()
{
if (isEof) return long.MinValue;
long ret = 0; byte b = 0; var ng = false;
do b = read();
while (b != '-' && (b < '0' || '9' < b));
if (b == '-') { ng = true; b = read(); }
for (; true; b = read())
{
if (b < '0' || '9' < b)
return ng ? -ret : ret;
else ret = ret * 10 + b - '0';
}
}
public int Integer() { return (isEof) ? int.MinValue : (int)Long(); }
public double Double() { return double.Parse(Scan(), System.Globalization.CultureInfo.InvariantCulture); }
private T[] enumerate<T>(int n, Func<T> f)
{
var a = new T[n];
for (int i = 0; i < n; ++i) a[i] = f();
return a;
}
public string[] Scan(int n) { return enumerate(n, Scan); }
public double[] Double(int n) { return enumerate(n, Double); }
public int[] Integer(int n) { return enumerate(n, Integer); }
public long[] Long(int n) { return enumerate(n, Long); }
public void Flush() { str.Flush(); }
}
}
static class Ex
{
static public string AsString(this IEnumerable<char> ie) { return new string(System.Linq.Enumerable.ToArray(ie)); }
static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
static public void Main()
{
var solver = new Program.Solver();
solver.Solve();
Program.IO.Printer.Out.Flush();
}
}
#endregion
#region Trinity<T>
public struct Trinity<T>
{
public T I, J, K;
public Trinity(T i, T j, T k) : this() { I = i; J = j; K = k; }
public Trinity(params T[] arg) : this(arg[0], arg[1], arg[2]) { }
public override string ToString() { return string.Format("{0} {1} {2}", I, J, K); }
}
#endregion