結果

問題 No.875 Range Mindex Query
ユーザー eSeFeSeF
提出日時 2019-12-07 15:20:10
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 709 ms / 2,000 ms
コード長 8,567 bytes
コンパイル時間 2,183 ms
コンパイル使用メモリ 66,236 KB
実行使用メモリ 38,300 KB
最終ジャッジ日時 2023-08-26 19:17:30
合計ジャッジ時間 9,403 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
23,800 KB
testcase_01 AC 64 ms
23,960 KB
testcase_02 AC 63 ms
21,836 KB
testcase_03 AC 55 ms
21,800 KB
testcase_04 AC 63 ms
22,072 KB
testcase_05 AC 63 ms
21,988 KB
testcase_06 AC 64 ms
23,964 KB
testcase_07 AC 65 ms
21,904 KB
testcase_08 AC 64 ms
21,888 KB
testcase_09 AC 64 ms
22,020 KB
testcase_10 AC 66 ms
22,000 KB
testcase_11 AC 493 ms
34,800 KB
testcase_12 AC 421 ms
33,376 KB
testcase_13 AC 352 ms
37,904 KB
testcase_14 AC 348 ms
37,620 KB
testcase_15 AC 476 ms
38,084 KB
testcase_16 AC 709 ms
38,188 KB
testcase_17 AC 685 ms
38,300 KB
testcase_18 AC 701 ms
36,260 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Text;
using static System.Math;
using static System.Array;
using static AtCoder.Tool;
namespace AtCoder
{
    class AC
    {
        const int MOD = 1000000007;
        const int INF = int.MaxValue / 2;
        const long SINF = long.MaxValue / 2;
        const double EPS = 1e-8;
        static readonly int[] dx = { 0, 1, 0, -1 };
        static readonly int[] dy = { 1, 0, -1, 0 };
        //static List<List<int>> G = new List<List<int>>();
        //static List<List<Edge>>G = new List<List<Edge>>();
        //static List<Edge> E = new List<Edge>();

        static void Main(string[] args)
        {
            //var sw = new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false };
            //Console.SetOut(sw);
            var cin = new Scanner();
            var input = cin.ReadSplit();
            int N = input[0];
            int Q = input[1];
            var a = cin.ReadSplit();
            var Seg = new SegmentTree<Pair<int, int>>(N, Fun, new Pair<int, int>(INF, -1));
            for(var i = 0; i < N; i++)
            {
                Seg.Assign(i, new Pair<int, int>(a[i], i + 1));
            }
            Seg.Set_All();

            for(var i = 0; i < Q; i++)
            {
                var p = cin.ReadSplit();
                int l = p[1] - 1;
                int r = p[2] - 1;
                if (p[0] == 1)
                {
                    var pl = Seg.Look(l);
                    var pr = Seg.Look(r);
                    Seg.UpdateQuery(l, new Pair<int, int>(pr.first, l + 1));
                    Seg.UpdateQuery(r, new Pair<int, int>(pl.first, r + 1));
                }
                else
                {
                    Console.WriteLine(Seg.AnswerQuery(l, r + 1).second);
                }
            }

            //Console.Out.Flush();
        }
        static Pair<int, int> Fun(Pair<int, int> p1, Pair<int, int> p2)
        {
            return p1.first < p2.first ? p1 : p2;
        }

        struct Edge
        {
            public int from;

            public int to;
            public long dist;
            public Edge(int t, long c)
            {
                from = -1;
                to = t;
                dist = c;
            }
            public Edge(int f, int t, long c)
            {
                from = f;
                to = t;
                dist = c;
            }

        }
        struct Pair<T, U> : IComparable<Pair<T, U>>
        where T : IComparable<T>
        where U : IComparable<U>
        {
            public T first;
            public U second;
            private readonly bool CompWithFirst;

            public Pair(T f, U s, int comp)
            {
                first = f;
                second = s;
                CompWithFirst = comp == 1;
            }
            public Pair(T f, U s)
            {
                first = f;
                second = s;
                CompWithFirst = true;
            }

            public int CompareTo(Pair<T, U> other)
            {
                return CompWithFirst ? first.CompareTo(other.first) : second.CompareTo(other.second);
            }
        }
    }

    public class PriorityQueue<T> where T : IComparable<T>
    {

        public readonly List<T> Q;
        private readonly int r;

        public PriorityQueue(bool ascending)
        {
            if (ascending)
            {
                r = 1;
            }
            else
            {
                r = -1;
            }
            Q = new List<T>();
        }


        private void PushHeap(List<T> list, T item)
        {
            int n = list.Count();
            list.Add(item);

            while (n != 0)
            {
                int pIndex = (n - 1) / 2;

                if (list[n].CompareTo(list[pIndex]) * r > 0)
                {
                    Swap(Q, n, pIndex);
                }
                else { break; }

                n = pIndex;
            }
        }

        private void PopHeap(List<T> list)
        {
            int n = list.Count() - 1;
            list[0] = list[n];
            list.RemoveAt(n);

            int cur = 0;
            int comp;

            while (2 * cur + 1 <= n - 1)
            {
                int c1 = 2 * cur + 1;
                int c2 = 2 * (cur + 1);
                if (c1 == n - 1)
                {
                    comp = c1;
                }
                else
                {
                    comp = list[c1].CompareTo(list[c2]) * r > 0 ? c1 : c2;
                }

                if (list[cur].CompareTo(list[comp]) * r < 0)
                {
                    Swap(Q, cur, comp);
                }
                else { break; }

                cur = comp;
            }
        }

        private void Swap(List<T> list, int a, int b)
        {
            T keep = list[a];
            list[a] = list[b];
            list[b] = keep;
        }



        public void Enqueue(T value)
        {
            PushHeap(Q, value);
        }

        public T Dequeue()
        {
            T ret = Q[0];
            PopHeap(Q);
            return ret;
        }

        public T Peek()
        {
            return Q[0];
        }

        public int Count()
        {
            return Q.Count();
        }

        public bool Contains(T obj)
        {
            return Q.Contains(obj);
        }
    }
    public class Scanner
    {
        public int[] ReadSplit()
        {
            int[] array = Console.ReadLine().Split().Select(int.Parse).ToArray();
            return array;
        }
        public long[] ReadSplitL()
        {
            long[] array = Console.ReadLine().Split().Select(long.Parse).ToArray();
            return array;
        }
    }
    public static class Tool
    {
        static public void Initialize<T>(ref T[] array, T initialvalue)
        {
            for (var i = 0; i < array.Length; i++)
            {
                array[i] = initialvalue;
            }
        }
        static public void Swap<T>(ref T a, ref T b)
        {
            T keep = a;
            a = b;
            b = keep;
        }

        static public void Display<T>(T[,] array2d, int n, int m)
        {
            for (var i = 0; i < n; i++)
            {
                for (var j = 0; j < m; j++)
                {
                    Console.Write($"{array2d[i, j]} ");
                }
                Console.WriteLine();
            }
        }

    }

    public class SegmentTree<T>
    {
        int n;
        T[] Tree;
        Func<T, T, T> f;
        T ex;
        public SegmentTree(int size, Func<T, T, T> fun, T exvalue)
        {
            f = fun;
            ex = exvalue;
            n = 1;
            while (n < size) n <<= 1;
            Tree = new T[(n << 1) - 1];
            for (var i = 0; i < Tree.Length; i++) Tree[i] = ex;
        }
        public SegmentTree(int size, Func<T, T, T> f, T exvalue, T initial) : this(size, f, exvalue)
        {
            for (var i = 0; i < size; i++) Tree[i + n - 1] = initial;
            Set_All();
        }

        public void Set_All()
        {
            for(var i = n - 2; i >= 0; i--)
            {
                Tree[i] = f(Tree[(i << 1) + 1], Tree[(i << 1) + 2]);
            }
        }

        public void Assign(int ind, T val)
        {
            Tree[ind + n - 1] = val;
        }
        public void Update(int ind)
        {
            int i = ind + n - 1;
            while (i > 0)
            {
                i = (i - 1) >> 1;
                Tree[i] = f(Tree[(i << 1) + 1], Tree[(i << 1) + 2]);
            }
        }

        public void UpdateQuery(int ind,T val)
        {
            Assign(ind, val);
            Update(ind);
        }
        public T AnswerQuery(int l,int r) //[l,r)
        {
            return Scanning(l, r, 0, 0, n);
        }
        private T Scanning(int l, int r, int ind, int ind_l, int ind_r)
        {
            if (ind_r <= l || r <= ind_l) { return ex; }
            if (l <= ind_l && ind_r <= r) { return Tree[ind]; }
            return f(Scanning(l, r, (ind << 1) + 1, ind_l, (ind_l + ind_r) >> 1), Scanning(l, r, (ind << 1) + 2, (ind_l + ind_r) >> 1, ind_r));
        }

        public T Look(int ind)
        {
            return Tree[ind + n - 1];
        }
        public void Debug_Display_All()
        {
            for (var i = 0; i < n; i++) Console.Write($"{Tree[i + n - 1]} ");
            Console.WriteLine();
        }
    }
}
0