QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#77580 | #5505. Great Chase | XKError | AC ✓ | 2030ms | 9852kb | C++ | 698b | 2023-02-15 09:30:31 | 2023-02-15 09:30:34 |
Judging History
answer
#include <bits/stdc++.h>
#define maxn 400005
#define ll long long
#define ld long double
using namespace std;
int n;
ll d;
ll p[maxn];
ll v[maxn];
int main() {
int T;
scanf("%d", &T);
while (T--) {
scanf("%d%lld", &n, &d);
for (int i = 1; i <= n; i++) scanf("%lld%lld", &p[i], &v[i]);
ld l = 0, r = 2e12, mid;
for (int i = 1; i <= 200; i++) {
mid = (l + r) / 2.0;
ld mn = 1e18, mx = -1e18;
for (int j = 1; j <= n; j++) {
if (p[j] < 0) mx = max(mx, p[j] + v[j] * mid);
else mn = min(mn, p[j] - v[j] * mid);
}
// cout<<mn<<" "<<mx<<endl;
if (mx >= mn) r = mid;
else l = mid;
}
printf("%.10Lf\n", l * d);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 5832kb
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.2500000000 1.2307692308 2999999999999.9999997616
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 1051ms
memory: 5696kb
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.3491100222 16414958969.7272811905 5202715639.8351838998 321977234.1563258689 45384199210.2216839716 183885744.7692307692 1708925225.2304723578 89786664971.5579426289 13924365606.2873887941 412975327.5555555555 965508404.5121014925 4703493416.2883765236 352961619.3810438190 5575125771.79...
result:
ok 10000 numbers
Test #3:
score: 0
Accepted
time: 2030ms
memory: 6064kb
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.3636363636 197971181.3333333333 997533531.7376295924 6439673170.6657417845 993821598110.6610777974 22727977326.4026609864 34702455207.5185040273 677770533.9298174987 46631726883.9691332318 5446481867.1290322579 11336247450.2720785933 4409370840.4391316250 15681606050.5762868552 14986614231...
result:
ok 93 numbers
Test #4:
score: 0
Accepted
time: 1616ms
memory: 9852kb
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.8117708862 511413015796.7664753497 424240880533.6340202987 518849481155.5039187670 1882496988186.4439998865
result:
ok 5 numbers
Test #5:
score: 0
Accepted
time: 2018ms
memory: 9200kb
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.9786080122 98630840901.5076069534 29393530999.8943277877 50801000770.9559854195 39668001027.2693313397 467846478226.4113708138 30789914370.5743116122 23151476830.9050984327 51606123416.6258275919 151713060001.6625889093 100944679009.6092862785 766785664078.3589816689 39969642788.06186738...
result:
ok 38 numbers