Submission #951841
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();
int[] x = new int[n];
int[] y = new int[n];
int[] c = new int[n];
for (int i = 0; i < n; ++i) {
x[i] = ni();
y[i] = ni();
c[i] = ni();
}
double left = 0;
double right = 1e9 + 1;
while (right - left > 1e-7) {
double mid = (left + right) / 2;
double maxx = -1e5 - 1;
double minx = 1e5 + 1;
for (int i = 0; i < n; ++i) {
double t = mid / c[i];
maxx = Math.max(maxx, x[i] - t);
minx = Math.min(minx, x[i] + t);
}
double maxy = -1e5 - 1;
double miny = 1e5 + 1;
for (int i = 0; i < n; ++i) {
double t = mid / c[i];
maxy = Math.max(maxy, y[i] - t);
miny = Math.min(miny, y[i] + t);
}
if (maxx <= minx && maxy <= miny) {
right = mid;
} else {
left = mid;
}
}
System.out.printf("%f\n", 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 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 |
100 |
Code Size |
6824 Byte |
Status |
AC |
Exec Time |
212 ms |
Memory |
14392 KB |
Judge Result
Set Name |
Sample |
Subtask1 |
Subtask2 |
Score / Max Score |
0 / 0 |
30 / 30 |
70 / 70 |
Status |
AC
|
|
|
Set Name |
Test Cases |
Sample |
|
Subtask1 |
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 |
Subtask2 |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_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, 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 |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
131 ms |
9928 KB |
subtask0_sample_02.txt |
AC |
132 ms |
9808 KB |
subtask0_sample_03.txt |
AC |
133 ms |
9812 KB |
subtask0_sample_04.txt |
AC |
135 ms |
9812 KB |
subtask1_01.txt |
AC |
133 ms |
9808 KB |
subtask1_02.txt |
AC |
131 ms |
9800 KB |
subtask1_03.txt |
AC |
131 ms |
9812 KB |
subtask1_04.txt |
AC |
197 ms |
13980 KB |
subtask1_05.txt |
AC |
197 ms |
13992 KB |
subtask1_06.txt |
AC |
193 ms |
14244 KB |
subtask1_07.txt |
AC |
197 ms |
14392 KB |
subtask1_08.txt |
AC |
203 ms |
14248 KB |
subtask1_09.txt |
AC |
196 ms |
14236 KB |
subtask1_10.txt |
AC |
194 ms |
14120 KB |
subtask1_11.txt |
AC |
195 ms |
13564 KB |
subtask1_12.txt |
AC |
196 ms |
14120 KB |
subtask1_13.txt |
AC |
196 ms |
14244 KB |
subtask2_01.txt |
AC |
131 ms |
9808 KB |
subtask2_02.txt |
AC |
131 ms |
9808 KB |
subtask2_03.txt |
AC |
131 ms |
9680 KB |
subtask2_04.txt |
AC |
194 ms |
13952 KB |
subtask2_05.txt |
AC |
195 ms |
13644 KB |
subtask2_06.txt |
AC |
200 ms |
14192 KB |
subtask2_07.txt |
AC |
212 ms |
13708 KB |
subtask2_08.txt |
AC |
194 ms |
14072 KB |
subtask2_09.txt |
AC |
194 ms |
14124 KB |
subtask2_10.txt |
AC |
193 ms |
13832 KB |
subtask2_11.txt |
AC |
200 ms |
14000 KB |
subtask2_12.txt |
AC |
190 ms |
13520 KB |
subtask2_13.txt |
AC |
198 ms |
14040 KB |