結果
問題 | No.875 Range Mindex Query |
ユーザー | kusomushi |
提出日時 | 2019-09-08 02:58:29 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 589 ms / 2,000 ms |
コード長 | 5,830 bytes |
コンパイル時間 | 2,550 ms |
コンパイル使用メモリ | 82,060 KB |
実行使用メモリ | 50,012 KB |
最終ジャッジ日時 | 2024-06-27 14:50:36 |
合計ジャッジ時間 | 10,212 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 58 ms
37,108 KB |
testcase_01 | AC | 88 ms
38,912 KB |
testcase_02 | AC | 105 ms
39,024 KB |
testcase_03 | AC | 71 ms
38,416 KB |
testcase_04 | AC | 91 ms
38,284 KB |
testcase_05 | AC | 86 ms
38,520 KB |
testcase_06 | AC | 92 ms
39,436 KB |
testcase_07 | AC | 95 ms
39,540 KB |
testcase_08 | AC | 91 ms
38,560 KB |
testcase_09 | AC | 81 ms
38,280 KB |
testcase_10 | AC | 98 ms
39,056 KB |
testcase_11 | AC | 530 ms
49,760 KB |
testcase_12 | AC | 500 ms
49,388 KB |
testcase_13 | AC | 473 ms
49,796 KB |
testcase_14 | AC | 465 ms
49,520 KB |
testcase_15 | AC | 549 ms
49,764 KB |
testcase_16 | AC | 584 ms
49,876 KB |
testcase_17 | AC | 581 ms
50,012 KB |
testcase_18 | AC | 589 ms
49,500 KB |
ソースコード
import java.io.*; import java.util.Arrays; import java.util.StringJoiner; import java.util.StringTokenizer; import java.util.function.Function; import java.util.function.IntBinaryOperator; public class Main { static int N, Q; static int[] A; public static void main(String[] args) { FastScanner sc = new FastScanner(System.in); N = sc.nextInt(); Q = sc.nextInt(); A = sc.nextIntArray(N); PrintWriter pw = new PrintWriter(System.out); RangeMaxIndex seg = new RangeMaxIndex(N, (ai, bi) -> { if( ai >= N && bi >= N ) return ai; if( ai >= N ) return bi; if( bi >= N ) return ai; int av = A[ai]; int bv = A[bi]; if( av < bv ) { return ai; } else { return bi; } }); for (int i = 0; i < Q; i++) { int t = sc.nextInt(); int l = sc.nextInt()-1; int r = sc.nextInt()-1; if( t == 1 ) { int temp = A[l]; A[l] = A[r]; A[r] = temp; seg.update(l); seg.update(r); } else { pw.println( seg.query(l, r+1)+1 ); } } pw.flush(); } static class RangeMaxIndex { int size; int[] indice; IntBinaryOperator compare; RangeMaxIndex(int size, IntBinaryOperator compare) { this.size = 1; while( this.size < size ) this.size *= 2; this.indice = new int[this.size*2]; this.compare = compare; init(); } void init() { for (int i = 0; i < size; i++) { indice[i+size] = i; } for (int i = size-1; i >= 1; i--) { indice[i] = compare.applyAsInt(indice[i*2], indice[i*2+1]); } } void update(int idx) { idx += size; while(idx > 0) { idx /= 2; indice[idx] = compare.applyAsInt(indice[idx*2], indice[idx*2+1]); } } // [from, to) int query(int from, int to) { return _query(from, to, 1, 0, size); } int _query(int from, int to, int idx, int l, int r) { if (r <= from || to <= l) return size; if (from <= l && r <= to) { return indice[idx]; } else { int mid = (l+r)/2; int vl = _query(from, to, idx*2, l, mid); int vr = _query(from, to, idx*2+1, mid, r); return compare.applyAsInt(vl, vr); } } } @SuppressWarnings("unused") static class FastScanner { private BufferedReader reader; private StringTokenizer tokenizer; FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } long nextLong() { return Long.parseLong(next()); } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } int[] nextIntArray(int n, int delta) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt() + delta; return a; } long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } } static <A> void writeLines(A[] as, Function<A, String> f) { PrintWriter pw = new PrintWriter(System.out); for (A a : as) { pw.println(f.apply(a)); } pw.flush(); } static void writeLines(int[] as) { PrintWriter pw = new PrintWriter(System.out); for (int a : as) pw.println(a); pw.flush(); } static void writeLines(long[] as) { PrintWriter pw = new PrintWriter(System.out); for (long a : as) pw.println(a); pw.flush(); } static int max(int... as) { int max = Integer.MIN_VALUE; for (int a : as) max = Math.max(a, max); return max; } static int min(int... as) { int min = Integer.MAX_VALUE; for (int a : as) min = Math.min(a, min); return min; } static void debug(Object... args) { StringJoiner j = new StringJoiner(" "); for (Object arg : args) { if (arg instanceof int[]) j.add(Arrays.toString((int[]) arg)); else if (arg instanceof long[]) j.add(Arrays.toString((long[]) arg)); else if (arg instanceof double[]) j.add(Arrays.toString((double[]) arg)); else if (arg instanceof Object[]) j.add(Arrays.toString((Object[]) arg)); else j.add(arg.toString()); } System.err.println(j.toString()); } }