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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
#define endl '\n'
using namespace std;
using namespace __gnu_pbds;
using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,t;
cin>>n>>t;
pair<int,int>pr[n];
for(auto &i:pr)cin>>i.first>>i.second;
pair<int,int>por[n];
for(int i=0;i<n;i++)por[i]=pr[i];
sort(pr,pr+n);
map<pair<int,int>,bool>vis;
priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>pq;
int mn=1000000000000000000ll,k=0;
pq.push(pr[k]);
deque<pair<int,int>>g;
int x[]={0,0,1,1,1};
int y[]={-1,1,-1,0,1};
int cnt=0;
while(pq.size()){
pair<int,int>p=pq.top();
pq.pop();
// cout<<'f'<<p.first<<' '<<p.second<<endl;
if(vis[p])continue;
bool bl=0;
for(int i=0;i<8;i++){
pair<int,int>pp=make_pair(p.first+x[i],p.second+y[i]);
if(vis[pp])bl=1;
}
if(!bl)cnt++;
assert(cnt<=1);
vis[p]=1;
g.push_back(p);
for(int i=0;i<8;i++){
pair<int,int>pp=make_pair(p.first+x[i],p.second+y[i]);
int k=lower_bound(pr,pr+n,pp)-pr;
if(k!=n&&pr[k]==pp&&!vis[pp]){
// cout<<'g'<<pp.first<<' '<<pp.second<<endl;
pq.push(pp);
}
}
}
int X[]={1,1,1,0,0,-1,-1,-1};
int Y[]={-1,0,1,-1,1,1,-1,0};
for(int i=n-1;i>=0;i--){
if(vis[pr[i]])continue;
bool bl=0;
for(int w=0;w<8;w++){
if(vis[{X[w]+pr[i].first,Y[w]+pr[i].second}])bl=1;
}
if(!bl)continue;
pq.push(pr[i]);
vis[pr[i]]=1;
while(pq.size()){
pair<int,int>p=pq.top();
pq.pop();
g.push_back(p);
for(int w=0;w<5;w++){
pair<int,int>pp={p.first+x[w],p.second+y[w]};
if(!vis[pp]&&binary_search(pr,pr+n,pp)){
vis[pp]=1;
pq.push(pp);
}
}
}
}
if(g.size()!=n){cout<<"NO";}
else{
cout<<"YES\n";
map<pair<int,int>,int>mp;
for(int i=0;i<n;i++){
mp[g[i]]=i+1;
}
for(int i=0;i<n;i++)cout<<mp[por[i]]<<endl;
}
}
Compilation message (stderr)
skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:73:16: warning: comparison of integer expressions of different signedness: 'std::deque<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
73 | if(g.size()!=n){cout<<"NO";}
| ~~~~~~~~^~~
skyscrapers.cpp:20:9: warning: unused variable 'mn' [-Wunused-variable]
20 | int mn=1000000000000000000ll,k=0;
| ^~
# | 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... |