#517439 (C#(csc)) No.1122 Plane Tickets

• 問題: No.1122 Plane Tickets
• ユーザー: EmKjp
• 提出日時: 2020-07-23 23:04:45
• 言語: C#(csc) (csc 3.9.0)
• 結果: AC
• 実行時間: 34 ms / 1,000 ms
• コード長: 8,368 bytes
• コンパイル時間: 1,048 ms
• コンパイル使用メモリ: 119,760 KB
• 実行使用メモリ: 27,556 KB
• 最終ジャッジ日時: 2024-06-23 22:04:32
• 合計ジャッジ時間: 4,377 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	33 ms; 25,004 KB
testcase_01	AC	33 ms; 27,044 KB
testcase_02	AC	33 ms; 24,948 KB
testcase_03	AC	34 ms; 24,872 KB
testcase_04	AC	34 ms; 25,060 KB
testcase_05	AC	33 ms; 22,956 KB
testcase_06	AC	33 ms; 25,372 KB
testcase_07	AC	34 ms; 25,192 KB
testcase_08	AC	33 ms; 25,064 KB
testcase_09	AC	33 ms; 25,320 KB
testcase_10	AC	33 ms; 25,196 KB
testcase_11	AC	33 ms; 25,072 KB
testcase_12	AC	33 ms; 26,848 KB
testcase_13	AC	33 ms; 27,108 KB
testcase_14	AC	33 ms; 25,072 KB
testcase_15	AC	33 ms; 25,252 KB
testcase_16	AC	33 ms; 27,100 KB
testcase_17	AC	32 ms; 25,136 KB
testcase_18	AC	33 ms; 25,060 KB
testcase_19	AC	33 ms; 25,068 KB
testcase_20	AC	33 ms; 27,104 KB
testcase_21	AC	32 ms; 23,220 KB
testcase_22	AC	33 ms; 25,252 KB
testcase_23	AC	34 ms; 25,132 KB
testcase_24	AC	34 ms; 25,196 KB
testcase_25	AC	33 ms; 24,940 KB
testcase_26	AC	34 ms; 27,176 KB
testcase_27	AC	34 ms; 27,104 KB
testcase_28	AC	32 ms; 25,068 KB
testcase_29	AC	32 ms; 27,292 KB
testcase_30	AC	32 ms; 24,928 KB
testcase_31	AC	34 ms; 27,112 KB
testcase_32	AC	34 ms; 27,168 KB
testcase_33	AC	33 ms; 25,192 KB
testcase_34	AC	34 ms; 25,244 KB
testcase_35	AC	34 ms; 27,108 KB
testcase_36	AC	34 ms; 27,360 KB
testcase_37	AC	33 ms; 25,324 KB
testcase_38	AC	33 ms; 25,188 KB
testcase_39	AC	34 ms; 25,196 KB
testcase_40	AC	33 ms; 26,968 KB
testcase_41	AC	34 ms; 23,092 KB
testcase_42	AC	34 ms; 25,264 KB
testcase_43	AC	32 ms; 24,872 KB
testcase_44	AC	33 ms; 25,264 KB
testcase_45	AC	32 ms; 22,580 KB
testcase_46	AC	32 ms; 26,912 KB
testcase_47	AC	33 ms; 25,324 KB
testcase_48	AC	32 ms; 25,068 KB
testcase_49	AC	33 ms; 27,556 KB
testcase_50	AC	33 ms; 24,684 KB
testcase_51	AC	33 ms; 26,852 KB
testcase_52	AC	33 ms; 27,044 KB
testcase_53	AC	33 ms; 27,292 KB
testcase_54	AC	33 ms; 25,244 KB
testcase_55	AC	33 ms; 23,092 KB
testcase_56	AC	33 ms; 25,136 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.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Globalization;
using System.IO;
using System.Text;
using System.Linq;

using E = System.Linq.Enumerable;

using CostType = System.Int64;
public class WeightedDirectedGraph {
    public struct Edge {
        public int From { get; set; }
        public int To { get; set; }
        public CostType Cost { get; set; }
    }
    private readonly List<Edge>[] _adj;
    public WeightedDirectedGraph(int n) {
        _adj = Enumerable.Range(0, n).Select(_ => new List<Edge>()).ToArray();
    }

    public void AddEdge(int from, int to, CostType cost) {
        _adj[from].Add(new Edge { From = from, To = to, Cost = cost });
    }

    public IEnumerable<Edge> this[int index] {
        get { return _adj[index]; }
    }

    public int VertexCount { get { return _adj.Length; } }
}

public static partial class ShortestPathExtension {
    public static CostType[] BellmanFord(this WeightedDirectedGraph graph, int start, out bool hasNegativeCycle) {
        hasNegativeCycle = false;
        var n = graph.VertexCount;
        var dist = new CostType[n];
        var inf = CostType.MaxValue;
        for (int i = 0; i < n; i++) dist[i] = inf;
        dist[start] = 0;
        for (int i = 0; i <= n; i++) {
            bool updated = false;
            for (int j = 0; j < n; j++) {
                foreach (var e in graph[j]) {
                    if (dist[e.From] != inf) {
                        if (dist[e.To] > dist[e.From] + e.Cost) {
                            dist[e.To] = dist[e.From] + e.Cost;
                            updated = true;
                        }
                    }
                }
            }
            if (!updated) break;
            if (i == n) {
                hasNegativeCycle = true;
            }
        }
        return dist;
    }
}
internal partial class Solver {
    public void Run() {
        var a = nl();
        var b = nl();
        var c = nl();
        var d = nl();
        var e = nl();

        var ans = MoveUntil(0, (long)1e16, p => {
            var graph = new WeightedDirectedGraph(10);

            graph.AddEdge(0, 3, c);
            graph.AddEdge(1, 4, d);
            graph.AddEdge(2, 5, e);
            graph.AddEdge(3, 6, a);
            graph.AddEdge(4, 7, b);

            graph.AddEdge(0, 5, p);
            graph.AddEdge(5, 0, -p);
            graph.AddEdge(1, 6, p);
            graph.AddEdge(6, 1, -p);
            graph.AddEdge(2, 7, p);
            graph.AddEdge(7, 2, -p);

            for (int i = 0; i + 1 < 10; i++) {
                graph.AddEdge(i + 1, i, 0);
            }

            var result = graph.BellmanFord(0, out var hasCycle);
            if (hasCycle) return false;
            if (result.All(x => x >= 0)) {
                return true;
            } else {
                return false;
            }
        });
        cout.WriteLine(ans);
    }

    public static long MoveUntil(long ok, long ng, Predicate<long> predicate) {
        if (ok == ng) throw new Exception();
        while (Math.Abs(ok - ng) > 1) {
            var mid = (ok + ng) >> 1;
            if (predicate(mid)) {
                ok = mid;
            } else {
                ng = mid;
            }
        }
        return ok;
    }
}

// PREWRITEN CODE BEGINS FROM HERE

static public class StringExtensions {
    static public string JoinToString<T>(this IEnumerable<T> source, string separator = " ") {
        return string.Join(separator, source);
    }
}

internal partial class Solver : Scanner {
    public static void Main() {
#if LOCAL
        byte[] inputBuffer = new byte[1000000];
        var inputStream = Console.OpenStandardInput(inputBuffer.Length);
        using (var reader = new StreamReader(inputStream, Console.InputEncoding, false, inputBuffer.Length)) {
            Console.SetIn(reader);
            new Solver(Console.In, Console.Out).Run();
        }
#else
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver(Console.In, Console.Out).Run();
        Console.Out.Flush();
#endif
    }

#pragma warning disable IDE0052
    private readonly TextReader cin;
    private readonly TextWriter cout;
    private readonly TextWriter cerr;
#pragma warning restore IDE0052

    public Solver(TextReader reader, TextWriter writer)
        : base(reader) {
        cin = reader;
        cout = writer;
        cerr = Console.Error;
    }

    public Solver(string input, TextWriter writer)
        : this(new StringReader(input), writer) {
    }

#pragma warning disable IDE1006
#pragma warning disable IDE0051
    private int ni() { return NextInt(); }
    private int[] ni(int n) { return NextIntArray(n); }
    private long nl() { return NextLong(); }
    private long[] nl(int n) { return NextLongArray(n); }
    private double nd() { return NextDouble(); }
    private double[] nd(int n) { return NextDoubleArray(n); }
    private string ns() { return Next(); }
    private string[] ns(int n) { return NextArray(n); }
#pragma warning restore IDE1006
#pragma warning restore IDE0051
}

#if DEBUG
internal static class LinqPadExtension {
    public static string TextDump<T>(this T obj) {
        if (obj is IEnumerable) return (obj as IEnumerable).Cast<object>().JoinToString().Dump();
        else return obj.ToString().Dump();
    }
    public static T Dump<T>(this T obj) {
        return LINQPad.Extensions.Dump(obj);
    }
}
#endif

public class Scanner {
    private readonly TextReader Reader;
    private readonly CultureInfo ci = CultureInfo.InvariantCulture;

    private readonly char[] buffer = new char[2 * 1024];
    private int cursor = 0, length = 0;
    private string Token;
    private readonly StringBuilder sb = new StringBuilder(1024);

    public Scanner()
        : this(Console.In) {
    }

    public Scanner(TextReader reader) {
        Reader = reader;
    }

    public int NextInt() { return checked((int)NextLong()); }
    public long NextLong() {
        var s = Next();
        long r = 0;
        int i = 0;
        bool negative = false;
        if (s[i] == '-') {
            negative = true;
            i++;
        }
        for (; i < s.Length; i++) {
            r = r * 10 + (s[i] - '0');
#if DEBUG
            if (!char.IsDigit(s[i])) throw new FormatException();
#endif
        }
        return negative ? -r : r;
    }
    public double NextDouble() { return double.Parse(Next(), ci); }
    public string[] NextArray(int size) {
        string[] array = new string[size];
        for (int i = 0; i < size; i++) {
            array[i] = Next();
        }

        return array;
    }
    public int[] NextIntArray(int size) {
        int[] array = new int[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextInt();
        }

        return array;
    }

    public long[] NextLongArray(int size) {
        long[] array = new long[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextLong();
        }

        return array;
    }

    public double[] NextDoubleArray(int size) {
        double[] array = new double[size];
        for (int i = 0; i < size; i++) {
            array[i] = NextDouble();
        }

        return array;
    }

    public string Next() {
        if (Token == null) {
            if (!StockToken()) {
                throw new Exception();
            }
        }
        var token = Token;
        Token = null;
        return token;
    }

    public bool HasNext() {
        if (Token != null) {
            return true;
        }

        return StockToken();
    }

    private bool StockToken() {
        while (true) {
            sb.Clear();
            while (true) {
                if (cursor >= length) {
                    cursor = 0;
                    if ((length = Reader.Read(buffer, 0, buffer.Length)) <= 0) {
                        break;
                    }
                }
                var c = buffer[cursor++];
                if (33 <= c && c <= 126) {
                    sb.Append(c);
                } else {
                    if (sb.Length > 0) break;
                }
            }

            if (sb.Length > 0) {
                Token = sb.ToString();
                return true;
            }

            return false;
        }
    }
}