Submission #951662
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() { long r = sc.nextLong(); long b = sc.nextLong(); long x = sc.nextLong(); long y = sc.nextLong(); long left = 0; long right = (long) 1e18 + 1; while (right - left > 1) { long mid = (left + right) / 2; long nr = r - mid; long nb = b - mid; if (nr / (x - 1) + (nb / (y - 1)) >= mid) { left = mid; } else { right = mid; } } long k = (left + right) / 2; System.out.println(k); } 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) { 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); } /** * 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 | B - 花束 |
User | arukuka |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 6374 Byte |
Status | WA |
Exec Time | 133 ms |
Memory | 9808 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 130 ms | 9680 KB |
02.txt | AC | 130 ms | 9672 KB |
03.txt | AC | 131 ms | 9676 KB |
04.txt | AC | 130 ms | 9668 KB |
05.txt | AC | 131 ms | 9676 KB |
06.txt | WA | 130 ms | 9676 KB |
07.txt | WA | 130 ms | 9680 KB |
08.txt | AC | 130 ms | 9680 KB |
09.txt | AC | 128 ms | 9672 KB |
10.txt | WA | 130 ms | 9672 KB |
11.txt | WA | 130 ms | 9680 KB |
12.txt | AC | 129 ms | 9680 KB |
13.txt | AC | 129 ms | 9676 KB |
14.txt | WA | 130 ms | 9680 KB |
15.txt | WA | 128 ms | 9680 KB |
16.txt | AC | 130 ms | 9676 KB |
17.txt | AC | 130 ms | 9676 KB |
18.txt | WA | 130 ms | 9680 KB |
19.txt | WA | 130 ms | 9680 KB |
20.txt | AC | 130 ms | 9676 KB |
21.txt | AC | 130 ms | 9680 KB |
22.txt | AC | 132 ms | 9680 KB |
23.txt | AC | 131 ms | 9676 KB |
24.txt | AC | 130 ms | 9556 KB |
25.txt | AC | 127 ms | 9676 KB |
26.txt | AC | 130 ms | 9680 KB |
27.txt | AC | 129 ms | 9792 KB |
28.txt | AC | 131 ms | 9676 KB |
29.txt | AC | 132 ms | 9676 KB |
30.txt | AC | 127 ms | 9676 KB |
31.txt | AC | 132 ms | 9556 KB |
32.txt | AC | 130 ms | 9676 KB |
33.txt | AC | 130 ms | 9672 KB |
34.txt | AC | 129 ms | 9676 KB |
35.txt | AC | 130 ms | 9552 KB |
36.txt | AC | 130 ms | 9552 KB |
37.txt | AC | 131 ms | 9672 KB |
38.txt | AC | 130 ms | 9684 KB |
39.txt | AC | 131 ms | 9676 KB |
40.txt | AC | 129 ms | 9680 KB |
41.txt | AC | 129 ms | 9680 KB |
42.txt | AC | 132 ms | 9684 KB |
43.txt | AC | 130 ms | 9680 KB |
44.txt | AC | 132 ms | 9556 KB |
45.txt | AC | 130 ms | 9680 KB |
46.txt | AC | 129 ms | 9676 KB |
47.txt | AC | 130 ms | 9552 KB |
48.txt | AC | 130 ms | 9556 KB |
49.txt | AC | 130 ms | 9672 KB |
50.txt | AC | 130 ms | 9680 KB |
51.txt | AC | 133 ms | 9808 KB |
52.txt | AC | 130 ms | 9672 KB |
53.txt | AC | 130 ms | 9684 KB |
54.txt | AC | 130 ms | 9556 KB |
55.txt | AC | 131 ms | 9676 KB |
56.txt | AC | 129 ms | 9676 KB |
57.txt | AC | 129 ms | 9548 KB |
58.txt | AC | 128 ms | 9680 KB |
59.txt | AC | 131 ms | 9668 KB |
60.txt | AC | 130 ms | 9676 KB |