QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#129285 | #5505. Great Chase | Forever_Young# | AC ✓ | 387ms | 12760kb | C++14 | 1.0kb | 2023-07-22 13:49:45 | 2023-07-22 13:49:47 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
using namespace std;
int t,n,v,tail[2],b[2][400040];
LL a[2][400040];
double l,r;
int check(double x){
double ma[2];
ma[0]=a[0][0];
for (int i=0;i<tail[0];i++)
ma[0]=max(ma[0],a[0][i]+b[0][i]*x);
ma[1]=a[1][0];
for (int i=0;i<tail[1];i++)
ma[1]=min(ma[1],a[1][i]-b[1][i]*x);
//printf("%.9lf %.9lf %.9lf\n",x,ma[0],ma[1]);
if (ma[0]>ma[1]) return 1;
return 0;
}
int main(){
scanf("%d",&t);
while (t--){
scanf("%d%d",&n,&v);
tail[0]=tail[1]=0;
for (int i=0;i<n;i++){
LL tmpa;
int tmpb,typ;
scanf("%lld%d",&tmpa,&tmpb);
if (tmpa<0) typ=0;
else typ=1;
a[typ][tail[typ]]=tmpa;
b[typ][tail[typ]]=tmpb;
tail[typ]++;
}
//for (int i=0;i<2;i++)
//for (int j=0;j<tail[i];j++) printf("%lld %d\n",a[i][j],b[i][j]);
l=0;
r=1.0*(-a[0][0]+a[1][0])/(b[0][0]+b[1][0]);
for (int i=0;i<50;i++){
double mid=(l+r)/2;
if (check(mid)) r=mid;
else l=mid;
}
printf("%.9lf\n",(l+r)/2*v);
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 10024kb
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 2999999999999.998535156
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 294ms
memory: 7936kb
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.349243164 16414958969.727272034 5202715639.835180283 321977234.156377435 45384199210.224235535 183885744.769230902 1708925225.230436325 89786664971.557754517 13924365606.287385941 412975327.555557966 965508404.512101173 4703493416.288373947 352961619.381043613 5575125771.798792839 34119...
result:
ok 10000 numbers
Test #3:
score: 0
Accepted
time: 349ms
memory: 10004kb
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.363636285 197971181.333332956 997533531.737630367 6439673170.665733337 993821598110.661865234 22727977326.402404785 34702455207.518547058 677770533.929816127 46631726883.969093323 5446481867.129034042 11336247450.272096634 4409370840.439078331 15681606050.576370239 14986614231.546863556 10...
result:
ok 93 numbers
Test #4:
score: 0
Accepted
time: 373ms
memory: 12760kb
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.811462402 511413015796.766662598 424240880533.633911133 518849481155.503601074 1882496988186.445068359
result:
ok 5 numbers
Test #5:
score: 0
Accepted
time: 387ms
memory: 12128kb
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.978942871 98630840901.507522583 29393530999.894321442 50801000770.956001282 39668001027.269317627 467846478226.411193848 30789914370.574577332 23151476830.905448914 51606123416.625823975 151713060001.662719727 100944679009.609024048 766785664078.359619141 39969642788.061889648 6234106593...
result:
ok 38 numbers