QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#105047 | #5505. Great Chase | kingstonduy | Compile Error | / | / | Python3 | 1.4kb | 2023-05-12 21:13:52 | 2023-05-12 21:13:54 |
Judging History
你现在查看的是最新测评结果
- [2023-08-10 23:21:45]
- System Update: QOJ starts to keep a history of the judgings of all the submissions.
- [2023-05-12 21:13:54]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2023-05-12 21:13:52]
- 提交
answer
#include <iostream>
#include <iomanip>
#include <vector>
#include <limits>
using namespace std;
int main() {
int tc;
cin >> tc;
while (tc != 0) {
tc--;
double n, v;
cin >> n >> v;
vector<pair<double, double>> a;
for (int i = 0; i < n; i++) {
double pi, vi;
cin >> pi >> vi;
a.push_back(make_pair(pi, vi));
}
double l = 0;
double r = 1e12;
double res = 0;
double e = 0.0000000001;
int cnt = 100;
while (l <= r && l + e < r && cnt != 0) {
cnt--;
double mid = (l + r) / 2;
double ls = -1e18;
double rs = 1e18;
for (int i = 0; i < n; i++) {
double temp1 = a[i].first;
double temp2 = a[i].second;
double dis = temp2 * mid;
if (temp1 < 0) {
ls = max(ls, temp1 + dis);
} else if (temp1 == temp2) {
rs = mid;
break;
} else {
rs = min(rs, temp1 - dis);
}
}
if (ls <= rs) {
res = max(res, mid);
l = mid + e;
} else {
r = mid - e;
}
}
cout << fixed << setprecision(10) << res * v << endl;
}
return 0;
}
详细
File "answer.code", line 5 using namespace std; ^^^^^^^^^ SyntaxError: invalid syntax