Submission #3100514
Source Code Expand
import java.io.BufferedReader; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.OutputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.HashMap; import java.util.InputMismatchException; import java.util.Map; import java.util.StringTokenizer; public class Main { public static void main(String[] args) throws IOException { InputStream inputStream = System.in; OutputStream outputStream = System.out; InputReader in = new InputReader(inputStream); PrintWriter out = new PrintWriter(outputStream); TaskX solver = new TaskX(); solver.solve(1, in, out); out.close(); } static int INF = 1 << 30; static long LINF = 1L << 55; static int MOD = 1000000007; static int[] mh4 = { 0, -1, 1, 0 }; static int[] mw4 = { -1, 0, 0, 1 }; static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 }; static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 }; static class TaskX { public void solve(int testNumber, InputReader in, PrintWriter out) { int n = in.nextInt(); int[] h = new int[n]; int[] hs = new int[n]; int[] ht = new int[n]; Map<Integer, Integer> map = new HashMap<>(); for (int i = n-1; i >= 0; i--) { h[i] = in.nextInt(); hs[i] = h[i]; map.merge(h[i], 1, Integer::sum); } for (int v : map.values()) { if (v >= 2) { out.println(-1); return; } } Arrays.sort(hs); map = new HashMap<>(); for (int i = 0; i < n; i++) { map.put(hs[i], i+1); } for (int i = 0; i < n; i++) { ht[i] = map.get(h[i]); } BIT bit = new BIT(n); long ans = 0; for (int i = 0; i < n; i++) { ans += bit.sum(ht[i]); bit.add(ht[i], h[i]); } out.println(ans); } } /** * 1-indexed BinaryIndexTree * */ public static class BIT { // [1, n] int n; int[] bit; public BIT(int n) { this.n = n; bit = new int[n + 1]; } // indexに値vを足す public void add(int i, int v) { for (int x = i; x < n + 1; x += x & -x) { bit[x] += v; } } // 区間和 [1, v] を求める // v[1] + ... + v[i] public long sum(int i) { long ret = 0; for (int x = i; x > 0; x -= x & -x) { ret += bit[x]; } return ret; } // 区間和 [i, j] = [1, j] - [1, i-1]を求める // v[i] + ... + v[j] public int query(int i, int j) { return sum(j) - sum(i - 1); } } static class InputReader { BufferedReader in; StringTokenizer tok; public String nextString() { while (!tok.hasMoreTokens()) { try { tok = new StringTokenizer(in.readLine(), " "); } catch (IOException e) { throw new InputMismatchException(); } } return tok.nextToken(); } public int nextInt() { return Integer.parseInt(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public int[] nextIntArray(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt(); } return res; } public int[] nextIntArrayDec(int n) { int[] res = new int[n]; for (int i = 0; i < n; i++) { res[i] = nextInt() - 1; } return res; } public long[] nextLongArray(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong(); } return res; } public long[] nextLongArrayDec(int n) { long[] res = new long[n]; for (int i = 0; i < n; i++) { res[i] = nextLong() - 1; } return res; } public InputReader(InputStream inputStream) { in = new BufferedReader(new InputStreamReader(inputStream)); tok = new StringTokenizer(""); } } }
Submission Info
Submission Time | |
---|---|
Task | E - Line up! |
User | tutuz |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 3863 Byte |
Status | CE |
Compile Error
./Main.java:113: error: incompatible types: possible lossy conversion from long to int return sum(j) - sum(i - 1); ^ 1 error