結果

問題 No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木
ユーザー yupiteru_kunyupiteru_kun
提出日時 2021-12-09 01:09:03
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 1,232 ms / 2,000 ms
コード長 12,063 bytes
コンパイル時間 10,774 ms
コンパイル使用メモリ 143,640 KB
実行使用メモリ 175,708 KB
最終ジャッジ日時 2023-09-25 07:41:56
合計ジャッジ時間 42,192 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 503 ms
42,716 KB
testcase_01 AC 68 ms
33,344 KB
testcase_02 AC 558 ms
40,132 KB
testcase_03 AC 500 ms
42,532 KB
testcase_04 AC 559 ms
42,780 KB
testcase_05 AC 539 ms
43,040 KB
testcase_06 AC 555 ms
43,080 KB
testcase_07 AC 554 ms
40,696 KB
testcase_08 AC 557 ms
42,804 KB
testcase_09 AC 552 ms
42,732 KB
testcase_10 AC 550 ms
43,104 KB
testcase_11 AC 558 ms
42,748 KB
testcase_12 AC 516 ms
40,204 KB
testcase_13 AC 499 ms
42,704 KB
testcase_14 AC 677 ms
65,636 KB
testcase_15 AC 1,056 ms
87,504 KB
testcase_16 AC 1,041 ms
87,744 KB
testcase_17 AC 630 ms
58,252 KB
testcase_18 AC 848 ms
79,376 KB
testcase_19 AC 650 ms
64,744 KB
testcase_20 AC 925 ms
78,884 KB
testcase_21 AC 1,180 ms
93,576 KB
testcase_22 AC 1,194 ms
93,692 KB
testcase_23 AC 706 ms
65,832 KB
testcase_24 AC 1,232 ms
92,636 KB
testcase_25 AC 694 ms
65,132 KB
testcase_26 AC 666 ms
65,460 KB
testcase_27 AC 876 ms
77,404 KB
testcase_28 AC 621 ms
55,240 KB
testcase_29 AC 601 ms
50,620 KB
testcase_30 AC 1,170 ms
92,420 KB
testcase_31 AC 582 ms
44,096 KB
testcase_32 AC 599 ms
51,012 KB
testcase_33 AC 804 ms
74,908 KB
testcase_34 AC 71 ms
31,776 KB
testcase_35 AC 73 ms
32,860 KB
testcase_36 AC 68 ms
33,648 KB
testcase_37 AC 69 ms
32,564 KB
testcase_38 AC 555 ms
43,444 KB
testcase_39 AC 570 ms
43,000 KB
testcase_40 AC 567 ms
43,504 KB
testcase_41 AC 568 ms
175,708 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  Determining projects to restore...
  Restored /home/judge/data/code/main.csproj (in 124 ms).
.NET 向け Microsoft (R) Build Engine バージョン 17.0.0-preview-21470-01+cb055d28f
Copyright (C) Microsoft Corporation.All rights reserved.

  プレビュー版の .NET を使用しています。https://aka.ms/dotnet-core-preview をご覧ください
  main -> /home/judge/data/code/bin/Release/net6.0/main.dll
  main -> /home/judge/data/code/bin/Release/net6.0/publish/

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using static System.Math;
using System.Text;
using System.Threading;
using System.Globalization;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using Library;

namespace Program
{
    public static class ProblemA
    {
        static bool SAIKI = false;
        static public int numberOfRandomCases = 0;
        static public void MakeTestCase(List<string> _input, List<string> _output, ref Func<string[], bool> _outputChecker)
        {
        }
        static public void Solve()
        {
            var CList = NNList(26);
            var KList = NNList(26);
            var N = NN;
            var SABE = Repeat(0, N).Select(_ => new { S = NS, A = NN - 1, B = NN - 1, E = NN }).ToArray();
            var ansary = new long?[26][];
            var path = Repeat(0, 26).Select(_ => new long?[16, 16]).ToArray();
            foreach (var item in SABE.OrderBy(e => e.E))
            {
                var done = new HashSet<char>();
                foreach (var ch in item.S)
                {
                    if (done.Contains(ch)) continue;
                    done.Add(ch);
                    path[ch - 'A'][item.A, item.B] = item.E;
                    path[ch - 'A'][item.B, item.A] = item.E;
                }
            }
            for (var i = 0; i < 26; ++i)
            {
                var dbl = new long?[31, 16, 16];
                for (var j = 0; j < 16; ++j)
                {
                    for (var k = 0; k < 16; ++k)
                    {
                        dbl[0, j, k] = path[i][j, k];
                    }
                    dbl[0, j, j] = 0;
                }
                for (var j = 1; j < 31; ++j)
                {
                    for (var from = 0; from < 16; ++from)
                    {
                        for (var k = 0; k < 16; ++k)
                        {
                            if (dbl[j - 1, from, k].HasValue)
                            {
                                for (var to = 0; to < 16; ++to)
                                {
                                    if (dbl[j - 1, k, to].HasValue)
                                    {
                                        if (dbl[j, from, to].HasValue)
                                        {
                                            dbl[j, from, to] = Max(dbl[j, from, to].Value, dbl[j - 1, from, k].Value + dbl[j - 1, k, to].Value);
                                        }
                                        else
                                        {
                                            dbl[j, from, to] = dbl[j - 1, from, k].Value + dbl[j - 1, k, to].Value;
                                        }
                                    }
                                }
                            }
                        }
                    }
                }
                var idx = 0;
                var ans = new long?[16, 16];
                for (var j = 0; j < 16; ++j)
                {
                    ans[j, j] = 0;
                }
                while (KList[i] > 0)
                {
                    if ((KList[i] & 1) != 0)
                    {
                        var nextans = new long?[16, 16];
                        for (var from = 0; from < 16; ++from)
                        {
                            for (var k = 0; k < 16; ++k)
                            {
                                if (ans[from, k].HasValue)
                                {
                                    for (var to = 0; to < 16; ++to)
                                    {
                                        if (dbl[idx, k, to].HasValue)
                                        {
                                            if (nextans[from, to].HasValue)
                                            {
                                                nextans[from, to] = Max(nextans[from, to].Value, ans[from, k].Value + dbl[idx, k, to].Value);
                                            }
                                            else
                                            {
                                                nextans[from, to] = ans[from, k].Value + dbl[idx, k, to].Value;
                                            }
                                        }
                                    }
                                }
                            }
                        }
                        ans = nextans;
                    }
                    ++idx;
                    KList[i] >>= 1;
                }
                var thisans = new long?[16];
                for (var j = 0; j < 16; ++j)
                {
                    thisans[j] = ans[CList[i] - 1, j];
                }
                ansary[i] = thisans;
            }
            var ansv = long.MinValue;
            for (var i = 0; i < 16; ++i)
            {
                var ok = true;
                var thissum = 0L;
                for (var j = 0; j < 26; ++j)
                {
                    if (ansary[j][i].HasValue) thissum += ansary[j][i].Value;
                    else ok = false;
                }
                if (ok) ansv.Chmax(thissum);
            }
            if (ansv == long.MinValue) Console.WriteLine("Impossible");
            else Console.WriteLine(ansv);
        }
        class Printer : StreamWriter
        {
            public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
            public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { base.AutoFlush = false; }
            public Printer(Stream stream, Encoding encoding) : base(stream, encoding) { base.AutoFlush = false; }
        }
        static LIB_FastIO fastio = new LIB_FastIODebug();
        static public void Main(string[] args) { if (args.Length == 0) { fastio = new LIB_FastIO(); Console.SetOut(new Printer(Console.OpenStandardOutput())); } if (SAIKI) { var t = new Thread(Solve, 134217728); t.Start(); t.Join(); } else Solve(); Console.Out.Flush(); }
        static long NN => fastio.Long();
        static double ND => fastio.Double();
        static string NS => fastio.Scan();
        static long[] NNList(long N) => Repeat(0, N).Select(_ => NN).ToArray();
        static double[] NDList(long N) => Repeat(0, N).Select(_ => ND).ToArray();
        static string[] NSList(long N) => Repeat(0, N).Select(_ => NS).ToArray();
        static long Count<T>(this IEnumerable<T> x, Func<T, bool> pred) => Enumerable.Count(x, pred);
        static IEnumerable<T> Repeat<T>(T v, long n) => Enumerable.Repeat<T>(v, (int)n);
        static IEnumerable<int> Range(long s, long c) => Enumerable.Range((int)s, (int)c);
        static IOrderedEnumerable<T> OrderByRand<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x, _ => xorshift);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x) => Enumerable.OrderBy(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderBy<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderBy(x.OrderByRand(), selector);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x) => Enumerable.OrderByDescending(x.OrderByRand(), e => e);
        static IOrderedEnumerable<T1> OrderByDescending<T1, T2>(this IEnumerable<T1> x, Func<T1, T2> selector) => Enumerable.OrderByDescending(x.OrderByRand(), selector);
        static IOrderedEnumerable<string> OrderBy(this IEnumerable<string> x) => x.OrderByRand().OrderBy(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderBy<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderBy(selector, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<string> OrderByDescending(this IEnumerable<string> x) => x.OrderByRand().OrderByDescending(e => e, StringComparer.OrdinalIgnoreCase);
        static IOrderedEnumerable<T> OrderByDescending<T>(this IEnumerable<T> x, Func<T, string> selector) => x.OrderByRand().OrderByDescending(selector, StringComparer.OrdinalIgnoreCase);
        static string Join<T>(this IEnumerable<T> x, string separator = "") => string.Join(separator, x);
        static uint xorshift { get { _xsi.MoveNext(); return _xsi.Current; } }
        static IEnumerator<uint> _xsi = _xsc();
        static IEnumerator<uint> _xsc() { uint x = 123456789, y = 362436069, z = 521288629, w = (uint)(DateTime.Now.Ticks & 0xffffffff); while (true) { var t = x ^ (x << 11); x = y; y = z; z = w; w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)); yield return w; } }
        static bool Chmax<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) < 0) { lhs = rhs; return true; } return false; }
        static bool Chmin<T>(this ref T lhs, T rhs) where T : struct, IComparable<T> { if (lhs.CompareTo(rhs) > 0) { lhs = rhs; return true; } return false; }
        static void Fill<T>(this T[] array, T value) => array.AsSpan().Fill(value);
        static void Fill<T>(this T[,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0], array.Length).Fill(value);
        static void Fill<T>(this T[,,,] array, T value) => MemoryMarshal.CreateSpan(ref array[0, 0, 0, 0], array.Length).Fill(value);
    }
}
namespace Library {
    class LIB_FastIO
    {
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIO() { str = Console.OpenStandardInput(); }
        readonly Stream str;
        readonly byte[] buf = new byte[2048];
        int len, ptr;
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        byte read()
        {
            if (ptr >= len)
            {
                ptr = 0;
                if ((len = str.Read(buf, 0, 2048)) <= 0)
                {
                    return 0;
                }
            }
            return buf[ptr++];
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        char Char()
        {
            byte b = 0;
            do b = read();
            while (b < 33 || 126 < b);
            return (char)b;
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public string Scan()
        {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                sb.Append(b);
            return sb.ToString();
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public long Long()
        {
            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 << 3) + (ret << 1) + b - '0';
            }
        }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        virtual public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
    class LIB_FastIODebug : LIB_FastIO
    {
        Queue<string> param = new Queue<string>();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        string NextString() { if (param.Count == 0) foreach (var item in Console.ReadLine().Split(' ')) param.Enqueue(item); return param.Dequeue(); }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public LIB_FastIODebug() { }
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override string Scan() => NextString();
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override long Long() => long.Parse(NextString());
        [MethodImpl(MethodImplOptions.AggressiveInlining)]
        public override double Double() => double.Parse(NextString());
    }
}
0