結果
問題 | No.876 Range Compress Query |
ユーザー | uwi |
提出日時 | 2019-09-06 21:28:09 |
言語 | Java19 (openjdk 21) |
結果 |
AC
|
実行時間 | 224 ms / 2,000 ms |
コード長 | 4,264 bytes |
コンパイル時間 | 7,490 ms |
コンパイル使用メモリ | 81,828 KB |
実行使用メモリ | 44,092 KB |
最終ジャッジ日時 | 2023-09-06 22:32:30 |
合計ジャッジ時間 | 8,218 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 39 ms
33,320 KB |
testcase_01 | AC | 44 ms
33,440 KB |
testcase_02 | AC | 40 ms
33,804 KB |
testcase_03 | AC | 45 ms
33,360 KB |
testcase_04 | AC | 41 ms
33,804 KB |
testcase_05 | AC | 40 ms
33,712 KB |
testcase_06 | AC | 46 ms
33,748 KB |
testcase_07 | AC | 44 ms
33,328 KB |
testcase_08 | AC | 44 ms
33,668 KB |
testcase_09 | AC | 43 ms
33,768 KB |
testcase_10 | AC | 43 ms
33,440 KB |
testcase_11 | AC | 213 ms
43,528 KB |
testcase_12 | AC | 208 ms
40,892 KB |
testcase_13 | AC | 210 ms
40,756 KB |
testcase_14 | AC | 224 ms
43,504 KB |
testcase_15 | AC | 185 ms
40,024 KB |
testcase_16 | AC | 219 ms
43,152 KB |
testcase_17 | AC | 212 ms
43,376 KB |
testcase_18 | AC | 218 ms
44,092 KB |
ソースコード
package contest190906; 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 B { InputStream is; PrintWriter out; String INPUT = ""; void solve() { int n = ni(), Q = ni(); int[] a = na(n); long[] ft = new long[n+5]; long[] bal = new long[n+5]; for(int i = 0;i < n;i++){ addFenwick(ft, i, a[i]); addFenwick(ft, i+1, -a[i]); } for(int i = 0;i < n-1;i++){ if(a[i] != a[i+1]){ addFenwick(bal, i, 1); } } for(int z = 0;z < Q;z++){ int t = ni(); if(t == 1){ int l = ni()-1, r = ni()-1; int v = ni(); if(l-1 >= 0 && sumFenwick(ft, l-1) != sumFenwick(ft, l)){ addFenwick(bal, l-1, -1); } if(r+1 < n && sumFenwick(ft, r) != sumFenwick(ft, r+1)){ addFenwick(bal, r, -1); } addFenwick(ft, l, v); addFenwick(ft, r+1, -v); if(l-1 >= 0 && sumFenwick(ft, l-1) != sumFenwick(ft, l)){ addFenwick(bal, l-1, 1); } if(r+1 < n && sumFenwick(ft, r) != sumFenwick(ft, r+1)){ addFenwick(bal, r, 1); } }else{ int l = ni()-1, r = ni()-1; out.println(sumFenwick(bal, r-1) - sumFenwick(bal, l-1) + 1); } } } public static long sumFenwick(long[] ft, int i) { long sum = 0; for(i++;i > 0;i -= i&-i)sum += ft[i]; return sum; } public static void addFenwick(long[] ft, int i, long v) { if(v == 0)return; int n = ft.length; for(i++;i < n;i += i&-i)ft[i] += v; } 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 B().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)); } }