結果

問題 No.845 最長の切符
ユーザー claw88claw88
提出日時 2019-06-28 22:32:55
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 220 ms / 3,000 ms
コード長 4,312 bytes
コンパイル時間 3,424 ms
コンパイル使用メモリ 106,404 KB
実行使用メモリ 25,728 KB
最終ジャッジ日時 2023-09-14 22:19:51
合計ジャッジ時間 6,411 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
20,792 KB
testcase_01 AC 59 ms
20,656 KB
testcase_02 AC 60 ms
20,696 KB
testcase_03 AC 58 ms
20,688 KB
testcase_04 AC 59 ms
22,752 KB
testcase_05 AC 58 ms
20,636 KB
testcase_06 AC 58 ms
18,636 KB
testcase_07 AC 59 ms
20,768 KB
testcase_08 AC 60 ms
22,688 KB
testcase_09 AC 59 ms
20,788 KB
testcase_10 AC 61 ms
22,660 KB
testcase_11 AC 59 ms
22,732 KB
testcase_12 AC 60 ms
22,684 KB
testcase_13 AC 59 ms
22,756 KB
testcase_14 AC 59 ms
18,708 KB
testcase_15 AC 85 ms
20,968 KB
testcase_16 AC 215 ms
23,656 KB
testcase_17 AC 85 ms
23,072 KB
testcase_18 AC 122 ms
19,716 KB
testcase_19 AC 70 ms
20,792 KB
testcase_20 AC 215 ms
25,728 KB
testcase_21 AC 205 ms
23,696 KB
testcase_22 AC 85 ms
21,100 KB
testcase_23 AC 65 ms
22,748 KB
testcase_24 AC 220 ms
23,656 KB
testcase_25 AC 58 ms
20,776 KB
testcase_26 AC 59 ms
22,784 KB
testcase_27 AC 58 ms
20,692 KB
testcase_28 AC 60 ms
20,796 KB
testcase_29 AC 60 ms
22,752 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 SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }

    int N;
    int[,] dp, D;
    void solve()
    {
        N = cin.nextint;
        int M = cin.nextint;

        D = new int[N, N];

        for (int i = 0; i < M; i++)
        {
            int a = cin.nextint - 1;
            int b = cin.nextint - 1;
            int c = cin.nextint;

            chmax(ref D[a, b], c);
            D[b, a] = D[a, b];
        }

        dp = new int[N, 1 << N];


        int ans = 0;
        for (int i = 0; i < N; i++)
        {
            //if (ans < calc(i, 1 << i))
            //{
            //    WriteLine(calc(i, 1 << i) + " " + i);
            //}
            chmax(ref ans, calc(i, 1 << i));

        }

        WriteLine(ans);
    }
    int calc(int x, int S)
    {
        if(S == (1 << N) - 1)
        {
            return 0;
        }
        if (dp[x, S] > 0)
        {
            return dp[x, S];
        }

        int ret = 0;
        for (int i = 0; i < N; i++)
        {
            if ((S >> i & 1) == 0 && D[x, i] > 0)
            {
                chmax(ref ret, calc(i, S | 1 << i) + D[x, i]);
            }
        }
        return dp[x, S] = ret;
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0