結果
問題 | No.1470 Mex Sum |
ユーザー | neko_the_shadow |
提出日時 | 2021-04-13 10:28:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 366 ms / 2,000 ms |
コード長 | 5,133 bytes |
コンパイル時間 | 2,482 ms |
コンパイル使用メモリ | 92,152 KB |
実行使用メモリ | 58,944 KB |
最終ジャッジ日時 | 2024-06-29 05:07:13 |
合計ジャッジ時間 | 18,140 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 60 ms
37,508 KB |
testcase_01 | AC | 60 ms
37,884 KB |
testcase_02 | AC | 127 ms
42,392 KB |
testcase_03 | AC | 124 ms
42,112 KB |
testcase_04 | AC | 126 ms
42,388 KB |
testcase_05 | AC | 130 ms
42,312 KB |
testcase_06 | AC | 124 ms
42,236 KB |
testcase_07 | AC | 124 ms
42,372 KB |
testcase_08 | AC | 124 ms
41,976 KB |
testcase_09 | AC | 133 ms
42,464 KB |
testcase_10 | AC | 133 ms
42,152 KB |
testcase_11 | AC | 131 ms
42,132 KB |
testcase_12 | AC | 315 ms
57,160 KB |
testcase_13 | AC | 341 ms
57,292 KB |
testcase_14 | AC | 328 ms
56,952 KB |
testcase_15 | AC | 315 ms
56,996 KB |
testcase_16 | AC | 312 ms
56,964 KB |
testcase_17 | AC | 322 ms
56,944 KB |
testcase_18 | AC | 336 ms
57,304 KB |
testcase_19 | AC | 310 ms
56,836 KB |
testcase_20 | AC | 324 ms
57,056 KB |
testcase_21 | AC | 321 ms
57,320 KB |
testcase_22 | AC | 340 ms
57,124 KB |
testcase_23 | AC | 326 ms
57,204 KB |
testcase_24 | AC | 325 ms
56,968 KB |
testcase_25 | AC | 322 ms
56,832 KB |
testcase_26 | AC | 322 ms
56,940 KB |
testcase_27 | AC | 345 ms
56,992 KB |
testcase_28 | AC | 327 ms
56,836 KB |
testcase_29 | AC | 333 ms
57,072 KB |
testcase_30 | AC | 337 ms
57,336 KB |
testcase_31 | AC | 317 ms
56,852 KB |
testcase_32 | AC | 366 ms
57,096 KB |
testcase_33 | AC | 333 ms
56,736 KB |
testcase_34 | AC | 314 ms
57,264 KB |
testcase_35 | AC | 324 ms
56,984 KB |
testcase_36 | AC | 322 ms
57,168 KB |
testcase_37 | AC | 293 ms
57,932 KB |
testcase_38 | AC | 295 ms
58,536 KB |
testcase_39 | AC | 295 ms
58,212 KB |
testcase_40 | AC | 310 ms
58,152 KB |
testcase_41 | AC | 304 ms
58,204 KB |
testcase_42 | AC | 318 ms
58,136 KB |
testcase_43 | AC | 309 ms
58,472 KB |
testcase_44 | AC | 310 ms
58,380 KB |
testcase_45 | AC | 299 ms
58,428 KB |
testcase_46 | AC | 309 ms
58,316 KB |
testcase_47 | AC | 304 ms
58,312 KB |
testcase_48 | AC | 305 ms
58,312 KB |
testcase_49 | AC | 303 ms
58,236 KB |
testcase_50 | AC | 305 ms
58,944 KB |
ソースコード
package _1470; import java.io.BufferedReader; import java.io.EOFException; import java.io.IOException; import java.io.InputStream; import java.io.InputStreamReader; import java.io.PrintStream; import java.io.PrintWriter; import java.io.UncheckedIOException; import java.math.BigInteger; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Deque; import java.util.List; import java.util.function.Supplier; import java.util.regex.Pattern; public class Main { public void exec() { int n = stdin.nextInt(); long[] a = stdin.nextLongArray(n); long one = 0; long two = 0; long up2 = 0; long up3 = 0; for (int i = 0; i < n; i++) { if (a[i]==1) one++; if (a[i]==2) two++; if (a[i]>=2) up2++; if (a[i]>=3) up3++; } long ans = 0; for (int i = 0; i < n; i++) { if (a[i]==1) one--; if (a[i]==2) two--; if (a[i]>=2) up2--; if (a[i]>=3) up3--; if (a[i]==1) { ans += 2*(one+up3) + 3*two; } else if (a[i]==2) { ans += 1*up2 + 3*one; } else { ans += 1*up2 + 2*one; } } stdout.println(ans); } private static final Stdin stdin = new Stdin(System.in); private static final Stdout stdout = new Stdout(System.out); public static void main(String[] args) { try { new Main().exec(); } finally { stdout.flush(); } } public static class Stdin { private Deque<String> queue; private BufferedReader in; private Pattern space; public Stdin(InputStream in) { this.queue = new ArrayDeque<>(); this.in = new BufferedReader(new InputStreamReader(in)); this.space = Pattern.compile(" "); } public String nextString() { if (queue.isEmpty()) { try { String line = in.readLine(); if (line == null) { throw new EOFException(); } space.splitAsStream(line).forEach(this.queue::addLast); } catch (IOException e) { throw new UncheckedIOException(e); } } return queue.removeFirst(); } public int nextInt() { return Integer.parseInt(nextString()); } public double nextDouble() { return Double.parseDouble(nextString()); } public long nextLong() { return Long.parseLong(nextString()); } public BigInteger nextBigInteger() { return new BigInteger(nextString()); } public String[] nextStringArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = nextString(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public BigInteger[] nexBigIntegerArray(int n) { BigInteger[] a = new BigInteger[n]; for (int i = 0; i < n; i++) a[i] = nextBigInteger(); return a; } public List<Integer> nextIntegerList(int n) { return nextList(n, this::nextInt); } public List<Long> nextLongList(int n) { return nextList(n, this::nextLong); } public List<Double> nextDoubleList(int n) { return nextList(n, this::nextDouble); } public List<String> nextStringList(int n) { return nextList(n, this::nextString); } public List<BigInteger> nextBigIntegerList(int n) { return nextList(n, this::nextBigInteger); } private <T> List<T> nextList(int n, Supplier<T> supplier) { List<T> a = new ArrayList<>(); for (int i = 0; i < n; i++) a.add(supplier.get()); return a; } } public static class Stdout { private PrintWriter stdout; public Stdout(PrintStream stdout) { this.stdout = new PrintWriter(stdout, false); } public void println(Object ... objs) { for (int i = 0, len = objs.length; i < len; i++) { stdout.print(objs[i]); if (i != len-1) stdout.print(' '); } stdout.println(); } public void flush() { stdout.flush(); } } }