結果
問題 | No.1631 Sorting Integers (Multiple of K) Easy |
ユーザー | yupiteru_kun |
提出日時 | 2021-07-30 22:35:35 |
言語 | C# (.NET 8.0.203) |
結果 |
AC
|
実行時間 | 454 ms / 3,000 ms |
コード長 | 9,965 bytes |
コンパイル時間 | 10,207 ms |
コンパイル使用メモリ | 166,264 KB |
実行使用メモリ | 201,124 KB |
最終ジャッジ日時 | 2024-09-16 01:18:28 |
合計ジャッジ時間 | 16,076 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
27,520 KB |
testcase_01 | AC | 48 ms
27,520 KB |
testcase_02 | AC | 48 ms
27,648 KB |
testcase_03 | AC | 58 ms
29,312 KB |
testcase_04 | AC | 48 ms
27,264 KB |
testcase_05 | AC | 47 ms
27,264 KB |
testcase_06 | AC | 48 ms
27,632 KB |
testcase_07 | AC | 47 ms
27,520 KB |
testcase_08 | AC | 48 ms
27,776 KB |
testcase_09 | AC | 56 ms
29,176 KB |
testcase_10 | AC | 50 ms
27,896 KB |
testcase_11 | AC | 57 ms
28,800 KB |
testcase_12 | AC | 54 ms
28,668 KB |
testcase_13 | AC | 48 ms
27,648 KB |
testcase_14 | AC | 424 ms
56,064 KB |
testcase_15 | AC | 453 ms
56,308 KB |
testcase_16 | AC | 454 ms
56,320 KB |
testcase_17 | AC | 444 ms
56,188 KB |
testcase_18 | AC | 448 ms
56,320 KB |
testcase_19 | AC | 451 ms
56,320 KB |
testcase_20 | AC | 55 ms
29,440 KB |
testcase_21 | AC | 60 ms
29,952 KB |
testcase_22 | AC | 57 ms
29,696 KB |
testcase_23 | AC | 72 ms
31,616 KB |
testcase_24 | AC | 60 ms
30,456 KB |
testcase_25 | AC | 60 ms
29,952 KB |
testcase_26 | AC | 55 ms
29,056 KB |
testcase_27 | AC | 205 ms
42,112 KB |
testcase_28 | AC | 118 ms
34,548 KB |
testcase_29 | AC | 77 ms
30,720 KB |
testcase_30 | AC | 134 ms
35,840 KB |
testcase_31 | AC | 164 ms
201,124 KB |
コンパイルメッセージ
復元対象のプロジェクトを決定しています... /home/judge/data/code/main.csproj を復元しました (93 ms)。 MSBuild のバージョン 17.9.6+a4ecab324 (.NET) main -> /home/judge/data/code/bin/Release/net8.0/main.dll main -> /home/judge/data/code/bin/Release/net8.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 ProblemC { 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 N = NN; var K = NN; var cList = new[] { 0L }.Concat(NNList(9)).ToArray(); var dp = new LIB_Dict<long, long[]>(_ => new long[K]); dp[0][0] = 1; Func<long, int, int> get = (val, idx) => { --idx; return (int)((val >> (idx * 4)) & 15L); }; Func<long, int, long, long> set = (val, idx, num) => { --idx; return (val & ~(15L << (idx * 4))) | (num << (idx * 4)); }; for (var t = 0; t < N; ++t) { var nextdp = new LIB_Dict<long, long[]>(_ => new long[K]); foreach (var item in dp) { for (var j = 1; j < 10; ++j) { if (get(item.Key, j) == cList[j]) continue; var key = set(item.Key, j, get(item.Key, j) + 1); for (var k = 0; k < K; ++k) { nextdp[key][(k * 10 + j) % K] += item.Value[k]; } } } dp = nextdp; } var ckey = 0L; for (var i = 1; i < 10; ++i) { ckey = set(ckey, i, cList[i]); } Console.WriteLine(dp[ckey][0]); } 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()); } class LIB_Dict<K, V> : Dictionary<K, V> { Func<K, V> d; [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_Dict(Func<K, V> _d) { d = _d; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public LIB_Dict() : this(_ => default(V)) { } new public V this[K i] { get { return TryGetValue(i, out var v) ? v : base[i] = d(i); } set { base[i] = value; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] public override int GetHashCode() { unchecked { var ret = 23; for (var e = GetEnumerator(); e.MoveNext();) ret = (ret * 37) ^ (e.Current.Key.GetHashCode() << 5 + e.Current.Key.GetHashCode()) ^ e.Current.Value.GetHashCode(); return ret; } } [MethodImpl(MethodImplOptions.AggressiveInlining)] public override bool Equals(object obj) { var o = (LIB_Dict<K, V>)obj; foreach (var kv in o) { if (!ContainsKey(kv.Key) || !this[kv.Key].Equals(kv.Value)) return false; } return o.Count == Count; } } }