QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#47492 | #4383. Laser | neko_nyaa# | AC ✓ | 93ms | 4776kb | C++ | 1.7kb | 2022-09-10 11:51:21 | 2022-09-10 11:51:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n; cin >> n;
vector<int> x(n), y(n);
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
x[i] *= 2; y[i] *= 2;
}
int i1 = 0, i2 = -1;
for (int i = 1; i < n; i++) {
if (x[i] != x[0] && y[i] != y[0] && x[i]+y[i] != x[0]+y[0] && x[i]-y[i] != x[0]-y[0]) {
i2 = i; break;
}
}
if (i2 == -1) {
cout << "YES\n";
return;
}
vector<pair<int, int>> candidates;
int sum1 = x[i1] + y[i1];
int dif1 = x[i1] - y[i1];
int sum2 = x[i2] + y[i2];
int dif2 = x[i2] - y[i2];
// x1 y1 sum1 dif1
// x2 y2 sum2 dif2
candidates.emplace_back(x[i1], y[i2]);
candidates.emplace_back(x[i1], sum2 - x[i1]);
candidates.emplace_back(x[i1], x[i1] - dif2);
candidates.emplace_back(x[i2], y[i1]);
candidates.emplace_back(sum2 - y[i1], y[i1]);
candidates.emplace_back(y[i1] + dif2, y[i1]);
candidates.emplace_back(x[i2], sum1 - x[i2]);
candidates.emplace_back(sum1 - y[i2], y[i2]);
candidates.emplace_back((sum1 + dif2)/2, (sum1 - dif2)/2);
candidates.emplace_back(x[i2], x[i2] - dif1);
candidates.emplace_back(y[i2] + dif1, y[i2]);
candidates.emplace_back((sum2 + dif1)/2, (sum2 - dif1)/2);
for (auto [xx, yy]: candidates) {
bool yes = 1;
for (int i = 0; i < n; i++) {
bool fine = 0;
if (x[i] == xx) fine = 1;
if (y[i] == yy) fine = 1;
if (x[i]+y[i] == xx+yy) fine = 1;
if (x[i]-y[i] == xx-yy) fine = 1;
if (fine == 0) yes = 0;
}
if (yes) {
cout << "YES\n";
//cout << xx << ' ' << yy << '\n';
return;
}
}
cout << "NO\n";
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int t; cin >> t;
while (t--) {
solve();
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 93ms
memory: 4776kb
input:
116 4 -10 0 10 0 5 5 -5 -5 4 -10 0 10 0 0 10 0 -10 4 -1 0 1 0 2 0 3 0 4 0 1 0 2 0 3 0 4 4 100 100 10000 10000 100000 100000 -100 -100 4 -100 100 -10000 10000 -100000 100000 100 -100 6 1 1 1 3 2 2 3 1 3 3 3 4 7 1 1 1 3 2 2 3 1 3 3 1 4 3 4 4 1236833 14678 1232056 9901 1237055 9790 1231834 15011 4 1236...
output:
YES YES YES YES YES YES YES NO YES NO NO YES NO NO YES YES NO NO YES YES YES YES YES YES NO YES YES YES YES YES YES YES NO YES YES NO NO YES NO NO NO YES YES YES NO NO YES YES NO NO NO NO NO YES YES NO YES NO NO YES NO YES NO NO NO NO YES YES YES NO YES YES YES NO YES YES NO YES NO YES YES NO YES NO...
result:
ok 116 lines