結果

問題 No.876 Range Compress Query
ユーザー hiromi_ayasehiromi_ayase
提出日時 2019-09-06 21:46:30
言語 Java21
(openjdk 21)
結果
AC  
実行時間 726 ms / 2,000 ms
コード長 5,607 bytes
コンパイル時間 2,470 ms
コンパイル使用メモリ 87,620 KB
実行使用メモリ 68,760 KB
最終ジャッジ日時 2024-06-24 17:26:12
合計ジャッジ時間 10,181 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 74 ms
51,388 KB
testcase_01 AC 108 ms
52,500 KB
testcase_02 AC 81 ms
51,272 KB
testcase_03 AC 137 ms
52,796 KB
testcase_04 AC 97 ms
52,740 KB
testcase_05 AC 88 ms
51,520 KB
testcase_06 AC 124 ms
53,052 KB
testcase_07 AC 121 ms
52,608 KB
testcase_08 AC 124 ms
53,524 KB
testcase_09 AC 107 ms
52,296 KB
testcase_10 AC 108 ms
52,360 KB
testcase_11 AC 709 ms
66,468 KB
testcase_12 AC 641 ms
66,376 KB
testcase_13 AC 658 ms
66,860 KB
testcase_14 AC 714 ms
66,260 KB
testcase_15 AC 604 ms
65,560 KB
testcase_16 AC 687 ms
66,956 KB
testcase_17 AC 698 ms
68,760 KB
testcase_18 AC 726 ms
67,180 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;

class SegmentTreeRSQ {
  public int M, H, N;
  public long[] st;
  public long[] plus;

  public SegmentTreeRSQ(int n) {
    N = n;
    M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
    H = M >>> 1;
    st = new long[M];
    plus = new long[H];
  }

  public SegmentTreeRSQ(int[] a) {
    N = a.length;
    M = Integer.highestOneBit(Math.max(N - 1, 1)) << 2;
    H = M >>> 1;
    st = new long[M];
    plus = new long[H];
    for (int i = 0; i < N; i++) {
      st[H + i] = a[i];
    }
    for (int i = (M >> 1) - 1; i >= 1; i--) {
      propagate(i);
    }
  }

  public void add(int pos, int v) {
    for (int i = H + pos; i >= 1; i >>>= 1) {
      st[i] += v;
    }
  }

  private void propagate(int i) {
    int count = H / Integer.highestOneBit(i);
    st[i] = st[2 * i] + st[2 * i + 1] + plus[i] * count;
  }

  public void add(int l, int r, int v) {
    if (l < r)
      add(l, r, v, 0, H, 1);
  }

  private void add(int l, int r, int v, int cl, int cr, int cur) {
    if (cur >= H) {
      st[cur] += v;
    } else if (l <= cl && cr <= r) {
      plus[cur] += v;
      propagate(cur);
    } else {
      int mid = cl + cr >>> 1;
      if (cl < r && l < mid) {
        add(l, r, v, cl, mid, 2 * cur);
      }
      if (mid < r && l < cr) {
        add(l, r, v, mid, cr, 2 * cur + 1);
      }
      propagate(cur);
    }
  }

  private long gsum;

  public long sum(int l, int r) {
    gsum = 0;
    sum(l, r, 0, H, 1);
    return gsum;
  }

  private void sum(int l, int r, int cl, int cr, int cur) {
    if (l <= cl && cr <= r) {
      gsum += st[cur];
    } else {
      int mid = cl + cr >>> 1;
      if (cl < r && l < mid) {
        sum(l, r, cl, mid, 2 * cur);
      }
      if (mid < r && l < cr) {
        sum(l, r, mid, cr, 2 * cur + 1);
      }
      gsum += plus[cur] * (Math.min(r, cr) - Math.max(l, cl));
    }
  }
}



public class Main {

  private static void solve() {
    int n = ni();
    int q = ni();
    int[] a = na(n);
    int[] b = new int[n - 1];
    for (int i = 0; i < n - 1; i++) {
      b[i] = a[i] == a[i + 1] ? 0 : 1;
    }
    SegmentTreeRSQ sta = new SegmentTreeRSQ(a);
    SegmentTreeRSQ stb = new SegmentTreeRSQ(b);


    for (int i = 0; i < q; i++) {
      int t = ni();
      int l = ni() - 1;
      int r = ni() - 1;

      if (t == 1) {
        int v = ni();

        long lv = sta.sum(l, l + 1);
        long rv = sta.sum(r, r + 1);
        if (l > 0) {
          long lpv = sta.sum(l - 1, l);
          if (lpv == lv) {
            stb.add(l - 1, 1);
          } else if (lpv == lv + v) {
            stb.add(l - 1, -1);
          }
        }
        if (r < n - 1) {
          long rnv = sta.sum(r + 1, r + 2);
          if (rnv == rv) {
            stb.add(r, 1);
          } else if (rnv == rv + v) {
            stb.add(r, -1);
          }
        }

        sta.add(l, r + 1, v);
      } else {
        out.println(stb.sum(l, r) + 1);
      }
      // System.out.println(t + " " + l + " " + r);
      // dump(sta);
      // dump(stb);
      // System.out.println();
    }

  }

  private static void dump(SegmentTreeRSQ st) {
    long[] a = new long[st.N];
    for (int i = 0; i < st.N; i++) {
      a[i] = st.sum(i, i + 1);
    }
    System.out.println(Arrays.toString(a));
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0