結果
問題 | No.905 Sorted? |
ユーザー | uwi |
提出日時 | 2019-10-11 21:28:40 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 334 ms / 2,000 ms |
コード長 | 5,796 bytes |
コンパイル時間 | 6,795 ms |
コンパイル使用メモリ | 79,444 KB |
実行使用メモリ | 68,544 KB |
最終ジャッジ日時 | 2023-08-16 17:08:44 |
合計ジャッジ時間 | 11,749 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
49,288 KB |
testcase_01 | AC | 47 ms
49,356 KB |
testcase_02 | AC | 46 ms
49,304 KB |
testcase_03 | AC | 44 ms
49,280 KB |
testcase_04 | AC | 44 ms
47,740 KB |
testcase_05 | AC | 57 ms
49,328 KB |
testcase_06 | AC | 52 ms
49,176 KB |
testcase_07 | AC | 72 ms
51,200 KB |
testcase_08 | AC | 261 ms
57,384 KB |
testcase_09 | AC | 191 ms
57,144 KB |
testcase_10 | AC | 290 ms
68,544 KB |
testcase_11 | AC | 246 ms
59,812 KB |
testcase_12 | AC | 245 ms
59,856 KB |
testcase_13 | AC | 253 ms
61,364 KB |
testcase_14 | AC | 334 ms
66,852 KB |
testcase_15 | AC | 235 ms
61,684 KB |
testcase_16 | AC | 252 ms
64,948 KB |
testcase_17 | AC | 247 ms
60,576 KB |
testcase_18 | AC | 229 ms
60,128 KB |
testcase_19 | AC | 44 ms
49,324 KB |
testcase_20 | AC | 44 ms
49,244 KB |
testcase_21 | AC | 44 ms
49,420 KB |
testcase_22 | AC | 44 ms
49,120 KB |
ソースコード
package contest1910; import java.io.ByteArrayInputStream; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.InputMismatchException; public class C { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(); long[] a = new long[n]; for(int i = 0;i < n;i++) { a[i] = nl(); } long[] b = new long[n-1]; long[] rb = new long[n-1]; for(int i = 0;i < n-1;i++) { b[i] = a[i+1] - a[i]; rb[i] = -(a[i+1] - a[i]); } SegmentTreeRMQL st = new SegmentTreeRMQL(b); SegmentTreeRMQL rst = new SegmentTreeRMQL(rb); for(int Q = ni();Q > 0;Q--) { int l = ni(), r = ni(); if(l == r) { out.println("1 1"); }else { if(st.minx(l, r) >= 0) { out.print(1); }else { out.print(0); } out.print(" "); if(rst.minx(l, r) >= 0) { out.print(1); }else { out.print(0); } out.println(); } } } public static class SegmentTreeRMQL { public int M, H, N; public long[] st; public SegmentTreeRMQL(int n) { N = n; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new long[M]; Arrays.fill(st, 0, M, Long.MAX_VALUE); } public SegmentTreeRMQL(long[] a) { N = a.length; M = Integer.highestOneBit(Math.max(N-1, 1))<<2; H = M>>>1; st = new long[M]; for(int i = 0;i < N;i++){ st[H+i] = a[i]; } Arrays.fill(st, H+N, M, Long.MAX_VALUE); for(int i = H-1;i >= 1;i--)propagate(i); } public void update(int pos, long x) { st[H+pos] = x; for(int i = (H+pos)>>>1;i >= 1;i >>>= 1)propagate(i); } private void propagate(int i) { st[i] = Math.min(st[2*i], st[2*i+1]); } public long minx(int l, int r){ long min = Long.MAX_VALUE; if(l >= r)return min; while(l != 0){ int f = l&-l; if(l+f > r)break; long v = st[(H+l)/f]; if(v < min)min = v; l += f; } while(l < r){ int f = r&-r; long v = st[(H+r)/f-1]; if(v < min)min = v; r -= f; } return min; } public long min(int l, int r){ return l >= r ? 0 : min(l, r, 0, H, 1);} private long min(int l, int r, int cl, int cr, int cur) { if(l <= cl && cr <= r){ return st[cur]; }else{ int mid = cl+cr>>>1; long ret = Long.MAX_VALUE; if(cl < r && l < mid){ ret = Math.min(ret, min(l, r, cl, mid, 2*cur)); } if(mid < r && l < cr){ ret = Math.min(ret, min(l, r, mid, cr, 2*cur+1)); } return ret; } } public int firstle(int l, long v) { int cur = H+l; while(true){ if(st[cur] <= v){ if(cur < H){ cur = 2*cur; }else{ return cur-H; } }else{ cur++; if((cur&cur-1) == 0)return -1; if((cur&1)==0)cur>>>=1; } } } public int lastle(int l, long v) { int cur = H+l; while(true){ if(st[cur] <= v){ if(cur < H){ cur = 2*cur+1; }else{ return cur-H; } }else{ if((cur&cur-1) == 0)return -1; cur--; if((cur&1)==1)cur>>>=1; } } } } void run() throws Exception { is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes()); out = new PrintWriter(System.out); long s = System.currentTimeMillis(); solve(); out.flush(); if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){ // @Override // public void run() { // long s = System.currentTimeMillis(); // solve(); // out.flush(); // if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms"); // } // }; // t.start(); // t.join(); } public static void main(String[] args) throws Exception { new C().run(); } private byte[] inbuf = new byte[1024]; public int lenbuf = 0, ptrbuf = 0; private int readByte() { if(lenbuf == -1)throw new InputMismatchException(); if(ptrbuf >= lenbuf){ ptrbuf = 0; try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); } if(lenbuf <= 0)return -1; } return inbuf[ptrbuf++]; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; } private double nd() { return Double.parseDouble(ns()); } private char nc() { return (char)skip(); } private String ns() { int b = skip(); StringBuilder sb = new StringBuilder(); while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ') sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } private char[] ns(int n) { char[] buf = new char[n]; int b = skip(), p = 0; while(p < n && !(isSpaceChar(b))){ buf[p++] = (char)b; b = readByte(); } return n == p ? buf : Arrays.copyOf(buf, p); } private int[] na(int n) { int[] a = new int[n]; for(int i = 0;i < n;i++)a[i] = ni(); return a; } private long[] nal(int n) { long[] a = new long[n]; for(int i = 0;i < n;i++)a[i] = nl(); return a; } private char[][] nm(int n, int m) { char[][] map = new char[n][]; for(int i = 0;i < n;i++)map[i] = ns(m); return map; } private int[][] nmi(int n, int m) { int[][] map = new int[n][]; for(int i = 0;i < n;i++)map[i] = na(m); return map; } private int ni() { return (int)nl(); } private long nl() { long num = 0; int b; boolean minus = false; while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')); if(b == '-'){ minus = true; b = readByte(); } while(true){ if(b >= '0' && b <= '9'){ num = num * 10 + (b - '0'); }else{ return minus ? -num : num; } b = readByte(); } } private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); } }