結果
問題 | No.1780 [Cherry Anniversary] 真冬に咲く26の櫻の木 |
ユーザー | yupiteru_kun |
提出日時 | 2021-12-09 01:17:46 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 1,167 ms / 2,000 ms |
コード長 | 10,245 bytes |
コンパイル時間 | 13,969 ms |
コンパイル使用メモリ | 149,700 KB |
実行使用メモリ | 176,740 KB |
最終ジャッジ日時 | 2023-09-05 17:07:18 |
合計ジャッジ時間 | 43,076 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 486 ms
37,132 KB |
testcase_01 | AC | 57 ms
25,756 KB |
testcase_02 | AC | 495 ms
37,836 KB |
testcase_03 | AC | 491 ms
38,632 KB |
testcase_04 | AC | 503 ms
38,044 KB |
testcase_05 | AC | 498 ms
38,204 KB |
testcase_06 | AC | 498 ms
40,128 KB |
testcase_07 | AC | 504 ms
37,636 KB |
testcase_08 | AC | 501 ms
38,312 KB |
testcase_09 | AC | 503 ms
38,360 KB |
testcase_10 | AC | 502 ms
37,860 KB |
testcase_11 | AC | 500 ms
40,156 KB |
testcase_12 | AC | 496 ms
38,104 KB |
testcase_13 | AC | 496 ms
38,052 KB |
testcase_14 | AC | 631 ms
64,036 KB |
testcase_15 | AC | 979 ms
84,692 KB |
testcase_16 | AC | 966 ms
84,120 KB |
testcase_17 | AC | 590 ms
56,024 KB |
testcase_18 | AC | 800 ms
72,184 KB |
testcase_19 | AC | 619 ms
63,924 KB |
testcase_20 | AC | 853 ms
78,032 KB |
testcase_21 | AC | 1,103 ms
91,872 KB |
testcase_22 | AC | 1,129 ms
90,496 KB |
testcase_23 | AC | 661 ms
61,568 KB |
testcase_24 | AC | 1,167 ms
92,956 KB |
testcase_25 | AC | 653 ms
65,864 KB |
testcase_26 | AC | 623 ms
64,016 KB |
testcase_27 | AC | 820 ms
74,724 KB |
testcase_28 | AC | 584 ms
53,120 KB |
testcase_29 | AC | 565 ms
47,756 KB |
testcase_30 | AC | 1,101 ms
89,176 KB |
testcase_31 | AC | 547 ms
41,880 KB |
testcase_32 | AC | 565 ms
48,964 KB |
testcase_33 | AC | 764 ms
75,016 KB |
testcase_34 | AC | 59 ms
28,584 KB |
testcase_35 | AC | 71 ms
32,124 KB |
testcase_36 | AC | 57 ms
25,616 KB |
testcase_37 | AC | 69 ms
29,308 KB |
testcase_38 | AC | 530 ms
42,580 KB |
testcase_39 | AC | 539 ms
40,580 KB |
testcase_40 | AC | 538 ms
40,572 KB |
testcase_41 | AC | 542 ms
176,740 KB |
コンパイルメッセージ
Determining projects to restore... Restored /home/judge/data/code/main.csproj (in 151 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/
ソースコード
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; } } Func<long?[,], long?[,], long?[,]> fun = (x, y) => { var ret = new long?[16, 16]; for (var from = 0; from < 16; ++from) { for (var k = 0; k < 16; ++k) { for (var to = 0; to < 16; ++to) { if (x[from, k].HasValue && y[k, to].HasValue) { var v = x[from, k].Value + y[k, to].Value; if (ret[from, to].HasValue) ret[from, to] = Max(ret[from, to].Value, v); else ret[from, to] = v; } } } } return ret; }; for (var i = 0; i < 26; ++i) { var ary = new long?[16, 16]; var ans = new long?[16, 16]; for (var j = 0; j < 16; ++j) { for (var k = 0; k < 16; ++k) { ary[j, k] = path[i][j, k]; } ary[j, j] = 0; ans[j, j] = 0; } while (KList[i] > 0) { if ((KList[i] & 1) != 0) { ans = fun(ans, ary); } ary = fun(ary, ary); KList[i] >>= 1; } ansary[i] = new long?[16]; for (var j = 0; j < 16; ++j) { ansary[i][j] = ans[CList[i] - 1, j]; } } 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()); } }