#139507 (C#(csc)) No.468 役に立つ競技プログラミング実践編

提出ソース

結果

問題	No.468 役に立つ競技プログラミング実践編
ユーザー	紙ぺーぱー
提出日時	2016-12-18 00:15:47
言語	C#(csc) (csc 3.9.0)
結果	TLE
実行時間	-
コード長	7,565 bytes
コンパイル時間	1,099 ms
コンパイル使用メモリ	112,768 KB
実行使用メモリ	63,352 KB
最終ジャッジ日時	2024-05-08 04:19:53
合計ジャッジ時間	6,987 ms
ジャッジサーバーID （参考情報）	judge5 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	26 ms 23,168 KB
testcase_01	AC	26 ms 18,048 KB
testcase_02	AC	26 ms 17,920 KB
testcase_03	AC	27 ms 18,176 KB
testcase_04	AC	26 ms 18,048 KB
testcase_05	AC	26 ms 18,176 KB
testcase_06	AC	27 ms 18,176 KB
testcase_07	AC	27 ms 18,048 KB
testcase_08	AC	27 ms 17,920 KB
testcase_09	AC	27 ms 18,048 KB
testcase_10	AC	28 ms 18,176 KB
testcase_11	AC	27 ms 17,920 KB
testcase_12	AC	26 ms 18,176 KB
testcase_13	AC	28 ms 18,048 KB
testcase_14	AC	119 ms 18,140 KB
testcase_15	AC	128 ms 17,888 KB
testcase_16	AC	136 ms 18,400 KB
testcase_17	AC	130 ms 18,396 KB
testcase_18	AC	130 ms 18,400 KB
testcase_19	AC	130 ms 18,020 KB
testcase_20	AC	129 ms 18,284 KB
testcase_21	AC	123 ms 18,272 KB
testcase_22	AC	118 ms 18,144 KB
testcase_23	AC	124 ms 18,272 KB
testcase_24	TLE	-
testcase_25	--	-
testcase_26	--	-
testcase_27	--	-
testcase_28	--	-
testcase_29	--	-
testcase_30	--	-
testcase_31	--	-
testcase_32	--	-
testcase_33	--	-
testcase_34	--	-
testcase_35	--	-
testcase_36	--	-

権限があれば一括ダウンロードができます

コンパイルメッセージ

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

ソースコード

raw source code

using System;
using System.Linq;
using System.Linq.Expressions;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using StringBuilder = System.Text.StringBuilder;
using System.Numerics;
using Number = System.Int64;
namespace Program
{
    public class Solver
    {
        public void Solve()
        {

            var n = sc.Integer();
            var m = sc.Integer();
            var G = Enumerate(2, _ => Enumerate(n, x => new List<KeyValuePair<int, long>>()));
            for (int i = 0; i < m; i++)
            {
                var f = sc.Integer();
                var t = sc.Integer();
                var c = sc.Integer();
                G[0][f].Add(new KeyValuePair<int, Number>(t, c));
                G[1][t].Add(new KeyValuePair<int, Number>(f, c));
            }
            var d = Enumerate(2, x => Enumerate(n, y => -1000000000L));
            d[0][0] = d[1][n - 1] = 0;
            var cnt = 0;
           
            for (int _ = 0; _ < 2; _++)
            {
                var f = 0;
                if (_ == 1) f = n - 1;
                var pq = new BinaryHeapPriorityQueue<KeyValuePair<int, long>>((l, r) => l.Value.CompareTo(r.Value));
                pq.Enqueue(new KeyValuePair<int, Number>(f, 0));
                while (pq.Any())
                {
                    var p = pq.Dequeue();
                    if (d[_][p.Key] > p.Value) continue;
                    Debug.WriteLine(p);
                    foreach (var to in G[_][p.Key])
                    {
                        if (p.Value + to.Value > d[_][to.Key])
                        {
                            d[_][to.Key] = p.Value + to.Value;
                            pq.Enqueue(new KeyValuePair<int, Number>(to.Key, d[_][to.Key]));
                        }
                    }
                }
            }
            for (int i = 0; i < n; i++)
                if (d[0][n - 1] != d[0][i] + d[1][i]) cnt++;
            IO.Printer.Out.WriteLine("{0} {1}/{2}", d[0][n - 1], cnt, n);
        }

        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());
        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; }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }


    }
}
#region main
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 Ex
namespace Program.IO
{
    using System.IO;
    using System.Text;
    using System.Globalization;
    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 CultureInfo.InvariantCulture; } }
        public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
        public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { }
        public void Write<T>(string format, T[] source) { base.Write(format, source.OfType<object>().ToArray()); }
        public void WriteLine<T>(string format, T[] source) { base.WriteLine(format, source.OfType<object>().ToArray()); }
    }
    public class StreamScanner
    {
        public StreamScanner(Stream stream) { str = stream; }
        public 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) && !isEof); return (char)b; }

        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 string ScanLine()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n'; b = (char)read())
                if (b == 0) break;
                else if (b != '\r') 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 != 0 && b != '-' && (b < '0' || '9' < b));
            if (b == 0) return long.MinValue;
            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() { var s = Scan(); return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN; }
        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 char[] Char(int n) { return enumerate(n, Char); }
        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); }
    }
}
#endregion



#region PriorityQueue by BinaryHeap
public class BinaryHeapPriorityQueue<T>
{
    private readonly List<T> heap;
    private readonly Comparison<T> compare;
    private int size;
    public BinaryHeapPriorityQueue() : this(Comparer<T>.Default) { }
    public BinaryHeapPriorityQueue(IComparer<T> comparer) : this(16, comparer.Compare) { }
    public BinaryHeapPriorityQueue(Comparison<T> comparison) : this(16, comparison) { }
    public BinaryHeapPriorityQueue(int capacity, Comparison<T> comparison)
    {
        heap = new List<T>(capacity);
        compare = comparison;
    }
    public void Enqueue(T item)
    {

        heap.Add(item);
        var i = size++;
        while (i > 0)
        {
            var p = (i - 1) >> 1;
            if (compare(heap[p], item) <= 0)
                break;
            heap[i] = heap[p];
            i = p;
        }
        heap[i] = item;

    }
    public T Dequeue()
    {
        var ret = heap[0];
        var x = heap[--size];
        var i = 0;
        while ((i << 1) + 1 < size)
        {
            var a = (i << 1) + 1;
            var b = (i << 1) + 2;
            if (b < size && compare(heap[b], heap[a]) < 0) a = b;
            if (compare(heap[a], x) >= 0)
                break;
            heap[i] = heap[a];
            i = a;
        }
        heap[i] = x;
        heap.RemoveAt(size);
        return ret;

    }
    public T Peek() { return heap[0]; }
    public int Count { get { return size; } }
    public bool Any() { return size > 0; }
}
#endregion

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード