#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
typedef long long ll;
const int M = 2e7 + 5, MOD = 1e9+7;
int vis[M], cnt;
vector<int> node[M];
struct point {int x, y, i;};
vector<int> ans;
void dfs(int s) {
ans.push_back(s);
vis[s] = true;
cnt++;
sort(node[s].rbegin(), node[s].rend());
for (int i:node[s]) {
if (!vis[i]) dfs(i);
}
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
srand(time(0));
int n, t;
cin >> n >> t;
vector<point> v(n);
for (auto&i:v) cin >> i.x >> i.y;
int ind = 1; for (auto&i:v) i.i = ind++;
vector<point> p;
sort(v.begin(), v.end(), [](point a, point b){if (a.y == b.y) return a.x < b.x; return a.y < b.y;});
for (int i = 0; i < n; i++) {
while (i < n && (!i || v[i].y == v[i-1].y)) {
p.push_back(v[i++]);
}
for (int j = 1; j < p.size(); j++) {
if (p[j-1].x+1 == p[j].x) {
node[p[j].i].push_back(p[j-1].i);
node[p[j-1].i].push_back(p[j].i);
}
}
p.clear();
p.push_back(v[i]);
}
p.clear();
sort(v.begin(), v.end(), [](point a, point b){if (a.x == b.x) return a.y < b.y; return a.x < b.x;});
for (int i = 0; i < n; i++) {
while (i < n && (!i || v[i].x == v[i-1].x)) {
p.push_back(v[i++]);
}
for (int j = 1; j < p.size(); j++) {
if (p[j-1].y+1 == p[j].y) {
node[p[j].i].push_back(p[j-1].i);
node[p[j-1].i].push_back(p[j].i);
}
}
p.clear();
p.push_back(v[i]);
}
p.clear();
sort(v.begin(), v.end(), [](point a, point b){if ((a.x+a.y) == (b.x+b.y)) return a.x < b.x; return a.x+a.y < b.x+b.y;});
for (int i = 0; i < n; i++) {
while (i < n && (!i || (v[i].x+v[i].y) == (v[i-1].x+v[i-1].y))) {
p.push_back(v[i++]);
}
for (int j = 1; j < p.size(); j++) {
if (p[j-1].x+1 == p[j].x) {
node[p[j].i].push_back(p[j-1].i);
node[p[j-1].i].push_back(p[j].i);
}
}
p.clear();
p.push_back(v[i]);
}
p.clear();
sort(v.begin(), v.end(), [](point a, point b){if ((a.x-a.y) == (b.x-b.y)) return a.x < b.x; return a.x-a.y < b.x-b.y;});
for (int i = 0; i < n; i++) {
while (i < n && (!i || (v[i].x-v[i].y) == (v[i-1].x-v[i-1].y))) {
p.push_back(v[i++]);
}
for (int j = 1; j < p.size(); j++) {
if (p[j-1].x+1 == p[j].x) {
node[p[j].i].push_back(p[j-1].i);
node[p[j-1].i].push_back(p[j].i);
}
}
p.clear();
p.push_back(v[i]);
}
dfs(n);
if (cnt == n) {
cout << "YES" << endl;
for (int i:ans) cout << i << endl;
} else cout << "NO" << endl;
return 0;
}
/*
3 2
0 0
0 1
0 2
*/
Compilation message
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:41:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
41 | for (int j = 1; j < p.size(); j++) {
| ~~^~~~~~~~~~
skyscrapers.cpp:59:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
59 | for (int j = 1; j < p.size(); j++) {
| ~~^~~~~~~~~~
skyscrapers.cpp:77:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for (int j = 1; j < p.size(); j++) {
| ~~^~~~~~~~~~
skyscrapers.cpp:95:27: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<point>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
95 | for (int j = 1; j < p.size(); j++) {
| ~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
226 ms |
469864 KB |
ans=YES N=1 |
| 2 |
Correct |
223 ms |
469932 KB |
ans=YES N=4 |
| 3 |
Correct |
245 ms |
469928 KB |
ans=NO N=4 |
| 4 |
Correct |
227 ms |
469928 KB |
ans=YES N=5 |
| 5 |
Correct |
228 ms |
469892 KB |
ans=YES N=9 |
| 6 |
Incorrect |
224 ms |
469856 KB |
Added cell 5 (0,0) not reachable from infinity |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
226 ms |
469864 KB |
ans=YES N=1 |
| 2 |
Correct |
223 ms |
469932 KB |
ans=YES N=4 |
| 3 |
Correct |
245 ms |
469928 KB |
ans=NO N=4 |
| 4 |
Correct |
227 ms |
469928 KB |
ans=YES N=5 |
| 5 |
Correct |
228 ms |
469892 KB |
ans=YES N=9 |
| 6 |
Incorrect |
224 ms |
469856 KB |
Added cell 5 (0,0) not reachable from infinity |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
226 ms |
469864 KB |
ans=YES N=1 |
| 2 |
Correct |
223 ms |
469932 KB |
ans=YES N=4 |
| 3 |
Correct |
245 ms |
469928 KB |
ans=NO N=4 |
| 4 |
Correct |
227 ms |
469928 KB |
ans=YES N=5 |
| 5 |
Correct |
228 ms |
469892 KB |
ans=YES N=9 |
| 6 |
Incorrect |
224 ms |
469856 KB |
Added cell 5 (0,0) not reachable from infinity |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
217 ms |
470016 KB |
ans=NO N=1934 |
| 2 |
Correct |
246 ms |
470024 KB |
ans=NO N=1965 |
| 3 |
Incorrect |
217 ms |
470328 KB |
Added cell 1823 (372,236) not reachable from infinity |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
226 ms |
469864 KB |
ans=YES N=1 |
| 2 |
Correct |
223 ms |
469932 KB |
ans=YES N=4 |
| 3 |
Correct |
245 ms |
469928 KB |
ans=NO N=4 |
| 4 |
Correct |
227 ms |
469928 KB |
ans=YES N=5 |
| 5 |
Correct |
228 ms |
469892 KB |
ans=YES N=9 |
| 6 |
Incorrect |
224 ms |
469856 KB |
Added cell 5 (0,0) not reachable from infinity |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
299 ms |
480680 KB |
ans=NO N=66151 |
| 2 |
Correct |
260 ms |
472212 KB |
ans=NO N=64333 |
| 3 |
Incorrect |
322 ms |
483548 KB |
Added cell 69316 (-16,-125) not reachable from infinity |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
217 ms |
470016 KB |
ans=NO N=1934 |
| 2 |
Correct |
246 ms |
470024 KB |
ans=NO N=1965 |
| 3 |
Incorrect |
217 ms |
470328 KB |
Added cell 1823 (372,236) not reachable from infinity |
| 4 |
Halted |
0 ms |
0 KB |
- |
