This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())
using namespace std;
template<typename U, typename V> bool maxi(U &a, V b) {
if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
if (a > b) { a = b; return 1; } return 0;
}
const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;
void prepare(); void main_code();
int main() {
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
const bool MULTITEST = 0; prepare();
int num_test = 1; if (MULTITEST) cin >> num_test;
while (num_test--) { main_code(); }
}
void prepare() {};
int n;
ii a[N];
namespace SUB1 {
const int dx[5] = {0, 0, 1, 1, 1};
const int dy[5] = {-1, 1, -1, 0, 1};
bool vis[N];
void sol() {
map<ii, int> mp;
sort(a + 1, a + n + 1);
FOR(i, 1, n) mp[a[i]]=i;
// sort theo a[i].first
#define T pair<ii, int>
priority_queue<T, vec<T>, greater<T>> pq;
vec<int> res;
pq.push(_mp(a[1], 1));
vis[1]=1;
while (!pq.empty()) {
auto fx = pq.top();
pq.pop();
int u = fx.se;
// cerr << u << nl;
res.push_back(u);
int x=fx.fi.fi;
int y=fx.fi.se;
FOR(d, 0, 4) {
int u=x+dx[d];
int v=y+dy[d];
if (mp[_mp(u,v)]>0){
int k=mp[_mp(u,v)];
if (!vis[k]){
vis[k]=1;
pq.push(_mp(_mp(u,v),k));
}
}
}
}
if(sz(res)!=n)
evoid("NO");
cout << yes << nl;
for(int x : res) cout << x << nl;
}
};
void main_code() {
int t;
cin >> n >> t;
for(int i = 1; i <= n; ++i) {
cin >> a[i].fi >> a[i].se;
}
if (t == 1) {
return SUB1::sol(), void();
}
}
/* Let the river flows naturally */
Compilation message (stderr)
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
36 | freopen(task".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
skyscrapers.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen(task".out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |