結果

問題 No.1320 Two Type Min Cost Cycle
ユーザー りあんりあん
提出日時 2020-12-17 10:20:48
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 881 ms / 2,000 ms
コード長 10,945 bytes
コンパイル時間 4,801 ms
コンパイル使用メモリ 120,520 KB
実行使用メモリ 65,488 KB
最終ジャッジ日時 2023-10-20 11:22:24
合計ジャッジ時間 17,154 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 29 ms
24,424 KB
testcase_01 AC 30 ms
24,412 KB
testcase_02 AC 30 ms
24,428 KB
testcase_03 AC 28 ms
24,412 KB
testcase_04 AC 29 ms
24,420 KB
testcase_05 AC 29 ms
24,412 KB
testcase_06 AC 35 ms
30,120 KB
testcase_07 AC 73 ms
58,224 KB
testcase_08 AC 76 ms
43,092 KB
testcase_09 AC 785 ms
43,108 KB
testcase_10 AC 85 ms
65,184 KB
testcase_11 AC 703 ms
43,148 KB
testcase_12 AC 145 ms
43,064 KB
testcase_13 AC 300 ms
45,208 KB
testcase_14 AC 42 ms
36,036 KB
testcase_15 AC 86 ms
65,360 KB
testcase_16 AC 79 ms
26,468 KB
testcase_17 AC 55 ms
44,244 KB
testcase_18 AC 57 ms
45,432 KB
testcase_19 AC 141 ms
41,816 KB
testcase_20 AC 37 ms
31,880 KB
testcase_21 AC 682 ms
50,524 KB
testcase_22 AC 29 ms
24,420 KB
testcase_23 AC 30 ms
24,416 KB
testcase_24 AC 29 ms
24,420 KB
testcase_25 AC 29 ms
24,416 KB
testcase_26 AC 29 ms
24,420 KB
testcase_27 AC 29 ms
24,428 KB
testcase_28 AC 51 ms
41,908 KB
testcase_29 AC 299 ms
65,412 KB
testcase_30 AC 30 ms
24,412 KB
testcase_31 AC 75 ms
32,720 KB
testcase_32 AC 30 ms
24,412 KB
testcase_33 AC 675 ms
43,180 KB
testcase_34 AC 305 ms
46,156 KB
testcase_35 AC 31 ms
24,408 KB
testcase_36 AC 31 ms
24,408 KB
testcase_37 AC 33 ms
24,420 KB
testcase_38 AC 61 ms
24,420 KB
testcase_39 AC 34 ms
24,420 KB
testcase_40 AC 30 ms
24,420 KB
testcase_41 AC 30 ms
24,412 KB
testcase_42 AC 28 ms
24,412 KB
testcase_43 AC 88 ms
65,364 KB
testcase_44 AC 58 ms
44,948 KB
testcase_45 AC 881 ms
43,184 KB
testcase_46 AC 68 ms
34,128 KB
testcase_47 AC 301 ms
47,996 KB
testcase_48 AC 293 ms
56,876 KB
testcase_49 AC 55 ms
30,008 KB
testcase_50 AC 29 ms
24,424 KB
testcase_51 AC 29 ms
24,424 KB
testcase_52 AC 118 ms
28,580 KB
testcase_53 AC 69 ms
28,564 KB
testcase_54 AC 273 ms
65,488 KB
testcase_55 AC 270 ms
65,488 KB
testcase_56 AC 273 ms
65,488 KB
testcase_57 AC 847 ms
43,128 KB
testcase_58 AC 847 ms
43,128 KB
testcase_59 AC 850 ms
43,128 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Text;
using System.Text.RegularExpressions;
using System.Diagnostics;
using static util;
using P = pair<int, int>;
using Number = System.Int64;

class Program {
    static void Main(string[] args) {
        var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
        var solver = new Solver(sw);
        // var t = new Thread(solver.solve, 1 << 28); // 256 MB
        // t.Start();
        // t.Join();
        solver.solve();
        sw.Flush();
    }
}

class Solver {
    StreamWriter sw;
    Scan sc;
    void Prt(string a) => sw.WriteLine(a);
    void Prt<T>(IEnumerable<T> a) => Prt(string.Join(" ", a));
    void Prt(params object[] a) => Prt(string.Join(" ", a));
    public Solver(StreamWriter sw) {
        this.sw = sw;
        this.sc = new Scan();
    }

    public void solve() {
        bool dir = sc.Int == 1;
        int n, m;
        sc.Multi(out n, out m);
        var edge = new List<pair<long, int>>[n];
        for (int i = 0; i < n; i++)
        {
            edge[i] = new List<pair<long, int>>();
        }
        for (int i = 0; i < m; i++)
        {
            int u, v, w;
            sc.Multi(out u, out v, out w);
            --u;
            --v;
            edge[u].Add(new pair<long, int>(w, v));
            if (!dir) {
                edge[v].Add(new pair<long, int>(w, u));
            }
        }
        long ans = LM;
        if (dir) {
            var dist = new long[n][];
            for (int i = 0; i < n; i++)
            {
                dist[i] = ShortestPath.Dijkstra(edge, i, LM);
            }
            for (int i = 0; i < n; i++)
            {
                foreach (var item in edge[i])
                {
                    ans = Math.Min(ans, dist[item.v2][i] + item.v1);
                }
            }
        }
        else {
            for (int i = 0; i < n; i++)
            {
                foreach (var item in edge[i])
                {
                    long d = item.v1;
                    item.v1 = LM;
                    var dist = ShortestPath.Dijkstra(edge, i, LM)[item.v2];
                    ans = Math.Min(ans, dist + d);
                    item.v1 = d;
                }
            }
        }
        Prt(ans == LM ? -1 : ans);
    }
}

class pair<T, U> : IComparable<pair<T, U>> {
    public T v1;
    public U v2;
    public pair() : this(default(T), default(U)) {}
    public pair(T v1, U v2) { this.v1 = v1; this.v2 = v2; }
    public int CompareTo(pair<T, U> a) {
        int c = Comparer<T>.Default.Compare(v1, a.v1);
        return c != 0 ? c : Comparer<U>.Default.Compare(v2, a.v2);
    }
    public override string ToString() => v1 + " " + v2;
    public void Deconstruct(out T a, out U b) { a = v1; b = v2; }
}
static class util {
    public static readonly int M = 1000000007;
    // public static readonly int M = 998244353;
    public static readonly long LM = 1L << 60;
    public static readonly double eps = 1e-11;
    public static void DBG(string a) => Console.Error.WriteLine(a);
    public static void DBG<T>(IEnumerable<T> a) => DBG(string.Join(" ", a));
    public static void DBG(params object[] a) => DBG(string.Join(" ", a));
    public static void Assert(params bool[] conds) {
        if (conds.Any(x => !x)) throw new Exception();
    }
    public static pair<T, U> make_pair<T, U>(T v1, U v2) => new pair<T, U>(v1, v2);
    public static int CompareList<T>(IList<T> a, IList<T> b) where T : IComparable<T> {
        for (int i = 0; i < a.Count && i < b.Count; i++)
            if (a[i].CompareTo(b[i]) != 0) return a[i].CompareTo(b[i]);
        return a.Count.CompareTo(b.Count);
    }
    public static bool inside(int i, int j, int h, int w) => i >= 0 && i < h && j >= 0 && j < w;
    public static readonly int[] dd = { 0, 1, 0, -1 };
    // static readonly string dstring = "RDLU";
    public static IEnumerable<P> adjacents(int i, int j)
        => Enumerable.Range(0, dd.Length).Select(k => new P(i + dd[k], j + dd[k ^ 1]));
    public static IEnumerable<P> adjacents(int i, int j, int h, int w)
        => adjacents(i, j).Where(p => inside(p.v1, p.v2, h, w));
    public static IEnumerable<P> adjacents(this P p) => adjacents(p.v1, p.v2);
    public static IEnumerable<P> adjacents(this P p, int h, int w) => adjacents(p.v1, p.v2, h, w);
    public static IEnumerable<int> all_subset(this int p) {
        for (int i = 0; ; i = i - p & p) {
            yield return i;
            if (i == p) break;
        }
    }
    public static Dictionary<T, int> compress<T>(this IEnumerable<T> a)
        => a.Distinct().OrderBy(v => v).Select((v, i) => new { v, i }).ToDictionary(p => p.v, p => p.i);
    public static Dictionary<T, int> compress<T>(params IEnumerable<T>[] a) => compress(a.SelectMany(x => x));
    public static T[] inv<T>(this Dictionary<T, int> dic) {
        var res = new T[dic.Count];
        foreach (var item in dic) res[item.Value] = item.Key;
        return res;
    }
    public static void swap<T>(ref T a, ref T b) where T : struct { var t = a; a = b; b = t; }
    public static void swap<T>(this IList<T> a, int i, int j) where T : struct { var t = a[i]; a[i] = a[j]; a[j] = t; }
    public static T[] copy<T>(this IList<T> a) {
        var ret = new T[a.Count];
        for (int i = 0; i < a.Count; i++) ret[i] = a[i];
        return ret;
    }
}

class Scan {
    StreamReader sr;
    public Scan() { sr = new StreamReader(Console.OpenStandardInput()); }
    public Scan(string path) { sr = new StreamReader(path); }
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public string Str => ReadLine.Trim();
    public string ReadLine => sr.ReadLine();
    public pair<T, U> Pair<T, U>() {
        T a; U b;
        Multi(out a, out b);
        return new pair<T, U>(a, b);
    }
    public P P => Pair<int, int>();
    public int[] IntArr => StrArr.Select(int.Parse).ToArray();
    public long[] LongArr => StrArr.Select(long.Parse).ToArray();
    public double[] DoubleArr => StrArr.Select(double.Parse).ToArray();
    public string[] StrArr => Str.Split(new[]{' '}, StringSplitOptions.RemoveEmptyEntries);
    bool eq<T, U>() => typeof(T).Equals(typeof(U));
    T ct<T, U>(U a) => (T)Convert.ChangeType(a, typeof(T));
    T cv<T>(string s) => eq<T, int>()    ? ct<T, int>(int.Parse(s))
                       : eq<T, long>()   ? ct<T, long>(long.Parse(s))
                       : eq<T, double>() ? ct<T, double>(double.Parse(s))
                       : eq<T, char>()   ? ct<T, char>(s[0])
                                         : ct<T, string>(s);
    public void Multi<T>(out T a) => a = cv<T>(Str);
    public void Multi<T, U>(out T a, out U b) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]);
    }
    public void Multi<T, U, V>(out T a, out U b, out V c) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]);
    }
    public void Multi<T, U, V, W>(out T a, out U b, out V c, out W d) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]);
    }
    public void Multi<T, U, V, W, X>(out T a, out U b, out V c, out W d, out X e) {
        var ar = StrArr; a = cv<T>(ar[0]); b = cv<U>(ar[1]); c = cv<V>(ar[2]); d = cv<W>(ar[3]); e = cv<X>(ar[4]);
    }
}


static class ShortestPath {
    public static void WarshallFloyd(Number[][] g) {
        int n = g.Length;
        for (int i = 0; i < n; ++i)
            for (int j = 0; j < n; ++j)
                for (int k = 0; k < n; ++k)
                    g[j][k] = Math.Min(g[j][k], g[j][i] + g[i][k]);
    }

    class Heap {
        int n;
        Number[] values;
        int[] keys, indices;

        void Update(int i, Number val) {
            if (indices[i] == -1) {
                keys[n] = i;
                indices[i] = n;
                ++n;
            }
            values[i] = val;
            int p = indices[i];
            while (p > 0) {
                int par = p - 1 >> 1;
                if (values[keys[par]] > val) {
                    keys[p] = keys[par];
                    indices[keys[p]] = p;
                    p = par;
                }
                else break;
            }
            keys[p] = i;
            indices[i] = p;
        }
        int Pop() {
            --n;
            int ret = keys[0];
            indices[ret] = -1;
            int i = keys[n];
            keys[n] = -1;
            Number val = values[i];
            if (n == 0) return ret;
            int p = 0;
            while ((p << 1 | 1) < n) {
                int ch = p << 1 | 1;
                if (ch < n - 1 && values[keys[ch]] > values[keys[ch + 1]]) ++ch;
                if (val > values[keys[ch]]) {
                    keys[p] = keys[ch];
                    indices[keys[p]] = p;
                    p = ch;
                }
                else break;
            }
            keys[p] = i;
            indices[i] = p;
            return ret;
        }

        void init(int m, int s, Number inf) {
            values = new Number[m];
            keys = new int[m];
            indices = new int[m];
            for (int i = 0; i < m; i++) {
                values[i] = inf;
                keys[i] = -1;
                indices[i] = -1;
            }
            values[s] = 0;
            keys[0] = s;
            indices[s] = 0;
        }

        public Number[] Run(List<pair<Number, int>>[] edges, int s, Number inf) {
            init(edges.Length, s, inf);

            n = 1;
            while (n > 0) {
                int p = Pop();
                foreach (var e in edges[p])
                    if (values[e.v2] > values[p] + e.v1)
                        Update(e.v2, values[p] + e.v1);
            }
            return values;
        }
        public pair<Number[], long[]> Run(List<pair<Number, int>>[] edges, int s, long Mod, Number inf) {
            init(edges.Length, s, inf);
            var cnts = new long[edges.Length];
            cnts[s] = 1;

            n = 1;
            while (n > 0) {
                int p = Pop();
                foreach (var e in edges[p])
                    if (values[e.v2] > values[p] + e.v1) {
                        cnts[e.v2] = cnts[p];
                        Update(e.v2, values[p] + e.v1);
                    }
                    else if (values[e.v2] == values[p] + e.v1)
                        cnts[e.v2] = (cnts[e.v2] + cnts[p]) % Mod;
            }
            return new pair<Number[], long[]>(values, cnts);
        }
    }

    public static Number[] Dijkstra(List<pair<Number, int>>[] edges, int s, Number inf)
        => new Heap().Run(edges, s, inf);

    public static pair<Number[], long[]> Dijkstra(List<pair<Number, int>>[] edges, int s, long Mod, Number inf)
        => new Heap().Run(edges, s, Mod, inf);
}
0