#348837 (Java) No.833 かっこいい電車

• 問題: No.833 かっこいい電車
• ユーザー: hiromi_ayase
• 提出日時: 2019-05-25 04:39:37
• 言語: Java (openjdk 23)
• 結果: AC
• 実行時間: 495 ms / 2,000 ms
• コード長: 7,693 bytes
• コンパイル時間: 3,366 ms
• コンパイル使用メモリ: 91,704 KB
• 実行使用メモリ: 54,724 KB
• 最終ジャッジ日時: 2024-07-02 03:53:47
• 合計ジャッジ時間: 14,756 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

ファイルパターン	結果
sample	AC * 2
other	AC * 30

ソースコード

import java.util.ArrayList;
import java.util.List;

class LST {
  public long[][] set;
  public int n;
//public int size;
  
  public LST(int n) {
      this.n = n;
      int d = 1;
      for(int m = n;m > 1;m>>>=6, d++);
      
      set = new long[d][];
      for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
          set[i] = new long[m+1];
      }
//    size = 0;
  }
  
  // [0,r)
  public LST setRange(int r)
  {
      for(int i = 0;i < set.length;i++, r=r+63>>>6){
          for(int j = 0;j < r>>>6;j++){
              set[i][j] = -1L;
          }
          if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
      }
      return this;
  }
  
  // [0,r)
  public LST unsetRange(int r)
  {
      if(r >= 0){
          for(int i = 0;i < set.length;i++, r=r+63>>>6){
              for(int j = 0;j < r+63>>>6;j++){
                  set[i][j] = 0;
              }
              if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
          }
      }
      return this;
  }
  
  public LST set(int pos)
  {
      if(pos >= 0 && pos < n){
//        if(!get(pos))size++;
          for(int i = 0;i < set.length;i++, pos>>>=6){
              set[i][pos>>>6] |= 1L<<pos;
          }
      }
      return this;
  }
  
  public LST unset(int pos)
  {
      if(pos >= 0 && pos < n){
//        if(get(pos))size--;
          for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
              set[i][pos>>>6] &= ~(1L<<pos);
          }
      }
      return this;
  }
  
  public boolean get(int pos)
  {
      return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
  }
  
  public int prev(int pos)
  {
      for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
          int pre = prev(set[i][pos>>>6], pos&63);
          if(pre != -1){
              pos = pos>>>6<<6|pre;
              while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
              return pos;
          }
      }
      return -1;
  }
  
  public int next(int pos)
  {
      for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
          int nex = next(set[i][pos>>>6], pos&63);
          if(nex != -1){
              pos = pos>>>6<<6|nex;
              while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
              return pos;
          }
      }
      return -1;
  }
  
  private static int prev(long set, int n)
  {
      long h = Long.highestOneBit(set<<~n);
      if(h == 0L)return -1;
      return Long.numberOfTrailingZeros(h)-(63-n);
  }
  
  private static int next(long set, int n)
  {
      long h = Long.lowestOneBit(set>>>n);
      if(h == 0L)return -1;
      return Long.numberOfTrailingZeros(h)+n;
  }
  
  @Override
  public String toString()
  {
      List<Integer> list = new ArrayList<Integer>();
      for(int pos = next(0);pos != -1;pos = next(pos+1)){
          list.add(pos);
      }
      return list.toString();
  }
}
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);
    LST lst = new LST(n + 1);
    SegmentTreeRSQ st = new SegmentTreeRSQ(a);
    lst.setRange(n + 1);

    for (int i = 0; i < q; i ++) {
      int qr = ni();
      int x = ni() - 1;
      if (qr == 1) {
        lst.unset(x + 1);
      } else if (qr == 2) {
        lst.set(x + 1);
      } else if (qr == 3) {
        st.add(x, 1);
      } else {
        out.println(st.sum(lst.prev(x), lst.next(x + 1)));
      }
    }
  }

  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));
  }
}