QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#481801#5505. Great ChaseUESTC_DECAYALI#AC ✓1978ms10136kbC++17833b2024-07-17 14:23:022024-07-17 14:23:02

Judging History

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

  • [2024-07-17 14:23:02]
  • 评测
  • 测评结果:AC
  • 用时:1978ms
  • 内存:10136kb
  • [2024-07-17 14:23:02]
  • 提交

answer

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

using LD = long double;
const LD eps = 1e-8;
int sgn(LD x){return fabs(x)<=eps ? 0 : (x>eps ? 1 : -1);}

const int N = 4e5+5;
int t, n, p[N], v[N];
const LD INF = 1e18;

bool check(LD x){
	LD mx=-INF, mn=INF;
	for (int i=1; i<=n; ++i){
		if (p[i]>0) mn=min(mn, p[i]-v[i]*x);
		else mx=max(mx, p[i]+v[i]*x);
	}
	return sgn(mx-mn)<0;
}
signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	cout << setiosflags(ios::fixed) << setprecision(10);
	cin >> t;
	while (t--){
		cin >> n >> v[0];
		for (int i=1; i<=n; ++i) cin >> p[i] >> v[i];
		LD L=0.0L, R=1e13;
		for (int tt=0; tt<200; ++tt){
//			printf("L=%Lf R=%Lf\n", L, R);
			LD M  = (R+L)*0.5L;
			if (check(M)) L=M;
			else R=M;	
		}
		cout << L*v[0] << '\n';
	}
	return 0;	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5984kb

input:

3
4 9
10 2
-7 2
-6 1
7 1
2 8
-1 7
1 6
2 3
-1000000000000 1
1000000000000 1

output:

38.2499999775
1.2307692246
2999999999999.9999997616

result:

ok 3 numbers

Test #2:

score: 0
Accepted
time: 895ms
memory: 5924kb

input:

10000
200 997007
405524182320 754760
686939601648 419804
687047488212 715566
1446157132 4594
-670522037 4673
763634629282 253755
424307411732 275041
1582708381 8473
-667425982 4622
-522841486 1427
702430907988 460271
1405423646 1060
1497754648 6227
883363410675 723547
56899800372 46435
-810216390 64...

output:

145405766328.3491095155
16414958969.7272811811
5202715639.8351829993
321977234.1563258449
45384199210.2216838636
183885744.7692097246
1708925225.2304723455
89786664971.5579425320
13924365606.2873887857
412975327.5553305744
965508404.5121014863
4703493416.2883765087
352961619.3810438116
5575125771.79...

result:

ok 10000 numbers

Test #3:

score: 0
Accepted
time: 1978ms
memory: 8252kb

input:

93
15435 968117
4196666 184
-5069875 255
-9782648 980
-1978138 176
9333323 764
-4323540 12
-8442049 319
-5371878 137
2881306 10
-4050629 133
-4659099 59
-5189169 320
-2256647 99
-3686648 37
1059255 33
-223142 20
8040933 408
8407764 705
694547 38
-7913614 746
-3573355 132
5919585 189
-3756662 94
-795...

output:

189662921.3627562573
197971181.3332559767
997533531.7376295779
6439673170.6657417705
993821598110.6610777974
22727977326.4026609231
34702455207.5185040161
677770533.9298174682
46631726883.9691332206
5446481867.1288002962
11336247450.2720785709
4409370840.4391315985
15681606050.5762868384
14986614231...

result:

ok 93 numbers

Test #4:

score: 0
Accepted
time: 1396ms
memory: 10136kb

input:

5
400000 999972
172811492468 106699
171900177092 102097
194121748377 184014
190302947556 172722
183121572232 149212
196566712700 190884
171376795991 99358
522927044000 159597
-129031052077 34395
189422320931 170012
-275879974024 638546
408864707565 98475
-106703244806 368801
192128798630 178213
2915...

output:

519985220219.8117708564
511413015796.7664753497
424240880533.6340202987
518849481155.5039187670
1882496988186.4439622164

result:

ok 5 numbers

Test #5:

score: 0
Accepted
time: 1803ms
memory: 8660kb

input:

38
16668 999947
-3844782803 511
-210897941456 464872
618726004990 714384
-954596898686 225256
96675744 1148
-1515974078 11375
-206213840984 706184
306078847 3947
-474818331950 391451
-616022698917 561244
123378707 1540
-640636592655 406006
459201391325 908506
-733249583 5719
496163273 6238
619876911...

output:

89670748252.9786070064
98630840901.5076061115
29393530999.8943271078
50801000770.9559847154
39668001027.2693304047
467846478226.4113706350
30789914370.5743107572
23151476830.9050978720
51606123416.6258269213
151713060001.6625887156
100944679009.6092855558
766785664078.3589816093
39969642788.06186634...

result:

ok 38 numbers