QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#77606#5505. Great Chasezhangboju#AC ✓1465ms9936kbC++14851b2023-02-15 10:03:422023-02-15 10:03:43

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-02-15 10:03:43]
  • 评测
  • 测评结果:AC
  • 用时:1465ms
  • 内存:9936kb
  • [2023-02-15 10:03:42]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x)
{
	x=0;short f=1;char c=getchar();
	for(;c<'0'||c>'9';c=getchar()) if(c=='-') f=-1;
	for(;c>='0'&&c<='9';c=getchar()) x=(x<<1)+(x<<3)+(c^48);
	x*=f;return;
}
#define double long double
const int N=4e5+5;
const double eps=1e-5;
#define ll long long
int n;
ll p[N],v[N],k;
bool check(double x)
{
	double maxx=-1e18,minx=1e18;
	for(int i=1;i<=n;++i)
		if(p[i]<0) maxx=max(maxx,p[i]+v[i]*x);
		else minx=min(minx,p[i]-v[i]*x);
	return minx<maxx;
}
int main()
{
	int T;read(T);
	while(T--)
	{
		read(n),read(k);
		for(int i=1;i<=n;++i)
			read(p[i]),read(v[i]);
		double l=0,r=1e12;
		for(int t=1;t<=150;++t)
		{
			double mid=(l+r)/2.0;
			if(check(mid)) r=mid;
			else l=mid;
		}
		printf("%.9Lf\n",l*k);
	} 
	return 0;
}

详细

Test #1:

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

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.250000000
1.230769231
3000000000000.000000000

result:

ok 3 numbers

Test #2:

score: 0
Accepted
time: 724ms
memory: 5596kb

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.349110037
16414958969.727281190
5202715639.835183900
321977234.156325869
45384199210.221683972
183885744.769230769
1708925225.230472358
89786664971.557942636
13924365606.287388794
412975327.555555556
965508404.512101492
4703493416.288376524
352961619.381043819
5575125771.798797157
34119...

result:

ok 10000 numbers

Test #3:

score: 0
Accepted
time: 1427ms
memory: 5852kb

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.363636364
197971181.333333333
997533531.737629592
6439673170.665741784
993821598110.661077797
22727977326.402660986
34702455207.518504027
677770533.929817499
46631726883.969133232
5446481867.129032258
11336247450.272078594
4409370840.439131625
15681606050.576286855
14986614231.546859303
10...

result:

ok 93 numbers

Test #4:

score: 0
Accepted
time: 1071ms
memory: 9936kb

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.811770886
511413015796.766475350
424240880533.634020358
518849481155.503918767
1882496988186.443999887

result:

ok 5 numbers

Test #5:

score: 0
Accepted
time: 1465ms
memory: 9208kb

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.978608012
98630840901.507606953
29393530999.894327788
50801000770.955985419
39668001027.269331343
467846478226.411370814
30789914370.574311612
23151476830.905098433
51606123416.625827592
151713060001.662588909
100944679009.609286278
766785664078.358981669
39969642788.061867382
6234106593...

result:

ok 38 numbers