QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#105272 | #5505. Great Chase | Time7# | AC ✓ | 3452ms | 15796kb | C++17 | 1.3kb | 2023-05-13 20:26:58 | 2023-05-13 20:27:01 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
using lint = int64_t;
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int t; cin>>t;
while(t--){
int n; cin>>n;
using ld = long double;
ld v; cin>>v;
vector<pair<ld, ld>> pl, pr;
pl.reserve(n);
pr.reserve(n);
for(int i =0; i<n; i++){
ld p, v;
cin>>p>>v;
if(p < 0)
pl.push_back({p, v});
else
pr.push_back({p, v});
}
ld left = 0, right = 3000000000005;
int it = 500;
while(it--){
ld m = (left + right) / 2;
ld maxil = -1e12l;
ld minr = 1e12l;
// cout<<"mid "<<m<<"\n";
for(const auto &[p, v] : pl){
maxil = max<ld>(maxil, p + m * v);
//cout<<p + m * v<<" ";
}
// cout<<" ||| ";
for(const auto &[p, v] : pr){
minr = min<ld>(minr, p - m * v);
//cout<<p - m * v<<" ";
}
// cout<<"\n";
if(maxil < minr) left = m;
else right = m;
}
cout<<fixed<<setprecision(20)<<left*v<<"\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3620kb
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.24999999999999999653 1.23076923076923076914 2999999999999.99999976158142089844
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 2967ms
memory: 3812kb
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.34911002218723297119 16414958969.72728119045495986938 5202715639.83518389984965324402 321977234.15632586894207634032 45384199210.22168397158384323120 183885744.76923076921957544982 1708925225.23047235782723873854 89786664971.55794262886047363281 13924365606.28738879412412643433 41297532...
result:
ok 10000 numbers
Test #3:
score: 0
Accepted
time: 3367ms
memory: 5164kb
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.36363636363239493221 197971181.33333333332848269492 997533531.73762959236046299338 6439673170.66574178449809551239 993821598110.66107779741287231445 22727977326.40266098640859127045 34702455207.51850402727723121643 677770533.92981749866157770157 46631726883.96913323178887367249 5446481867....
result:
ok 93 numbers
Test #4:
score: 0
Accepted
time: 3452ms
memory: 15796kb
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.81177088618278503418 511413015796.76647534966468811035 424240880533.63402029871940612793 518849481155.50391876697540283203 1882496988186.44399988651275634766
result:
ok 5 numbers
Test #5:
score: 0
Accepted
time: 3382ms
memory: 11452kb
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.97860801219940185547 98630840901.50760695338249206543 29393530999.89432778768241405487 50801000770.95598541945219039917 39668001027.26933133974671363831 467846478226.41137081384658813477 30789914370.57431161217391490936 23151476830.90509843267500400543 51606123416.62582759186625480652 15...
result:
ok 38 numbers