#413867 (C#(csc)) No.875 Range Mindex Query

• 問題: No.875 Range Mindex Query
• ユーザー: mnzn
• 提出日時: 2020-01-03 15:53:32
• 言語: C#(csc) (csc 3.9.0)
• 結果: WA
• 実行時間: -
• コード長: 5,854 bytes
• コンパイル時間: 5,249 ms
• コンパイル使用メモリ: 107,392 KB
• 実行使用メモリ: 32,000 KB
• 最終ジャッジ日時: 2024-11-22 19:11:39
• 合計ジャッジ時間: 5,760 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

ファイルパターン	結果
sample	AC * 1
other	WA * 18

コンパイルメッセージ

Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Text.RegularExpressions;

class Program
{
    static void Main(string[] args)
    {
        var N = sc.ReadInt();
        var Q = sc.ReadInt();
        var A = sc.ReadIntArray(N);
        var minl = new int[N + 1];
        for (int i = 1; i < N; i++)
        {
            minl[i] = Math.Min(minl[i - 1], A[i - 1]);
        }

        var res = new List<int>();
        var seg = new SegmentTree(A);
        for (int i = 0; i < Q; i++)
        {
            var x = sc.ReadInt();
            var l = sc.ReadInt();
            var r = sc.ReadInt();
            if (x == 1)
            {
                seg.Update(l, A[r - 1]);
                seg.Update(r, A[l - 1]);
            }
            else
            {
                var ans = seg.Query(l, r) + 1;
                res.Add(ans);
            }
        }

        foreach (var item in res)
        {
            Console.WriteLine(item);
        }
    }
    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 < a.Length; i++) this.Node[N + i] = a[i];
        for (int i = N - 2; i >= 0; i--)
        {
            this.Node[i] = Math.Min(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] = Math.Min(this.Node[2 * x + 1], this.Node[2 * x + 2]);
        }
    }
    public int Query(int a, int b)
    {
        return this.Query(a, b, 0, 0, this.N);
    }
    public int Query(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.Query(a, b, 2 * k + 1, l, (l + r) / 2);
        var vr = this.Query(a, b, 2 * k + 2, (l + r) / 2, r);
        return Math.Min(vl, vr);
    }
}