結果

問題 No.875 Range Mindex Query
ユーザー mnznmnzn
提出日時 2020-01-04 15:06:53
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,007 bytes
コンパイル時間 4,832 ms
コンパイル使用メモリ 107,520 KB
実行使用メモリ 36,864 KB
最終ジャッジ日時 2024-11-22 20:25:18
合計ジャッジ時間 9,960 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 27 ms
18,304 KB
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 WA -
testcase_05 AC 33 ms
18,560 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 AC 597 ms
36,608 KB
testcase_17 AC 636 ms
36,864 KB
testcase_18 AC 616 ms
36,608 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;

class Program
{
    static void Main(string[] args)
    {
        var N = sc.ReadInt();
        var Q = sc.ReadInt();
        var A = sc.ReadIntArray(N);
        var seg = new SegmentTree(A);
        var map = new Dictionary<int, int>();
        for (int i = 0; i < N; i++) map[A[i]] = i;
        var res = new List<int>();
        for (int i = 0; i < Q; i++)
        {
            var f = sc.ReadInt();
            var l = sc.ReadInt() - 1;
            var r = sc.ReadInt() - 1;
            if (f == 1)
            {
                seg.Update(l, A[r]);
                seg.Update(r, A[l]);
                map[A[r]] = l;
                map[A[l]] = r;
            }
            else
            {
                var min = seg.Find(l, r + 1);
                var id = map[min] + 1;
                res.Add(id);
            }
        }
        foreach (var ans in res)
        {
            Console.WriteLine(ans);
        }
    }
    static Scanner sc = new Scanner();
}

class Scanner
{
    string[] S = new string[0];
    int Index = 0;
    char[] Separators = new char[] { ' ' };

    public string Next()
    {
        if (this.Index < this.S.Length) return this.S[this.Index++];
        var line = "";
        while (line == "") line = Console.ReadLine();
        this.S = line.Split(this.Separators, StringSplitOptions.RemoveEmptyEntries);
        if (this.S.Length == 0) return this.Next();
        this.Index = 0;
        return this.S[this.Index++];
    }
    public string ReadStr()
    {
        return this.Next();
    }
    public char ReadChar()
    {
        return this.Next()[0];
    }
    public int ReadInt()
    {
        return int.Parse(this.Next());
    }
    public uint ReadUInt()
    {
        return uint.Parse(this.Next());
    }
    public long ReadLong()
    {
        return long.Parse(this.Next());
    }
    public double ReadDouble()
    {
        return double.Parse(this.Next());
    }
    public Tuple<int, int> ReadTup(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<long, long> ReadTupLong(int add = 0)
    {
        return Tuple.Create(this.ReadLong() + add, this.ReadLong() + add);
    }
    public Tuple<int, int, int> ReadTup3(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public Tuple<int, int, int, int> ReadTup4(int add = 0)
    {
        return Tuple.Create(this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add, this.ReadInt() + add);
    }
    public int[] ReadIntArray(int n)
    {
        var array = new int[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadInt();
        }
        return array;
    }
    public long[] ReadLongArray(int n)
    {
        var array = new long[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadLong();
        }
        return array;
    }
    public double[] ReadDoubleArray(int n)
    {
        var array = new double[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadDouble();
        }
        return array;
    }
    public char[] ReadCharArray(int n)
    {
        var array = new char[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadChar();
        }
        return array;
    }
    public string[] ReadStrArray(int n)
    {
        var array = new string[n];
        for (int i = 0; i < array.Length; i++)
        {
            array[i] = this.ReadStr();
        }
        return array;
    }
    public Tuple<long, long>[] ReadTupLongArray(int n, int add = 0)
    {
        var array = new Tuple<long, long>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTupLong(add);
        }
        return array;
    }
    public Tuple<int, int>[] ReadTupArray(int n, int add = 0)
    {
        var array = new Tuple<int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup(add);
        }
        return array;
    }
    public Tuple<int, int, int>[] ReadTup3Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup3(add);
        }
        return array;
    }
    public Tuple<int, int, int, int>[] ReadTup4Array(int n, int add = 0)
    {
        var array = new Tuple<int, int, int, int>[n];
        for (int i = 0; i < n; i++)
        {
            array[i] = this.ReadTup4(add);
        }
        return array;
    }
}


class SegmentTree
{
    public int N { get; set; }
    public int[] Node { get; set; }
    public static int INF = int.MaxValue;
    public SegmentTree(int[] a)
    {
        N = 1;
        while (N < a.Length) N *= 2;
        this.Node = new int[2 * N - 1];
        for (int i = 0; i < this.Node.Length; i++) this.Node[i] = INF;

        for (int i = 0; i < a.Length; i++) this.Node[N + i - 1] = a[i];
        for (int i = N - 2; i >= 0; i--)
        {
            this.Node[i] = this.Compare(this.Node[2 * i + 1], this.Node[2 * i + 2]);
        }
    }
    public void Update(int x, int v)
    {
        x += (this.N - 1);
        this.Node[x] = v;
        while (x > 0)
        {
            x = (x - 1) / 2;
            this.Node[x] = this.Compare(this.Node[2 * x + 1], this.Node[2 * x + 2]);
        }
    }
    public int Find(int a, int b)
    {
        return this.Find(a, b, 0, 0, this.N);
    }
    public int Find(int a, int b, int k = 0, int l = 0, int r = -1)
    {
        if (r <= a || b <= l) return INF;
        if (a <= l && r <= b) return this.Node[k];
        var vl = this.Find(a, b, 2 * k + 1, l, (l + r) / 2);
        var vr = this.Find(a, b, 2 * k + 2, (l + r) / 2, r);
        return this.Compare(vl, vr);
    }
    private int Compare(int a, int b)
    {
        return Math.Min(a, b);
    }
}
0