QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#768229 | #5505. Great Chase | wxhtzdy | AC ✓ | 1998ms | 9680kb | C++20 | 1.1kb | 2024-11-21 03:28:16 | 2024-11-21 03:28:16 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt;
cin >> tt;
while (tt--) {
int n, v;
cin >> n >> v;
vector<int64_t> p(n), s(n);
for (int i = 0; i < n; i++) {
cin >> p[i] >> s[i];
}
const int64_t inf = int64_t(1e12);
auto Check = [&](long double t) {
long double L = -inf;
long double R = inf;
for (int i = 0; i < n; i++) {
if (p[i] < 0) {
L = max(L, p[i] + t * s[i]);
} else {
R = min(R, p[i] - t * s[i]);
}
}
return L >= R;
};
int64_t limit = inf;
for (int i = 0; i < n; i++) {
limit = min(limit, (abs(p[i]) + inf + s[i] - 1) / s[i]);
}
long double low = 0, high = limit, t = 0;
for (int iter = 0; iter < 200; iter++) {
long double mid = (low + high) / 2;
if (Check(mid)) {
t = mid;
high = mid - 1;
} else {
low = mid + 1;
}
}
cout << fixed << setprecision(10) << t * v << '\n';
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3756kb
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 3000000000000.0000000000
result:
ok 3 numbers
Test #2:
score: 0
Accepted
time: 885ms
memory: 4020kb
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.3491100371 16414958969.7272811923 5202715639.8351839003 321977234.1563258690 45384199210.2216839716 183885744.7692307692 1708925225.2304723579 89786664971.5579426363 13924365606.2873887951 412975327.5555555556 965508404.5121014926 4703493416.2883765241 352961619.3810438190 5575125771.79...
result:
ok 10000 numbers
Test #3:
score: 0
Accepted
time: 1998ms
memory: 3916kb
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.7376295925 6439673170.6657417850 993821598110.6610778570 22727977326.4026609883 34702455207.5185040310 677770533.9298174987 46631726883.9691332355 5446481867.1290322584 11336247450.2720785942 4409370840.4391316255 15681606050.5762868561 14986614231...
result:
ok 93 numbers
Test #4:
score: 0
Accepted
time: 1392ms
memory: 9680kb
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.8117709160 511413015796.7664753795 424240880533.6340203285 518849481155.5039187968 1882496988186.4440000057
result:
ok 5 numbers
Test #5:
score: 0
Accepted
time: 1785ms
memory: 6928kb
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.9786080196 98630840901.5076069608 29393530999.8943277895 50801000770.9559854232 39668001027.2693313435 467846478226.4113708436 30789914370.5743116140 23151476830.9050984345 51606123416.6258275919 151713060001.6625889242 100944679009.6092862785 766785664078.3589817286 39969642788.06186738...
result:
ok 38 numbers