# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
564594 | almothana05 | Building Skyscrapers (CEOI19_skyscrapers) | C++14 | 0 ms | 0 KiB |
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 mod 1000000007
#define inf 100000000000000000
using namespace std;
unordered_map<int , unordered_map<int , int> >ist;
vector<vector<int> >num;
priority_queue<vector<int> >q;
vector<int>erg;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int menge , numm , nummer , que;
cin >> menge >> que;
for(int i = 0 ; i < menge ; i++){
cin >> numm >> nummer;
ist[numm][nummer] = i + 1;
num.push_back({numm , nummer , i + 1});
}
ist[num[0][0]][num[0][1]] = 0;
sort(num.begin() , num.end());
q.push(num[0]);
while(q.size()){
int x = q.top()[0] , y = q.top()[1] , z = q.top()[2];
// cout << z << "\n";
erg.push_back(z);
q.pop();
for(int i = -1 ; i <= 1 ; i++){
for(int j = -1 ; j <= 1 ; j++){
if(ist[x + i][y + j] > 0){
q.push({x + i , y + j , ist[x + i][y + j]});
ist[x + i][y + j] = 0;
}
}
}
}
if(erg.size() == menge){
cout << "YES\n";
for(int i = 0 ; i < erg.size() ; i++){
cout << erg[i] << "\n";
}
}
else{
cout << "NO\n";
}
}