Submission #564721

#TimeUsernameProblemLanguageResultExecution timeMemory
564721MrDebooBuilding Skyscrapers (CEOI19_skyscrapers)C++17
0 / 100
148 ms33564 KiB
#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>; vector<int>g; map<pair<int,int>,int>mp; map<pair<int,int>,bool>vis; 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(int i=0;i<n;i++){ cin>>pr[i].first>>pr[i].second; mp[pr[i]]=i+1; } sort(pr,pr+n); deque<pair<int,int>>dq={pr[0]}; vis[pr[0]]=1; int x[]={1,1,1}; int y[]={-1,0,1}; while(dq.size()){ pair<int,int>p=dq.front(); dq.pop_front(); g.push_back(mp[p]); for(int i=0;i<3;i++){ pair<int,int>pp={p.first+x[i],p.second+y[i]}; if(!vis[pp]&&mp[pp]){ vis[pp]=1; dq.push_back(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; dq.push_back(pr[i]); vis[pr[i]]=1; while(dq.size()){ pair<int,int>p=dq.front(); dq.pop_front(); g.push_back(mp[p]); for(int w=0;w<3;w++){ pair<int,int>pp={p.first+x[w],p.second+y[w]}; if(!vis[pp]&&mp[pp]){ vis[pp]=1; dq.push_back(pp); } } } } if(g.size()!=n){cout<<"NO";} else{ cout<<"YES\n"; for(auto &i:g)cout<<i<<endl; } }

Compilation message (stderr)

skyscrapers.cpp: In function 'int main()':
skyscrapers.cpp:62:16: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   62 |     if(g.size()!=n){cout<<"NO";}
      |        ~~~~~~~~^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...