제출 #1131213

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1131213		JuanJL	Building Skyscrapers (CEOI19_skyscrapers)	C++20	0 / 100	0 ms	328 KiB

skyscrapers

#include <bits/stdc++.h>

#define fst first
#define snd second
#define pb push_back
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(),x.end()
#define forn(i,a,b) for(int i = a; i < b; i++)
using namespace std;
typedef long long ll;

int main(){
	ll n,t; cin>>n>>t;
	if(t==2){ cout<<"NO\n"; return 0; }
	
	vector<pair<ll,pair<pair<ll,ll>,ll>>> build(n);
	forn(i,0,n){
		cin>>build[i].snd.fst.fst>>build[i].snd.fst.snd;
		build[i].fst=build[i].snd.fst.fst+build[i].snd.fst.snd;
		build[i].snd.snd=i;
	}
	
	sort(ALL(build));
	
	bool yes = true;
	
	vector<ll> res = {build[0].snd.snd};
	
	pair<ll,ll> pos=build[0].snd.fst;
	forn(i,1,n){
		pair<ll,ll> aux = build[i].snd.fst;
		if(abs(aux.fst-pos.fst)<=1 && abs(aux.snd-pos.snd) <=1){
			pos=build[i].snd.fst;
			res.pb(build[i].snd.snd);
		}else yes=false;
	}
	
	if(!yes) cout<<"No\n";
	else{
		cout<<"Yes\n";
		forn(i,0,SZ(res)) cout<<res[i]+1<<'\n';
	}
	
	return 0;
}

• 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