Submission #982248
Source Code Expand
import java.io.IOException; import java.io.InputStream; import java.util.*; import java.util.function.BiFunction; import java.util.function.Function; import java.util.function.Supplier; public class Main { void run() { char[] s = sc.next().toCharArray(); ArrayList<Integer> list = new ArrayList<>(); int p = 0; int m = 0; int n = s.length; for (int i = n - 1; 0 <= i; --i) { switch (s[i]) { case 'M': list.add(p - m); break; case '+': ++p; break; case '-': ++m; break; } } Collections.sort(list); int mae = list.subList(0, list.size() / 2).stream().mapToInt(Integer::intValue).sum(); int usr = list.subList(list.size() / 2, list.size()).stream().mapToInt(Integer::intValue).sum(); System.out.println(usr - mae); } Scanner sc = new Scanner(System.in); public static void main(String[] args) { new Main().run(); } 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; /** * 1-indexed なBinary Indexed Treeを構築する * * @param n 容量 * @param bif 適用させる関数 * @param sup 初期値 */ BIT(int n, BiFunction<T, T, T> bif, Supplier<T> sup) { this.n = n; bit = new ArrayList<>(n + 1); for (int i = 0; i < n + 1; ++i) { bit.add(sup.get()); } this.bif = bif; } /** * iの位置の値をvで更新する * * @param i index * @param v 新しい値 */ void update(int i, T v) { for (int x = i; x <= n; x += x & -x) { bit.set(x, bif.apply(bit.get(x), v)); } } /** * クエリー * * @param defaultValue 初期値 * @param i index * @return [1, i]までfを適用した結果 */ T reduce(T defaultValue, int i) { T ret = defaultValue; for (int x = i; x > 0; x -= x & -x) { ret = bif.apply(ret, bit.get(x)); } return ret; } } long MOD = 1_000_000_007; /** * 繰り返し2乗法を用いたべき乗の実装 * * @return a^r (mod 1,000,000,007) */ long pow(long a, long r) { long sum = 1; while (r > 0) { if ((r & 1) == 1) { sum *= a; sum %= MOD; } a *= a; a %= MOD; r >>= 1; } return sum; } /** * 組み合わせ * O(n) * * @return {}_nC_r */ long C(int n, int r) { if (n < r) { return 0; } long sum = 1; for (int i = n; 0 < i; --i) { sum *= i; sum %= MOD; } long s = 1; for (int i = r; 0 < i; --i) { s *= i; s %= MOD; } sum *= pow(s, MOD - 2); sum %= MOD; long t = 1; for (int i = n - r; 0 < i; --i) { t *= i; t %= MOD; } sum *= pow(t, MOD - 2); sum %= MOD; return sum; } double GOLDEN_RATIO = (1.0 + Math.sqrt(5)) / 2.0; /** * 黄金分割探索 * * @param left 下限 * @param right 上限 * @param f 探索する関数 * @param comp 上に凸な関数を探索するときは、Comparator.comparingDouble(Double::doubleValue) * 下に凸な関数を探索するときは、Comparator.comparingDouble(Double::doubleValue).reversed() * @return 極値の座標x */ double goldenSectionSearch(double left, double right, Function<Double, Double> f, Comparator<Double> comp) { double c1 = divideInternally(left, right, 1, GOLDEN_RATIO); double c2 = divideInternally(left, right, GOLDEN_RATIO, 1); double d1 = f.apply(c1); double d2 = f.apply(c2); while (right - left > 1e-9) { if (comp.compare(d1, d2) > 0) { right = c2; c2 = c1; d2 = d1; c1 = divideInternally(left, right, 1, GOLDEN_RATIO); d1 = f.apply(c1); } else { left = c1; c1 = c2; d1 = d2; c2 = divideInternally(left, right, GOLDEN_RATIO, 1); d2 = f.apply(c2); } } return right; } /** * [a,b]をm:nに内分する点を返す */ double divideInternally(double a, double b, double m, double n) { return (n * a + m * b) / (m + n); } long gcd(long a, long b) { if (b == 0) { return a; } return gcd(b, a % b); } int gcd(int a, int b) { if (b == 0) { return a; } return gcd(b, a % b); } long lcd(long a, long b) { return (a / gcd(a, b)) * b; } int lcd(int a, int b) { return (a / gcd(a, b)) * b; } /** * http://qiita.com/p_shiki37/items/65c18f88f4d24b2c528b */ static class FastScanner { private final InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } private boolean hasNextByte() { if (ptr < buflen) { return true; } else { ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126; } private void skipUnprintable() { while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; } public boolean hasNext() { skipUnprintable(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while (true) { if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; } else if (b == -1 || !isPrintableChar(b)) { return minus ? -n : n; } else { throw new NumberFormatException(); } b = readByte(); } } } }
Submission Info
Submission Time | |
---|---|
Task | D - ロボット |
User | arukuka |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 6936 Byte |
Status | AC |
Exec Time | 467 ms |
Memory | 38588 KB |
Judge Result
Set Name | Sample | Subtask1 | Subtask2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 30 / 30 | 70 / 70 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt |
Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt |
Subtask2 | sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt, subtask2_31.txt, subtask2_32.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 389 ms | 34724 KB |
sample_02.txt | AC | 369 ms | 34656 KB |
sample_03.txt | AC | 369 ms | 34628 KB |
sample_04.txt | AC | 369 ms | 34716 KB |
subtask1_01.txt | AC | 368 ms | 34644 KB |
subtask1_02.txt | AC | 370 ms | 34656 KB |
subtask1_03.txt | AC | 377 ms | 34860 KB |
subtask1_04.txt | AC | 372 ms | 34668 KB |
subtask1_05.txt | AC | 371 ms | 34696 KB |
subtask1_06.txt | AC | 371 ms | 34764 KB |
subtask1_07.txt | AC | 390 ms | 34912 KB |
subtask1_08.txt | AC | 373 ms | 34748 KB |
subtask1_09.txt | AC | 374 ms | 34648 KB |
subtask1_10.txt | AC | 381 ms | 34768 KB |
subtask1_11.txt | AC | 376 ms | 34808 KB |
subtask1_12.txt | AC | 373 ms | 34844 KB |
subtask1_13.txt | AC | 375 ms | 34748 KB |
subtask1_14.txt | AC | 377 ms | 34832 KB |
subtask1_15.txt | AC | 372 ms | 34832 KB |
subtask1_16.txt | AC | 381 ms | 34884 KB |
subtask1_17.txt | AC | 373 ms | 34816 KB |
subtask1_18.txt | AC | 375 ms | 34852 KB |
subtask1_19.txt | AC | 381 ms | 34760 KB |
subtask1_20.txt | AC | 377 ms | 34828 KB |
subtask1_21.txt | AC | 376 ms | 34828 KB |
subtask1_22.txt | AC | 403 ms | 34820 KB |
subtask1_23.txt | AC | 392 ms | 34728 KB |
subtask1_24.txt | AC | 389 ms | 34848 KB |
subtask1_25.txt | AC | 377 ms | 34860 KB |
subtask1_26.txt | AC | 371 ms | 34872 KB |
subtask1_27.txt | AC | 376 ms | 34824 KB |
subtask1_28.txt | AC | 379 ms | 34804 KB |
subtask1_29.txt | AC | 376 ms | 34816 KB |
subtask1_30.txt | AC | 391 ms | 34864 KB |
subtask1_31.txt | AC | 375 ms | 34848 KB |
subtask1_32.txt | AC | 379 ms | 34860 KB |
subtask2_01.txt | AC | 439 ms | 37980 KB |
subtask2_02.txt | AC | 417 ms | 36376 KB |
subtask2_03.txt | AC | 423 ms | 36812 KB |
subtask2_04.txt | AC | 439 ms | 37612 KB |
subtask2_05.txt | AC | 439 ms | 38176 KB |
subtask2_06.txt | AC | 417 ms | 36472 KB |
subtask2_07.txt | AC | 417 ms | 36324 KB |
subtask2_08.txt | AC | 443 ms | 37540 KB |
subtask2_09.txt | AC | 430 ms | 37760 KB |
subtask2_10.txt | AC | 445 ms | 37384 KB |
subtask2_11.txt | AC | 442 ms | 37896 KB |
subtask2_12.txt | AC | 439 ms | 38184 KB |
subtask2_13.txt | AC | 445 ms | 37820 KB |
subtask2_14.txt | AC | 439 ms | 37984 KB |
subtask2_15.txt | AC | 451 ms | 37976 KB |
subtask2_16.txt | AC | 451 ms | 37364 KB |
subtask2_17.txt | AC | 461 ms | 38100 KB |
subtask2_18.txt | AC | 463 ms | 37616 KB |
subtask2_19.txt | AC | 454 ms | 38588 KB |
subtask2_20.txt | AC | 458 ms | 38172 KB |
subtask2_21.txt | AC | 454 ms | 37656 KB |
subtask2_22.txt | AC | 457 ms | 38028 KB |
subtask2_23.txt | AC | 459 ms | 37632 KB |
subtask2_24.txt | AC | 458 ms | 37848 KB |
subtask2_25.txt | AC | 457 ms | 38504 KB |
subtask2_26.txt | AC | 453 ms | 37720 KB |
subtask2_27.txt | AC | 459 ms | 38276 KB |
subtask2_28.txt | AC | 451 ms | 38532 KB |
subtask2_29.txt | AC | 456 ms | 37908 KB |
subtask2_30.txt | AC | 455 ms | 38004 KB |
subtask2_31.txt | AC | 455 ms | 37880 KB |
subtask2_32.txt | AC | 467 ms | 37996 KB |