結果
| 問題 |
No.875 Range Mindex Query
|
| コンテスト | |
| ユーザー |
 Grenache
|
| 提出日時 | 2019-09-06 21:36:05 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 409 ms / 2,000 ms |
| コード長 | 6,410 bytes |
| コンパイル時間 | 4,406 ms |
| コンパイル使用メモリ | 80,000 KB |
| 実行使用メモリ | 56,316 KB |
| 最終ジャッジ日時 | 2024-06-24 17:04:12 |
| 合計ジャッジ時間 | 8,293 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 18 |
ソースコード
import java.io.*;
import java.util.*;
public class Main_yukicoder875 {
private static Scanner sc;
private static Printer pr;
private static void solve() {
int n = sc.nextInt();
int q = sc.nextInt();
int[] a = sc.nextIntArray(n);
int[] conv = new int[n + 1];
RMQ rmq = new RMQ(n);
for (int i = 0; i < n; i++) {
int e = a[i];
conv[e] = i;
rmq.update(i, a[i]);
}
for (int i = 0; i < q; i++) {
int query = sc.nextInt();
int l = sc.nextInt() - 1;
int r = sc.nextInt() - 1;
if (query == 1) {
{ int tmp = a[l]; a[l] = a[r]; a[r] = tmp; }
{ int tmp = conv[a[l]]; conv[a[l]] = conv[a[r]]; conv[a[r]] = tmp; }
rmq.update(l, a[l]);
rmq.update(r, a[r]);
} else {
pr.println(conv[rmq.query(l, r + 1)] + 1);
}
}
}
// Range Minimum Query by Segment Tree
static class RMQ {
int[] st;
int n;
final int INF = Integer.MAX_VALUE;
RMQ(int n) {
this.n = 1;
while (this.n < n) {
this.n *= 2;
}
st = new int[2 * this.n - 1];
Arrays.fill(st, INF);
}
// i:0-indexed
void update(int i, int x) {
i = n - 1 + i;
st[i] = x;
while (i > 0) {
i = (i - 1) / 2;
st[i] = Math.min(st[2 * i + 1], st[2 * i + 2]);
}
}
// a, b:0-indexed
// [a, b)
int query(int a, int b) {
return query(a, b, 0, 0, n);
}
private int query(int a, int b, int i, int l, int r) {
if (a >= r || b <= l) {
return INF;
}
if (a <= l && b >= r) {
return st[i];
}
return Math.min(query(a, b, i * 2 + 1, l, (l + r) / 2),
query(a, b, i * 2 + 2, (l + r) / 2, r));
}
}
// ---------------------------------------------------
public static void main(String[] args) {
sc = new Scanner(System.in);
pr = new Printer(System.out);
solve();
pr.close();
sc.close();
}
static class Scanner {
BufferedReader br;
Scanner(InputStream in) {
br = new BufferedReader(new InputStreamReader(in));
}
private boolean isPrintable(int ch) {
return ch >= '!' && ch <= '~';
}
private boolean isCRLF(int ch) {
return ch == '\n' || ch == '\r' || ch == -1;
}
private int nextPrintable() {
try {
int ch;
while (!isPrintable(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
return ch;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
String next() {
try {
int ch = nextPrintable();
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (isPrintable(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
int nextInt() {
try {
// parseInt from Integer.parseInt()
boolean negative = false;
int res = 0;
int limit = -Integer.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Integer.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
int multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
long nextLong() {
try {
// parseLong from Long.parseLong()
boolean negative = false;
long res = 0;
long limit = -Long.MAX_VALUE;
int radix = 10;
int fc = nextPrintable();
if (fc < '0') {
if (fc == '-') {
negative = true;
limit = Long.MIN_VALUE;
} else if (fc != '+') {
throw new NumberFormatException();
}
fc = br.read();
}
long multmin = limit / radix;
int ch = fc;
do {
int digit = ch - '0';
if (digit < 0 || digit >= radix) {
throw new NumberFormatException();
}
if (res < multmin) {
throw new NumberFormatException();
}
res *= radix;
if (res < limit + digit) {
throw new NumberFormatException();
}
res -= digit;
} while (isPrintable(ch = br.read()));
return negative ? res : -res;
} catch (IOException e) {
throw new NoSuchElementException();
}
}
float nextFloat() {
return Float.parseFloat(next());
}
double nextDouble() {
return Double.parseDouble(next());
}
String nextLine() {
try {
int ch;
while (isCRLF(ch = br.read())) {
if (ch == -1) {
throw new NoSuchElementException();
}
}
StringBuilder sb = new StringBuilder();
do {
sb.appendCodePoint(ch);
} while (!isCRLF(ch = br.read()));
return sb.toString();
} catch (IOException e) {
throw new NoSuchElementException();
}
}
int[] nextIntArray(int n) {
int[] ret = new int[n];
for (int i = 0; i < n; i++) {
ret[i] = sc.nextInt();
}
return ret;
}
long[] nextLongArray(int n) {
long[] ret = new long[n];
for (int i = 0; i < n; i++) {
ret[i] = sc.nextLong();
}
return ret;
}
int[][] nextIntArrays(int m, int n) {
int[][] ret = new int[m][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
ret[j][i] = sc.nextInt();
}
}
return ret;
}
void close() {
try {
br.close();
} catch (IOException e) {
// throw new NoSuchElementException();
}
}
}
static class Printer extends PrintWriter {
Printer(OutputStream out) {
super(out);
}
void printInts(int... a) {
StringBuilder sb = new StringBuilder(32);
for (int i = 0, size = a.length; i < size; i++) {
if (i > 0) {
sb.append(' ');
}
sb.append(a[i]);
}
println(sb);
}
void printLongs(long... a) {
StringBuilder sb = new StringBuilder(64);
for (int i = 0, size = a.length; i < size; i++) {
if (i > 0) {
sb.append(' ');
}
sb.append(a[i]);
}
println(sb);
}
void printStrings(String... a) {
StringBuilder sb = new StringBuilder(32);
for (int i = 0, size = a.length; i < size; i++) {
if (i > 0) {
sb.append(' ');
}
sb.append(a[i]);
}
println(sb);
}
}
}