結果
問題 | No.2139 K Consecutive Sushi |
ユーザー | kakel-san |
提出日時 | 2023-09-19 19:20:46 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 270 ms / 2,000 ms |
コード長 | 3,077 bytes |
コンパイル時間 | 1,005 ms |
コンパイル使用メモリ | 108,928 KB |
実行使用メモリ | 48,388 KB |
最終ジャッジ日時 | 2024-05-05 19:24:38 |
合計ジャッジ時間 | 5,296 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 23 ms
19,072 KB |
testcase_01 | AC | 24 ms
18,816 KB |
testcase_02 | AC | 24 ms
18,944 KB |
testcase_03 | AC | 146 ms
48,124 KB |
testcase_04 | AC | 145 ms
47,992 KB |
testcase_05 | AC | 147 ms
48,388 KB |
testcase_06 | AC | 150 ms
48,260 KB |
testcase_07 | AC | 151 ms
48,272 KB |
testcase_08 | AC | 265 ms
46,864 KB |
testcase_09 | AC | 270 ms
47,088 KB |
testcase_10 | AC | 246 ms
47,620 KB |
testcase_11 | AC | 264 ms
47,244 KB |
testcase_12 | AC | 248 ms
46,844 KB |
testcase_13 | AC | 26 ms
19,072 KB |
testcase_14 | AC | 26 ms
18,944 KB |
testcase_15 | AC | 26 ms
18,816 KB |
testcase_16 | AC | 24 ms
18,944 KB |
testcase_17 | AC | 25 ms
19,072 KB |
testcase_18 | AC | 29 ms
19,840 KB |
testcase_19 | AC | 28 ms
19,712 KB |
testcase_20 | AC | 30 ms
19,712 KB |
testcase_21 | AC | 28 ms
19,456 KB |
testcase_22 | AC | 29 ms
19,584 KB |
testcase_23 | AC | 37 ms
21,644 KB |
testcase_24 | AC | 68 ms
31,872 KB |
testcase_25 | AC | 106 ms
41,728 KB |
testcase_26 | AC | 38 ms
22,528 KB |
testcase_27 | AC | 57 ms
26,624 KB |
testcase_28 | AC | 57 ms
26,880 KB |
testcase_29 | AC | 41 ms
22,528 KB |
testcase_30 | AC | 72 ms
33,152 KB |
testcase_31 | AC | 135 ms
47,232 KB |
testcase_32 | AC | 43 ms
22,784 KB |
testcase_33 | AC | 194 ms
46,976 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (n, k) = (c[0], c[1]); var a = NList; var dlist = new Pair[n + 1]; dlist[0] = new Pair(0); var q = new PriorityQueue<Pair>(n, false); q.Enqueue(dlist[0]); for (var i = 1; i <= n; ++i) { while (q.List[0].Deleted) q.Dequeue(); dlist[i] = new Pair(q.List[0].Val + a[i - 1]); q.Enqueue(dlist[i]); if (i - k >= 0) dlist[i - k].Deleted = true; } while (q.List[0].Deleted) q.Dequeue(); var ans = 0L; foreach (var ai in a) ans += ai; WriteLine(ans - q.List[0].Val); } class Pair : IComparable<Pair> { public long Val; public bool Deleted; public Pair(long v) { Val = v; } public int CompareTo(Pair b) { return Val.CompareTo(b.Val); } } class PriorityQueue<T> where T : IComparable<T> { public T[] List; public int Count; bool IsTopMax; public PriorityQueue(int count, bool isTopMax) { IsTopMax = isTopMax; List = new T[Math.Max(128, count)]; } public void Enqueue(T value) { if (Count == List.Length) { var newlist = new T[List.Length * 2]; for (var i = 0; i < List.Length; ++i) newlist[i] = List[i]; List = newlist; } var pos = Count; List[pos] = value; ++Count; while (pos > 0) { var parent = (pos - 1) / 2; if (Calc(List[parent], List[pos], true)) break; Swap(parent, pos); pos = parent; } } public T Dequeue() { --Count; Swap(0, Count); var pos = 0; while (true) { var child = pos * 2 + 1; if (child >= Count) break; if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child; if (Calc(List[pos], List[child], true)) break; Swap(pos, child); pos = child; } return List[Count]; } bool Calc(T a, T b, bool equalVal) { var ret = a.CompareTo(b); if (ret == 0 && equalVal) return true; return IsTopMax ? ret > 0 : ret < 0; } void Swap(int a, int b) { var tmp = List[a]; List[a] = List[b]; List[b] = tmp; } } }