Submission #986020
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() {
int n = ni();
long[] h = new long[n];
long[] s = new long[n];
for (int i = 0; i < n; ++i) {
h[i] = ni();
s[i] = ni();
}
long left = 0;
long right = 1L << 60;
while (right - left > 1) {
long mid = (left + right) / 2;
int cnt = 0;
boolean[] done = new boolean[n];
boolean flag = false;
loop:
for (int i = 0; i < n; ++i) {
for (int j = 0; j < n; ++j) {
if (h[j] + s[j] * i > mid) {
if (done[j]) {
continue;
}
if (cnt == 0) {
left = mid;
flag = true;
break loop;
}
done[j] = true;
--cnt;
}
}
++cnt;
}
if (!flag)
right = mid;
}
System.out.println(right);
}
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 set(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;
}
}
class SegmentTree<T> {
int n;
ArrayList<T> dat;
BiFunction<T, T, T> bif;
Supplier<T> sup;
/**
* 0-indexed なSegment Treeを構築する
*
* @param n_ 要求容量
* @param bif 適用させる関数
* @param sup 初期値
*/
SegmentTree(int n_, BiFunction<T, T, T> bif, Supplier<T> sup) {
n = 1;
while (n < n_) n *= 2;
dat = new ArrayList<>(2 * n - 1);
for (int i = 0; i < 2 * n - 1; ++i) {
dat.add(sup.get());
}
this.bif = bif;
this.sup = sup;
}
/**
* kの位置の値をvで更新する
*
* @param k index
* @param v 新しい値
*/
void set(int k, T v) {
k += n - 1;
dat.set(k, v);
while (k > 0) {
k = (k - 1) / 2;
dat.set(k, bif.apply(dat.get(k * 2 + 1), dat.get(k * 2 + 2)));
}
}
/**
* クエリー
*
* @param l はじめ
* @param r おわり
* @return [l, r)での演算bifを適用した結果を返す
*/
T reduce(int l, int r) {
return _reduce(l, r, 0, 0, n);
}
T _reduce(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) return sup.get();
if (a <= l && r <= b) return dat.get(k);
T vl = _reduce(a, b, k * 2 + 1, l, (l + r) / 2);
T vr = _reduce(a, b, k * 2 + 2, (l + r) / 2, r);
return bif.apply(vl, vr);
}
}
class Pair<F extends Comparable<F>, S extends Comparable<S>> implements Comparable<Pair<F, S>> {
F f;
S s;
Pair() {
}
Pair(F f, S s) {
this.f = f;
this.s = s;
}
Pair(Pair<F, S> p) {
f = p.f;
s = p.s;
}
@Override
public int compareTo(Pair<F, S> p) {
if (f.compareTo(p.f) != 0) {
return f.compareTo(p.f);
}
return s.compareTo(p.s);
}
@Override
public int hashCode() {
return f.hashCode() ^ s.hashCode();
}
@Override
public boolean equals(Object o) {
if (this == o) {
return true;
}
if (o == null || this.f == null || this.s == null) {
return false;
}
if (this.getClass() != o.getClass()) {
return false;
}
Pair p = (Pair) o;
return this.f.equals(p.f) && this.s.equals(p.s);
}
@Override
public String toString() {
return "{" + f.toString() + ", " + s.toString() + "}";
}
}
/**
* ユークリッドの互除法
*
* @return a と b の最大公約数
*/
long gcd(long a, long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
/**
* 拡張ユークリッドの互除法
*
* @return mx + ny = gcd(m, n)となるような(x, y)を返す
*/
Pair<Long, Long> gcd_ex(long m, long n) {
long[][] mat = _gcd_ex(m, n);
return new Pair<>(mat[0][0], mat[0][1]);
}
long[][] _gcd_ex(long m, long n) {
if (n == 0) {
return new long[][]{{1, 0}, {0, 1}};
}
long k = m / n;
long[][] K = new long[][]{{0, 1}, {1, -k}};
long[][] r = _gcd_ex(n, m % n);
long[][] dst = new long[2][2];
for (int y = 0; y < 2; ++y)
for (int x = 0; x < 2; ++x)
for (int i = 0; i < 2; ++i)
dst[y][x] += r[y][i] * K[i][x];
return dst;
}
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://alexbowe.com/popcount-permutations/
* bitの立っている数が小さい順にループしたいときに使う。
* ex)
* <pre>
* for (int i = 0; i < 25; ++i) {
* int bits = (1 << i) - 1;
* long m = C(25, num);
* for (j = 0; j < m; ++j) {
* ...(25個の中からi個bitが立っている)
* if (bits != 0)
* bits = next_perm(bits);
* }
* }
* </pre>
*
* @param v 現在のbit列
* @return 次のbit列
*/
int next_perm(int v) {
int t = (v | (v - 1)) + 1;
return t | ((((t & -t) / (v & -v)) >> 1) - 1);
}
/**
* 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 |
30 |
Code Size |
10795 Byte |
Status |
TLE |
Exec Time |
5039 ms |
Memory |
71140 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
0 / 70 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
subtask0-sample01.txt, subtask0-sample02.txt |
Subtask1 |
subtask0-sample01.txt, subtask0-sample02.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 |
Subtask2 |
subtask0-sample01.txt, subtask0-sample02.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, 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 |
Case Name |
Status |
Exec Time |
Memory |
subtask0-sample01.txt |
AC |
292 ms |
28872 KB |
subtask0-sample02.txt |
AC |
280 ms |
28788 KB |
subtask1-01.txt |
AC |
283 ms |
28876 KB |
subtask1-02.txt |
AC |
283 ms |
28828 KB |
subtask1-03.txt |
AC |
284 ms |
28944 KB |
subtask1-04.txt |
AC |
287 ms |
28932 KB |
subtask1-05.txt |
AC |
284 ms |
28852 KB |
subtask1-06.txt |
AC |
296 ms |
28948 KB |
subtask1-07.txt |
AC |
293 ms |
28828 KB |
subtask1-08.txt |
AC |
292 ms |
29012 KB |
subtask1-09.txt |
AC |
288 ms |
29020 KB |
subtask1-10.txt |
AC |
297 ms |
28968 KB |
subtask1-11.txt |
AC |
287 ms |
28904 KB |
subtask1-12.txt |
AC |
300 ms |
29032 KB |
subtask1-13.txt |
AC |
299 ms |
29156 KB |
subtask1-14.txt |
AC |
301 ms |
29128 KB |
subtask1-15.txt |
AC |
287 ms |
29012 KB |
subtask2-01.txt |
AC |
323 ms |
29728 KB |
subtask2-02.txt |
AC |
589 ms |
32972 KB |
subtask2-03.txt |
AC |
1190 ms |
35288 KB |
subtask2-04.txt |
TLE |
5035 ms |
50468 KB |
subtask2-05.txt |
TLE |
5035 ms |
53760 KB |
subtask2-06.txt |
TLE |
5035 ms |
53528 KB |
subtask2-07.txt |
TLE |
5035 ms |
56748 KB |
subtask2-08.txt |
TLE |
5036 ms |
55932 KB |
subtask2-09.txt |
TLE |
5039 ms |
55916 KB |
subtask2-10.txt |
TLE |
5034 ms |
55700 KB |
subtask2-11.txt |
TLE |
5035 ms |
69232 KB |
subtask2-12.txt |
TLE |
5035 ms |
71140 KB |
subtask2-13.txt |
TLE |
5034 ms |
56032 KB |
subtask2-14.txt |
TLE |
5034 ms |
56132 KB |
subtask2-15.txt |
TLE |
5033 ms |
56264 KB |