QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#267810 | #5505. Great Chase | kilo_tobo_tarjen# | AC ✓ | 775ms | 10148kb | C++20 | 1.2kb | 2023-11-27 18:49:49 | 2023-11-27 18:49:49 |
Judging History
answer
#include <bits/stdc++.h>
// #include <bits/extc++.h>
// using namespace __gnu_cxx;
// using namespace __gnu_pbds;
using i64 = long long;
using namespace std;
const int N = 4e5 + 5;
// const int B = 500;
// const int M = 50005;
// const int base = 17131;
const int mod = 998244353;
// const int mod = 1e9 + 7;
// const double pi = acos(-1);
int n, v0;
i64 pos[N], v[N];
bool check(double time)
{
double l = -1e18, r = 1e18;
for (int i = 1; i <= n; i++)
{
if (pos[i] < 0)
l = max(l, time * v[i] + pos[i]);
else
r = min(r, 1.0 * pos[i] - time * v[i]);
}
if (l >= r)
return true;
else
return false;
}
void solve()
{
cin >> n >> v0;
for (int i = 1; i <= n; i++)
cin >> pos[i] >> v[i];
double l = 0, r = 1e12, mid;
int cnt = 100;
while (cnt--)
{
mid = (l + r) / 2.0;
if (check(mid))
r = mid;
else
l = mid;
}
cout << r * v0 << '\n';
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int t = 1;
cin >> t;
cout << fixed << setprecision(12);
while (t--)
solve();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 5888kb
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.250000000000 1.230769230769 3000000000000.000000000000
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 364ms
memory: 5888kb
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.349121093750 16414958969.727281570435 5202715639.835184097290 321977234.156325876713 45384199210.221687316895 183885744.769230782986 1708925225.230472326279 89786664971.557937622070 13924365606.287389755249 412975327.555555582047 965508404.512101650238 4703493416.288375854492 352961619....
result:
ok 10000 numbers
Test #3:
score: 0
Accepted
time: 723ms
memory: 6148kb
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.363636374474 197971181.333333343267 997533531.737629771233 6439673170.665741920471 993821598110.661010742188 22727977326.402664184570 34702455207.518508911133 677770533.929817557335 46631726883.969139099121 5446481867.129032135010 11336247450.272079467773 4409370840.439131736755 1568160605...
result:
ok 93 numbers
Test #4:
score: 0
Accepted
time: 521ms
memory: 10148kb
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.811767578125 511413015796.766479492188 424240880533.634033203125 518849481155.503906250000 1882496988186.444091796875
result:
ok 5 numbers
Test #5:
score: 0
Accepted
time: 775ms
memory: 8940kb
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.978607177734 98630840901.507614135742 29393530999.894325256348 50801000770.955986022949 39668001027.269332885742 467846478226.411437988281 30789914370.574314117432 23151476830.905097961426 51606123416.625831604004 151713060001.662597656250 100944679009.609283447266 766785664078.359008789...
result:
ok 38 numbers