結果
問題 | No.875 Range Mindex Query |
ユーザー | keymoon |
提出日時 | 2019-09-06 21:30:15 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 716 ms / 2,000 ms |
コード長 | 3,321 bytes |
コンパイル時間 | 3,381 ms |
コンパイル使用メモリ | 110,132 KB |
実行使用メモリ | 41,716 KB |
最終ジャッジ日時 | 2023-09-06 22:36:33 |
合計ジャッジ時間 | 9,794 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 65 ms
21,756 KB |
testcase_01 | AC | 76 ms
24,132 KB |
testcase_02 | AC | 77 ms
21,976 KB |
testcase_03 | AC | 67 ms
21,800 KB |
testcase_04 | AC | 75 ms
21,964 KB |
testcase_05 | AC | 76 ms
24,104 KB |
testcase_06 | AC | 76 ms
24,060 KB |
testcase_07 | AC | 76 ms
22,040 KB |
testcase_08 | AC | 74 ms
22,000 KB |
testcase_09 | AC | 74 ms
22,040 KB |
testcase_10 | AC | 76 ms
23,936 KB |
testcase_11 | AC | 529 ms
41,716 KB |
testcase_12 | AC | 443 ms
29,264 KB |
testcase_13 | AC | 395 ms
34,308 KB |
testcase_14 | AC | 399 ms
33,772 KB |
testcase_15 | AC | 519 ms
35,196 KB |
testcase_16 | AC | 667 ms
33,064 KB |
testcase_17 | AC | 716 ms
33,532 KB |
testcase_18 | AC | 679 ms
33,600 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.IO; using System.Net; using System.Net.Sockets; using System.Linq; using System.Collections; using System.Collections.Generic; using System.Text; using System.Numerics; using System.Threading.Tasks; using System.Text.RegularExpressions; using static System.Math; using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions; using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute; public static class P { public static void Main() { var nq = Console.ReadLine().Split().Select(int.Parse).ToArray(); var a = Console.ReadLine().Split().Select(int.Parse).ToArray(); SegmentTree<Tuple<int, int>> rmq = new SegmentTree<Tuple<int, int>>(a.Select((x, y) => new Tuple<int, int>(x, y + 1)).ToArray(), new Tuple<int, int>(int.MaxValue, -1), (x, y) => x.Item1 < y.Item1 ? x : y); for (int i = 0; i < nq[1]; i++) { var query = Console.ReadLine().Split().Select(int.Parse).ToArray(); if (query[0] == 1) { var tmp = rmq[query[1] - 1].Item1; rmq[query[1] - 1] = new Tuple<int, int>(rmq[query[2] - 1].Item1, query[1]); rmq[query[2] - 1] = new Tuple<int, int>(tmp, query[2]); } else { Console.WriteLine(rmq.Query(query[1] - 1, query[2] - 1).Item2); } } } } class SegmentTree<T> { public int Size { get; private set; } T IdentityElement; T[] Data; Func<T, T, T> Merge; int LeafCount; public SegmentTree(int size, T identityElement, Func<T, T, T> merge) : this(Enumerable.Repeat(identityElement, size).ToArray(), identityElement, merge) { } public SegmentTree(T[] elems, T identityElement, Func<T, T, T> merge) { Size = elems.Length; Merge = merge; IdentityElement = identityElement; LeafCount = 1; while (LeafCount < elems.Length) LeafCount <<= 1; Data = new T[LeafCount << 1]; elems.CopyTo(Data, LeafCount); for (int i = elems.Length + LeafCount; i < Data.Length; i++) Data[i] = IdentityElement; for (int i = LeafCount - 1; i >= 1; i--) Data[i] = Merge(Data[i << 1], Data[(i << 1) + 1]); } public T this[int index] { get { return Data[LeafCount + index]; } set { Update(index, value); } } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Update(int i, T x) { i += LeafCount; Data[i] = x; while (0 < (i >>= 1)) Data[i] = Merge(Data[i << 1], Data[(i << 1) + 1]); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public void Operate(int i, T x) { i += LeafCount; Data[i] = Merge(Data[i], x); while (0 < (i >>= 1)) Data[i] = Merge(Data[i << 1], Data[(i << 1) + 1]); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Query(int l, int r) { l += LeafCount; r += LeafCount; T lRes = IdentityElement, rRes = IdentityElement; while (l <= r) { if ((l & 1) == 1) lRes = Merge(lRes, Data[l]); if ((r & 1) == 0) rRes = Merge(Data[r], rRes); l = (l + 1) >> 1; r = (r - 1) >> 1; } return Merge(lRes, rRes); } }