QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#163254#7110. Kuririn MIRACLEPhantomThresholdWA 87ms4064kbC++201.4kb2023-09-03 23:00:272023-09-03 23:00:27

Judging History

你现在查看的是最新测评结果

  • [2023-09-03 23:00:27]
  • 评测
  • 测评结果:WA
  • 用时:87ms
  • 内存:4064kb
  • [2023-09-03 23:00:27]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

typedef long double db;
const db eps=1e-8;
const db pi=acos(-1);
int sign(db k){
	if (k<-eps) return -1;
	else if (k>eps) return 1;
	return 0;	
}
int cmp(db k1,db k2){return sign(k1-k2);}

db f(db theta){
	db s=sin(theta);
	return (sqrtl(s*s+3)+s)/3;
}

double simpson(double l, double r) {
    return (f(l) + 4 * f((l + r) / 2) + f(r)) * (r - l) / 6;
}
double Integral(double l, double r, double eps, double st) {
    double mid = (l + r) / 2;
    double sl = simpson(l, mid);
    double sr = simpson(mid, r);
    if (std::abs(sl + sr - st) <= 15 * eps)
        return sl + sr + (sl + sr - st) / 15;
    return Integral(l, mid, eps / 2, sl) + Integral(mid, r, eps / 2, sr);
}
double Integral(double l, double r) {
    return Integral(l, r, eps, simpson(l, r));
}

db solve(db v,db r,db d){
	db ans=d/v;
	r=r*2;
	db L=0,R=(d-2*r)/v-eps;
	if (R<L) return ans;
	auto check=[&](db t){
		db x=d-v*t-r;
		db theta=acos(r/x);
		db t1=Integral(0,pi-theta)*r/v;
		db t2=hypot(x-r*cos(theta),r*sin(theta))*f(theta)/v;
		return t1+t2<=t;
	};
	for (int cc=1;cc<=100;cc++){
		db mid=(L+R)/2;
		if (check(mid)) R=mid;
		else L=mid;
	}
	if (check(R)) ans=min(ans,R);
	return ans;
}

int main(){
	ios_base::sync_with_stdio(false);
	int T;
	cin >> T;
	for (;T--;){
		db v,r,d;
		cin >> v >> r >> d;
		cout << fixed << setprecision(12) << solve(v,r,d) << "\n";
	}
	return 0;	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 3ms
memory: 4064kb

input:

1
2.00 3 30.0

output:

8.310579933901

result:

ok found '8.3105799', expected '8.3105799', error '0.0000000'

Test #2:

score: -100
Wrong Answer
time: 87ms
memory: 4020kb

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...

output:

4.457837122734
5.488360808985
5.848699763593
1.123680241327
43.266480053517
8.305490138200
2.377358490566
4.015485969499
37.948148148148
18.652061855670
4.155123643569
27.178963006985
9.625454545455
63.311926605505
16.613861386139
15.093994461129
1.017182130584
6.949623502719
8.150430299227
8.858447...

result:

wrong answer 27th numbers differ - expected: '4.5579680', found: '8.6205451', error = '0.8913132'