Submission #924167

---

Source Code Expand

import java.util.*;
import java.util.function.BiFunction;

public class Main {
  Scanner sc = new Scanner(System.in);

  public static void main(String[] args) {
    new Main().run();
  }

  void run() {
    int n = ni();
    TreeSet<Integer> set = new TreeSet<>();
    int[] a = new int[n];
    for (int i = 0; i < n; ++i) {
      a[i] = ni();
      set.add(a[i]);
    }
    HashMap<Integer, Integer> map = new HashMap<>();
    int cnt = 0;
    for (int v : set) {
      map.put(v, cnt++);
    }
    for (int i = 0; i < n; ++i) {
      System.out.println(map.get(a[i]));
    }
  }

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

  void debug(Object... os) {
    System.err.println(Arrays.deepToString(os));
  }

  class BIT<T> {
    int n;
    ArrayList<T> bit;
    BiFunction<T, T, T> bif;

    BIT(int n, BiFunction<T, T, T> bif, T defaultValue) {
      this.n = n;
      bit = new ArrayList<>(n + 1);
      for (int i = 0; i < n + 1; ++i) {
        bit.add(defaultValue);
      }
      this.bif = bif;
    }

    void update(int i, T v) {
      for (int x = i; x <= n; x += x & -x) {
        bit.set(x, bif.apply(bit.get(x), v));
      }
    }

    T reduce(int i, T defaultValue) {
      T ret = defaultValue;
      for (int x = i; x > 0; x -= x & -x) {
        ret = bif.apply(ret, bit.get(x));
      }
      return ret;
    }
  }

}

Submission Info

Judge Result