Submission #943902

#	Time	Username	Problem	Language	Result	Execution time	Memory
943902		vjudge1	Building Skyscrapers (CEOI19_skyscrapers)	C++17	0 / 100	119 ms	9344 KiB

skyscrapers

#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
signed main(){
    ios_base::sync_with_stdio();
    cin.tie(0);cout.tie(0);
    int n,t;
    cin>>n>>t;
    vector <int> x(n),y(n);
    map <pair <int,int> ,int> mp;
    map <int,vector <pair <int,int> > > ind;
    for(int i=0;i<n;i++){
        cin>>x[i]>>y[i];
        mp[{x[i],y[i]}]=1;
        ind[x[i]].pb({y[i],i+1});
    }
    queue <pair <int,int> > q;
    vector <int> v={-1,1,0};
    q.push({x[0],y[0]});
    mp[{x[0],y[0]}]=2;
    while(!q.empty()){
        int X=q.front().ff;
        int Y=q.front().ss;
        q.pop();
        for(auto a : v){
            for(auto b : v){
                if(mp[{X+a,Y+b}]==1){
                    mp[{X+a,Y+b}]=2;
                    q.push({X+a,Y+b});
                }
            }
        }
    }
    bool ok=1;
    for(int i=0;i<n;i++){
        if(mp[{x[i],y[i]}]==1){
            ok=0;break;
        }
    }
    if(ok){
        cout<<"YES\n";
        for(auto x : ind){
            vector <pair <int,int> >  y=x.ss;
            sort(all(y));
            for(auto i : y)cout<<i.ss<<" ";
        }
    }
    else cout<<"NO\n";
}
/*
 
*/

• 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