Submission #564690

#	Time	Username	Problem	Language	Result	Execution time	Memory
564690		MrDeboo	Building Skyscrapers (CEOI19_skyscrapers)	C++17	0 / 100	249 ms	12620 KiB

skyscrapers

#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,pair<int,int>>,vector<pair<int,pair<int,int>>>,greater<pair<int,pair<int,int>>>>pq;
    int mn=1000000000000000000ll,k=0;
    for(int i=0;i<n;i++){
        if(abs(pr[i].first)+abs(pr[i].second)<mn){mn=abs(pr[i].first)+abs(pr[i].second);k=i;}
    }
    pq.push({mn,pr[k]});
    deque<pair<int,int>>g;
    int x[]={-1,-1,-1,0,0,1,1,1};
    int y[]={-1,1,0,1,-1,-1,1,0};
    while(pq.size()){
        pair<int,int>p=pq.top().second;
        pq.pop();
        // cout<<'f'<<p.first<<' '<<p.second<<endl;
        if(vis[p])continue;
        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({abs(pp.first)+abs(pp.second),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:44: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]
   44 |     if(g.size()!=n){cout<<"NO";}
      |        ~~~~~~~~^~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 12
• Subtask 4: 0 / 17
• Subtask 5: 0 / 20
• Subtask 6: 0 / 10
• Subtask 7: 0 / 19