Submission #943879

#	Time	Username	Problem	Language	Result	Execution time	Memory
943879		vjudge1	Building Skyscrapers (CEOI19_skyscrapers)	C++17	54 / 100	403 ms	101384 KiB

skyscrapers

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "YES\n" ; else cout << "NO\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 3e5 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n , m , cnt ;
pii a[N] ;
map <int , map <int , int>> vis , c , ind ;
vector <int> ans ;

void solve(){
	
	cin >> n >> m ;
	for ( int i = 0 ; i < n ; i ++ ){
		cin >> a[i].ff >> a[i].ss ;
		c[a[i].ff][a[i].ss] = 1 ;
		ind[a[i].ff][a[i].ss] = i ;
	} sort ( a , a + n ) ;
	set <pii> st ;
	st.insert({a[0].ff,a[0].ss}) ;
	while ( !st.empty() ){
		int x = st.begin()->ff ;
		int y = st.begin()->ss ;
		vis[x][y] = 1 ; cnt ++ ;
		ans.push_back(ind[x][y]) ;
		st.erase(st.begin()) ;
		for ( int i = -1 ; i < 2 ; i ++ ){
			for ( int j = -1 ; j < 2 ; j ++ ){
				if ( c[x+i][y+j] == 1 && !vis[x+i][y+j] ){
					st.insert({x+i,y+j}) ;
				}
			}
		}
	}
	if ( cnt == n ){
		YES() ;
		for ( auto i : ans ) cout << i+1 << endl ;
		return ;
	}NO() ;
}

signed main(){
    ios ;
    int t = 1 ;
    //cin >> t ;
    while ( t -- ) solve() ;
}

Compilation message (stderr)

skyscrapers.cpp: In function 'void fopn(std::string)':
skyscrapers.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
skyscrapers.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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