結果
問題 | No.2453 Seat Allocation |
ユーザー | bluemegane |
提出日時 | 2023-09-02 07:55:22 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 302 ms / 2,000 ms |
コード長 | 3,616 bytes |
コンパイル時間 | 1,526 ms |
コンパイル使用メモリ | 66,068 KB |
実行使用メモリ | 53,624 KB |
最終ジャッジ日時 | 2023-09-07 15:38:23 |
合計ジャッジ時間 | 6,898 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 61 ms
20,684 KB |
testcase_01 | AC | 60 ms
20,740 KB |
testcase_02 | AC | 61 ms
22,752 KB |
testcase_03 | AC | 60 ms
20,840 KB |
testcase_04 | AC | 61 ms
20,748 KB |
testcase_05 | AC | 254 ms
53,624 KB |
testcase_06 | AC | 138 ms
37,164 KB |
testcase_07 | AC | 116 ms
33,620 KB |
testcase_08 | AC | 82 ms
22,000 KB |
testcase_09 | AC | 279 ms
53,440 KB |
testcase_10 | AC | 300 ms
53,376 KB |
testcase_11 | AC | 302 ms
51,432 KB |
testcase_12 | AC | 133 ms
39,120 KB |
testcase_13 | AC | 152 ms
39,576 KB |
testcase_14 | AC | 129 ms
39,000 KB |
testcase_15 | AC | 172 ms
38,136 KB |
testcase_16 | AC | 144 ms
35,572 KB |
testcase_17 | AC | 63 ms
20,820 KB |
testcase_18 | AC | 215 ms
43,924 KB |
testcase_19 | AC | 245 ms
44,632 KB |
testcase_20 | AC | 133 ms
34,604 KB |
testcase_21 | AC | 159 ms
37,776 KB |
testcase_22 | AC | 196 ms
38,308 KB |
testcase_23 | AC | 61 ms
20,820 KB |
testcase_24 | AC | 60 ms
20,724 KB |
ソースコード
using System.Collections.Generic; using System; public class PriorityQueue<T> where T : IComparable { private IComparer<T> _comparer = null; private int _type = 0; private T[] _heap; private int _sz = 0; private int _count = 0; public PriorityQueue(int maxSize, IComparer<T> comparer) { _heap = new T[maxSize]; _comparer = comparer; } public PriorityQueue(int maxSize, int type = 0) { _heap = new T[maxSize]; _type = type; } private int Compare(T x, T y) { if (_comparer != null) return _comparer.Compare(x, y); return _type == 0 ? x.CompareTo(y) : y.CompareTo(x); } public void Push(T x) { _count++; var i = _sz++; while (i > 0) { var p = (i - 1) / 2; if (Compare(_heap[p], x) <= 0) break; _heap[i] = _heap[p]; i = p; } _heap[i] = x; } public T Pop() { _count--; T ret = _heap[0]; T x = _heap[--_sz]; int i = 0; while (i * 2 + 1 < _sz) { int a = i * 2 + 1; int b = i * 2 + 2; if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b; if (Compare(_heap[a], x) >= 0) break; _heap[i] = _heap[a]; i = a; } _heap[i] = x; return ret; } public int Count() => _count; public T Peek() => _heap[0]; public bool Contains(T x) { for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true; return false; } public void Clear() { while (this.Count() > 0) this.Pop(); } public IEnumerator<T> GetEnumerator() { var ret = new List<T>(); while (this.Count() > 0) { ret.Add(this.Pop()); } foreach (var r in ret) { this.Push(r); yield return r; } } public T[] ToArray() { T[] array = new T[_sz]; int i = 0; foreach (var r in this) { array[i++] = r; } return array; } } public class P : IComparable { public long av { get; set; } public long bv { get; set; } public int id { get; set; } public int bid { get; set; } public int CompareTo(object obj) { var x = (P)obj; var tt = this.av * x.bv; var tt2 = x.av * this.bv; if (tt < tt2) return 1; else if (tt > tt2) return -1; else { if (this.id > x.id) return 1; else return -1; } } } public class Hello { static void Main() { string[] line = Console.ReadLine().Trim().Split(' '); var n = int.Parse(line[0]); var m = int.Parse(line[1]); line = Console.ReadLine().Trim().Split(' '); var a = Array.ConvertAll(line, long.Parse); line = Console.ReadLine().Trim().Split(' '); var b = Array.ConvertAll(line, long.Parse); getAns(n, m, a, b); } static void getAns(int n, int m, long[] a, long[] b) { var pq = new PriorityQueue<P>(n + 100); for (int i = 0; i < n; i++) pq.Push(new P { id = i, av = a[i], bv = b[0], bid = 0 }); var ans = new List<int>(); var c = m; while (c-- > 0) { var w = pq.Pop(); ans.Add(w.id + 1); if (w.bid == m - 1) continue; pq.Push(new P { id = w.id, av = w.av, bv = b[w.bid + 1], bid = w.bid + 1 }); } Console.WriteLine(string.Join("\n", ans)); } }