QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#818122 | #9668. Isoball: 2D Version | ccsurzw | WA | 13ms | 3816kb | C++23 | 1.9kb | 2024-12-17 16:35:58 | 2024-12-17 16:35:58 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define N 201000
#define endl '\n'
ll mod = 998244353;
ld x, y, r, Vx, Vy,nx,ny;
ld Lx, Ly, Rx, Ry;
ld k, b;
ld get_y(ld x) {
return k * x + b;
}
ld get_x(ld y) {
return (y - b) / k;
}
//ld get_dis(ld x, ld y, ld nx,ld ny) {
// return sqrt((nx - x) * (nx - x) + (ny - y) * (ny - y))
//}
bool haveSameSign(long double a, long double b) {
return a * b >= 0; // 乘积非负,表示符号相同
}
void solve() {
cin >> x >> y >> r >> Vx >> Vy;
cin >> Lx >> Ly >> Rx >> Ry;
k = Vy / Vx;
b = y - k * x;
nx = Lx + r;//新的圆坐标
ny = get_y(nx);//新的圆坐标
if (ny - Ly >= r && Ry - ny >= r && Rx - nx >= r) {
if (haveSameSign(nx - x , Vx) && haveSameSign(ny - y , Vy)) {
cout << "Yes" << endl;
return;
}
}
nx = Rx - r;//新的圆坐标
ny = get_y(nx);//新的圆坐标
if (ny - Ly >= r && Ry - ny >= r && nx - Lx >= r) {
if (haveSameSign(nx - x, Vx) && haveSameSign(ny - y, Vy)) {
cout << "Yes" << endl;
return;
}
}
ny = Ly + r;
nx = get_x(ny);
if (nx - Lx >= r && Ry - ny >= r && Rx - nx >= r) {
if (haveSameSign(nx - x, Vx) && haveSameSign(ny - y, Vy)) {
cout << "Yes" << endl;
return;
}
}
ny = Ry - r;
nx = get_x(ny);
if (nx - Lx >= r && ny - Ly >= r && Rx - nx >= r) {
if (haveSameSign(nx - x, Vx) && haveSameSign(ny - y, Vy)) {
cout << "Yes" << endl;
return;
}
}
cout << "No" << endl;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
cin >> t;
while (t--) {
solve();
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3652kb
input:
5 0 0 1 1 0 2 -2 6 2 0 0 1 1 0 2 0 6 2 0 0 1 1 1 1 1 3 3 0 0 1 -1 -1 1 1 3 3 0 0 1 -1 1 -5 -5 5 5
output:
Yes No Yes No Yes
result:
ok 5 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3816kb
input:
2 0 0 1000000 1000000 1000000 -1000000 -1000000 1000000 1000000 1000000 1000000 1 -1000000 -1000000 -1000000 -1000000 -999999 -999999
output:
Yes No
result:
ok 2 lines
Test #3:
score: -100
Wrong Answer
time: 13ms
memory: 3740kb
input:
10000 10 -10 10 1 -2 -13 -8 6 -1 -7 -10 3 3 1 -3 -12 14 -9 -9 -2 4 4 -3 -11 7 -8 12 -3 1 8 -1 0 -11 1 19 13 -1 8 9 -3 2 11 -5 17 4 -2 -7 3 -3 5 -12 -14 10 1 0 3 6 -5 3 -11 2 2 16 4 9 6 5 -4 -8 -11 18 -1 0 0 8 4 -2 -10 -15 1 12 8 4 4 5 2 -17 3 8 7 -3 7 10 -4 0 1 0 10 20 -6 -10 5 -3 -1 -20 -20 15 7 5 ...
output:
No No No No No Yes No No No No No Yes No Yes No No Yes No Yes No No No No No Yes No No No Yes No No No Yes No No Yes No No No No No No No No No No No No Yes No No No No No No No No No Yes Yes No No Yes Yes Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes...
result:
wrong answer 161st lines differ - expected: 'Yes', found: 'No'