QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#259807 | #5505. Great Chase | w4p3r# | WA | 353ms | 3648kb | C++20 | 1.6kb | 2023-11-21 14:20:12 | 2023-11-21 14:20:13 |
Judging History
answer
#include<bits/stdc++.h>
#define inf 1e18
#define eps 1e-6
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define REP(i,a,b) for(int i=a;i>=b;i--)
#define db double
#define ve vector<int>
#define pa pair<int,int>
#define fr first
#define sd second
#define pb push_back
#define mp make_pair
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
inline ll read()
{
char ch = getchar();
ll s = 0, w = 1;
while (ch < '0' || ch > '9') {if (ch == '-')w = -1; ch = getchar();}
while (ch >= '0' && ch <= '9') {s = s * 10 + ch - '0'; ch = getchar();}
return s * w;
}
#define N 400010
#define db double
#define int ll
int n; ll V;
ll p[N], v[N];
int ck(double T)
{
db A = 1e12, B = 1e12;
// cout << "GG:" << T << endl;
for (int i = 1; i <= n; i ++)
{
if (p[i] > 0) {A = min(A, 1.0 * p[i] - 1.0 * T * v[i]); }
if (p[i] < 0) {B = min(B, 1.0 * (-p[i]) - 1.0 * T * v[i]);}
// cout << "EEE:" << T * v[i] << endl;
}
// cout << T << " " << ((A + B) <= 0) << endl;
// if ((A + B) > 0) {cout << "???:" << A << ' ' << B << endl;}
return (A + B <= 0);
}
void sol()
{
cin >> n >> V;
for (int i = 1; i <= n; i ++)cin >> p[i] >> v[i];
db l = 0, r = 1e12, ans = 0;
int T = 80;
while (T --)
{
db mid = (l + r) / 2.0;
if (ck(mid))ans = mid, r = mid - eps;
else l = mid + eps;
}
cout << fixed << setprecision(15) << 1.0 * ans * V << '\n';
}
signed main()
{
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T; cin >> T;
while (T --)sol();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3568kb
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.250000000000057 1.230769230770293 3000000000000.000000000000000
result:
ok 3 numbers
Test #2:
score: -100
Wrong Answer
time: 353ms
memory: 3648kb
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.349121093750000 16414958969.727281570434570 5202715639.835184097290039 321977234.156326353549957 45384199210.221687316894531 183885744.769230782985687 1708925225.230473041534424 89786664971.557937622070312 13924365606.287389755249023 412975327.555555641651154 965508404.512102007865906 4...
result:
wrong answer 4566th numbers differ - expected: '1.0000010', found: '1.0000011', error = '0.0000001'