QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#159107 | #7110. Kuririn MIRACLE | ucup-team1448# | TL | 23ms | 4292kb | C++14 | 1.4kb | 2023-09-02 17:29:20 | 2023-09-02 17:29:21 |
Judging History
answer
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using db = double;
const db eps = 1e-8;
db f(db x) { return 1 / (-sin(x) + sqrt(sin(x) * sin(x) + 3)); }
db simp(db l, db r) { return (r - l) * (f(l) + 4 * f((l + r) / 2) + f(r)) / 6; }
db asr(db l, db r, db eps, db ans, db step) {
db m = (l + r) / 2;
db fl = simp(l, m), fr = simp(m, r);
if (abs(fl + fr - ans) <= 15 * eps && step < 0)
return fl + fr + (fl + fr - ans) / 15;
return asr(l, m, eps / 2, fl, step - 1) +
asr(m, r, eps / 2, fr, step - 1);
}
db V, R, D, K;
db time(db x) { return asr(x, M_PI, eps, simp(x, M_PI), 12) * K; }
int main() {
int T;
scanf("%d", &T);
while(T--) {
scanf("%lf%lf%lf", &V, &R, &D);
R *= 2, K = R / V;
if (time(0.) * V + 2 * R > D) {
printf("%.9f", D / V);
} else {
db l = 0, r = M_PI_2, m, t, s;
while (r - l > eps) {
m = (l + r) / 2;
t = time(m) + R * tan(m) * f(m) / V;
s = t * V + R * (1 + 1 / cos(m));
(s > D ? r : l) = m;
// printf("%f-%f-%f %f/%f ", l / M_PI * 180, m / M_PI * 180, r / M_PI * 180, s, t);
// (s > D ? (puts("R"), r) : (puts("L"), l)) = m;
// (t > 8.310579933902352 ? (puts("R"), r) : (puts("L"), l)) = m;
}
printf("%.9f", t);
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 23ms
memory: 4292kb
input:
1 2.00 3 30.0
output:
8.310579941
result:
ok found '8.3105799', expected '8.3105799', error '0.0000000'
Test #2:
score: -100
Time Limit Exceeded
input:
100 8.66 6.05 71.59 8.44 8.67 82.55 4.23 9.68 24.74 6.63 9.95 7.45 1.2 7.27 97.55 2.08 2.94 31.61 8.48 5.56 20.16 7.35 5.55 52.48 1.35 8.15 51.23 3.88 9.02 72.37 7.03 1.97 57.03 1.78 4.44 93.44 5.5 6.11 52.94 1.09 9.64 69.01 1.01 3.54 16.78 1.63 4.55 44.06 5.82 5.51 5.92 5.62 2.93 76.01 4.75 4.43 73...