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 all(vec) vec.begin(), vec.end()
#define ll long long
#define db double
#define pb push_back
#define pf push_front
#define newl "\n"
#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define f first
#define s second
#define MOD 1000000007
using namespace std;
#pragma GCC diagnostic ignored "-Wunused-result"
void setIO(string name = "") {
ios_base::sync_with_stdio(0); cin.tie(0);
cout << fixed << setprecision(15);
if (name.size()) {
freopen((name+".in").c_str(), "r", stdin);
freopen((name+".out").c_str(), "w", stdout);
}
}
map <pair <ll, ll>, bool> vis, exist;
priority_queue <pair <ll, ll>> pq;
void bfs(ll i, ll j)
{
pq.push({i, j});
vis[{i, j}] = true;
while (pq.size())
{
ll x = pq.top().f, y = pq.top().s;
pq.pop();
if (exist[{x + 1, y}] && !vis[{x + 1, y}])
{
pq.push({x + 1, y});
vis[{x + 1, y}] = true;
}
if (exist[{x - 1, y}] && !vis[{x - 1, y}])
{
pq.push({x - 1, y});
vis[{x - 1, y}] = true;
}
if (exist[{x, y + 1}] && !vis[{x, y + 1}])
{
pq.push({x, y + 1});
vis[{x, y + 1}] = true;
}
if (exist[{x, y - 1}] && !vis[{x, y - 1}])
{
pq.push({x, y - 1});
vis[{x, y - 1}] = true;
}
if (exist[{x + 1, y + 1}] && !vis[{x + 1, y + 1}])
{
pq.push({x + 1, y + 1});
vis[{x + 1, y + 1}] = true;
}
if (exist[{x + 1, y - 1}] && !vis[{x + 1, y - 1}])
{
pq.push({x + 1, y - 1});
vis[{x + 1, y - 1}] = true;
}
if (exist[{x - 1, y + 1}] && !vis[{x - 1, y + 1}])
{
pq.push({x - 1, y + 1});
vis[{x - 1, y + 1}] = true;
}
if (exist[{x - 1, y - 1}] && !vis[{x - 1, y - 1}])
{
pq.push({x - 1, y - 1});
vis[{x - 1, y - 1}] = true;
}
}
}
int main()
{
//fast
//setIO("");
//freopen("filename.in", "r", stdin);
//freopen("filename.out", "w", stdout);
ll n, t; cin >> n >> t;
vector <pair <ll, ll>> a(n);
map <pair <ll, ll>, ll> mp;
for (ll i = 0; i < n; i++)
{
cin >> a[i].f >> a[i].s;
mp[a[i]] = i + 1;
exist[a[i]] = true;
}
sort(a.rbegin(), a.rend());
bfs(a[0].f, a[0].s);
for (auto v : a)
{
if (!vis[v])
{
cout << "NO";
return 0;
}
}
cout << "YES" << newl;
for (auto v : a) cout << mp[v] << newl;
//cout << 1;
}
# | 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... |