#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) x.begin(), x.end()
#define size(x) (int)x.size()
template<class S, class T>
bool chmin(S &a, const T &b) {
return a > b ? (a = b) == b : false;
}
template<class S, class T>
bool chmax(S &a, const T &b) {
return a < b ? (a = b) == b : false;
}
const vector<int> dx = {-1, -1, -1, 0, 0, 1, 1, 1};
const vector<int> dy = {-1, 0, 1, -1, 1, -1, 0, 1};
signed main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, t; cin >> n >> t;
int x[n], y[n];
map<int, map<int, bool>> vis;
map<int, map<int, int>> used;
int Min = -1;
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i];
used[x[i]][y[i]] = i + 1;
if (Min == -1 || x[Min] + y[Min] > x[i] + y[i]) {
Min = i;
}
}
for (int i = 0; i < n; ++i) {
bool flag = false;
for (int j = 0; j < 8; ++j) {
if (used[x[i] + dx[j]][y[i] + dy[j]]) {
flag |= true;
}
}
if (!flag) {
cout << "NO";
return 0;
}
}
vector<int> res;
priority_queue<array<int, 2>,
vector<array<int, 2>>,
greater<array<int, 2>>> q;
q.push({x[Min] + y[Min], Min});
vis[x[Min]][y[Min]] = true;
while (!q.empty()) {
int i = q.top()[1];
res.push_back(i + 1);
q.pop();
for (int j = 0; j < 8; ++j) {
int to_x = x[i] + dx[j], to_y = y[i] + dy[j];
if (used[to_x][to_y]) {
if (!vis[to_x][to_y]) {
vis[to_x][to_y] = true;
q.push({to_x + to_y, used[to_x][to_y] - 1});
}
}
}
}
if (size(res) < n) {
cout << "NO";
return 0;
}
cout << "YES\n";
for (auto i : res) cout << i << '\n';
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
604 KB |
ans=NO N=1934 |
2 |
Correct |
1 ms |
600 KB |
ans=NO N=1965 |
3 |
Incorrect |
4 ms |
600 KB |
Contestant's solution is not lexicographically largest at index 1824 (1813 vs 640) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
600 KB |
Contestant did not find solution |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
29 ms |
6036 KB |
ans=NO N=66151 |
2 |
Correct |
23 ms |
5760 KB |
ans=NO N=64333 |
3 |
Incorrect |
226 ms |
11176 KB |
Contestant's solution is not lexicographically largest at index 69316 (69235 vs 53153) |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
604 KB |
ans=NO N=1934 |
2 |
Correct |
1 ms |
600 KB |
ans=NO N=1965 |
3 |
Incorrect |
4 ms |
600 KB |
Contestant's solution is not lexicographically largest at index 1824 (1813 vs 640) |
4 |
Halted |
0 ms |
0 KB |
- |