結果

問題 No.694 square1001 and Permutation 3
ユーザー hiromi_ayasehiromi_ayase
提出日時 2018-06-08 23:56:06
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,371 ms / 3,000 ms
コード長 5,493 bytes
コンパイル時間 2,519 ms
コンパイル使用メモリ 88,300 KB
実行使用メモリ 165,864 KB
最終ジャッジ日時 2024-06-30 11:22:13
合計ジャッジ時間 16,599 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
51,388 KB
testcase_01 AC 75 ms
51,236 KB
testcase_02 AC 75 ms
51,280 KB
testcase_03 AC 110 ms
52,548 KB
testcase_04 AC 110 ms
52,556 KB
testcase_05 AC 111 ms
52,688 KB
testcase_06 AC 112 ms
52,136 KB
testcase_07 AC 1,180 ms
106,004 KB
testcase_08 AC 1,621 ms
131,432 KB
testcase_09 AC 2,258 ms
165,620 KB
testcase_10 AC 1,134 ms
105,876 KB
testcase_11 AC 2,307 ms
165,864 KB
testcase_12 AC 2,371 ms
165,824 KB
testcase_13 AC 77 ms
51,048 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

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

class Compress {
  public final Map<Long, Integer> zip = new HashMap<>();;
  public final long[] unzip;
  public final int[] list;

  public Compress(long[] src) {
      int n = src.length;
      long[] tmp = Arrays.copyOf(src, n);
      Arrays.sort(tmp);

      unzip = new long[n];
      int index = 0;
      for (int i = 0; i < n; i ++) {
          long v = tmp[i];
          if (!zip.containsKey(v)) {
              zip.put(v, index ++);
              unzip[i] = v;
          }
      }

      list = new int[n];
      for (int i = 0; i < n; i ++) {
          list[i] = zip.get(src[i]);
      }
  }
}

public class Main {
  private static void solve() {
    int n = ni();
    long[] a = nal(n);
    
    SegmentTreeRSQ st = new SegmentTreeRSQ(n * 2);
    Compress cmp = new Compress(a);
    
    int[] b = cmp.list;

    long ret = 0;
    for (int i = 0; i < n; i ++) {
      ret += st.sum(b[i] + 1, n);
      st.add(b[i], 1);
    }
    out.println(ret);
    for (int i = 0; i < n - 1; i ++) {
      st.add(b[i], -1);
      ret -= st.sum(0, b[i]);
      ret += st.sum(b[i] + 1, n + i + 1);
      st.add(b[i], 1);
      out.println(ret);
    }
  }

  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