oj.uz

답안 #943879

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
943879 2024-03-12T03:28:52 Z vjudge1 Building Skyscrapers (CEOI19_skyscrapers) C++17
54 / 100
 403 ms 101384 KB 
#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

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.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ans=YES N=1
2 Correct 0 ms 344 KB ans=YES N=4
3 Correct 0 ms 344 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 1 ms 348 KB ans=YES N=5
7 Correct 1 ms 600 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 1 ms 348 KB ans=YES N=8
16 Correct 0 ms 348 KB ans=NO N=2

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ans=YES N=1
2 Correct 0 ms 344 KB ans=YES N=4
3 Correct 0 ms 344 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 1 ms 348 KB ans=YES N=5
7 Correct 1 ms 600 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 1 ms 348 KB ans=YES N=8
16 Correct 0 ms 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 344 KB ans=YES N=63
24 Correct 0 ms 344 KB ans=YES N=87
25 Correct 1 ms 416 KB ans=YES N=183
26 Correct 1 ms 600 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 344 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 600 KB ans=YES N=182
34 Correct 1 ms 468 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 348 KB ans=YES N=188
38 Correct 1 ms 344 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 348 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 0 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ans=YES N=1
2 Correct 0 ms 344 KB ans=YES N=4
3 Correct 0 ms 344 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 1 ms 348 KB ans=YES N=5
7 Correct 1 ms 600 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 1 ms 348 KB ans=YES N=8
16 Correct 0 ms 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 344 KB ans=YES N=63
24 Correct 0 ms 344 KB ans=YES N=87
25 Correct 1 ms 416 KB ans=YES N=183
26 Correct 1 ms 600 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 344 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 600 KB ans=YES N=182
34 Correct 1 ms 468 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 348 KB ans=YES N=188
38 Correct 1 ms 344 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 348 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 0 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195
44 Correct 2 ms 1116 KB ans=NO N=1934
45 Correct 1 ms 604 KB ans=NO N=1965
46 Correct 3 ms 856 KB ans=YES N=1824
47 Correct 5 ms 860 KB ans=YES N=1981
48 Correct 4 ms 860 KB ans=YES N=1814
49 Correct 4 ms 860 KB ans=YES N=1854
50 Correct 3 ms 856 KB ans=YES N=1831
51 Correct 4 ms 860 KB ans=YES N=2000
52 Correct 3 ms 860 KB ans=YES N=1847
53 Correct 5 ms 900 KB ans=YES N=1819
54 Correct 4 ms 728 KB ans=YES N=1986
55 Correct 4 ms 1116 KB ans=YES N=2000
56 Correct 3 ms 1116 KB ans=YES N=1834
57 Correct 4 ms 1112 KB ans=YES N=1860
58 Correct 4 ms 1116 KB ans=YES N=1898
59 Correct 4 ms 1116 KB ans=YES N=1832
60 Correct 4 ms 1112 KB ans=YES N=1929
61 Correct 4 ms 856 KB ans=YES N=1919
62 Correct 4 ms 1116 KB ans=YES N=1882
63 Correct 4 ms 1368 KB ans=YES N=1922
64 Correct 4 ms 1112 KB ans=YES N=1989
65 Correct 3 ms 860 KB ans=YES N=1978
66 Correct 4 ms 1372 KB ans=YES N=1867
67 Correct 5 ms 1064 KB ans=YES N=1942

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1112 KB ans=NO N=1934
2 Correct 1 ms 604 KB ans=NO N=1965
3 Incorrect 3 ms 860 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB ans=YES N=1
2 Correct 0 ms 344 KB ans=YES N=4
3 Correct 0 ms 344 KB ans=NO N=4
4 Correct 0 ms 348 KB ans=YES N=5
5 Correct 1 ms 348 KB ans=YES N=9
6 Correct 1 ms 348 KB ans=YES N=5
7 Correct 1 ms 600 KB ans=NO N=9
8 Correct 0 ms 348 KB ans=NO N=10
9 Correct 0 ms 348 KB ans=YES N=10
10 Correct 0 ms 348 KB ans=YES N=10
11 Correct 0 ms 348 KB ans=YES N=10
12 Correct 0 ms 348 KB ans=YES N=9
13 Correct 0 ms 348 KB ans=YES N=9
14 Correct 0 ms 348 KB ans=YES N=8
15 Correct 1 ms 348 KB ans=YES N=8
16 Correct 0 ms 348 KB ans=NO N=2
17 Correct 0 ms 348 KB ans=YES N=17
18 Correct 0 ms 348 KB ans=YES N=25
19 Correct 1 ms 348 KB ans=YES N=100
20 Correct 1 ms 348 KB ans=YES N=185
21 Correct 0 ms 348 KB ans=NO N=174
22 Correct 1 ms 348 KB ans=YES N=90
23 Correct 1 ms 344 KB ans=YES N=63
24 Correct 0 ms 344 KB ans=YES N=87
25 Correct 1 ms 416 KB ans=YES N=183
26 Correct 1 ms 600 KB ans=YES N=188
27 Correct 1 ms 348 KB ans=YES N=183
28 Correct 1 ms 344 KB ans=YES N=189
29 Correct 1 ms 348 KB ans=YES N=200
30 Correct 1 ms 348 KB ans=YES N=190
31 Correct 1 ms 348 KB ans=YES N=187
32 Correct 1 ms 348 KB ans=YES N=187
33 Correct 1 ms 600 KB ans=YES N=182
34 Correct 1 ms 468 KB ans=YES N=184
35 Correct 1 ms 348 KB ans=YES N=188
36 Correct 1 ms 348 KB ans=YES N=181
37 Correct 1 ms 348 KB ans=YES N=188
38 Correct 1 ms 344 KB ans=YES N=191
39 Correct 1 ms 348 KB ans=YES N=196
40 Correct 1 ms 348 KB ans=YES N=196
41 Correct 1 ms 348 KB ans=YES N=196
42 Correct 0 ms 348 KB ans=YES N=196
43 Correct 1 ms 348 KB ans=YES N=195
44 Correct 2 ms 1116 KB ans=NO N=1934
45 Correct 1 ms 604 KB ans=NO N=1965
46 Correct 3 ms 856 KB ans=YES N=1824
47 Correct 5 ms 860 KB ans=YES N=1981
48 Correct 4 ms 860 KB ans=YES N=1814
49 Correct 4 ms 860 KB ans=YES N=1854
50 Correct 3 ms 856 KB ans=YES N=1831
51 Correct 4 ms 860 KB ans=YES N=2000
52 Correct 3 ms 860 KB ans=YES N=1847
53 Correct 5 ms 900 KB ans=YES N=1819
54 Correct 4 ms 728 KB ans=YES N=1986
55 Correct 4 ms 1116 KB ans=YES N=2000
56 Correct 3 ms 1116 KB ans=YES N=1834
57 Correct 4 ms 1112 KB ans=YES N=1860
58 Correct 4 ms 1116 KB ans=YES N=1898
59 Correct 4 ms 1116 KB ans=YES N=1832
60 Correct 4 ms 1112 KB ans=YES N=1929
61 Correct 4 ms 856 KB ans=YES N=1919
62 Correct 4 ms 1116 KB ans=YES N=1882
63 Correct 4 ms 1368 KB ans=YES N=1922
64 Correct 4 ms 1112 KB ans=YES N=1989
65 Correct 3 ms 860 KB ans=YES N=1978
66 Correct 4 ms 1372 KB ans=YES N=1867
67 Correct 5 ms 1064 KB ans=YES N=1942
68 Correct 151 ms 19132 KB ans=NO N=66151
69 Correct 42 ms 11356 KB ans=NO N=64333
70 Correct 142 ms 17352 KB ans=YES N=69316
71 Correct 130 ms 16836 KB ans=YES N=66695
72 Correct 141 ms 17252 KB ans=YES N=68436
73 Correct 140 ms 17604 KB ans=YES N=70000
74 Correct 141 ms 17352 KB ans=YES N=68501
75 Correct 152 ms 17996 KB ans=YES N=70000
76 Correct 133 ms 17612 KB ans=YES N=65009
77 Correct 145 ms 22220 KB ans=YES N=67007
78 Correct 153 ms 24520 KB ans=YES N=66357
79 Correct 145 ms 25872 KB ans=YES N=65430
80 Correct 149 ms 25264 KB ans=YES N=65790
81 Correct 144 ms 24192 KB ans=YES N=66020
82 Correct 141 ms 22936 KB ans=YES N=65809
83 Correct 131 ms 18960 KB ans=YES N=65651
84 Correct 158 ms 29736 KB ans=YES N=68040
85 Correct 151 ms 27552 KB ans=YES N=66570
86 Correct 129 ms 17168 KB ans=YES N=65421
87 Correct 139 ms 18620 KB ans=YES N=68351
88 Correct 127 ms 16856 KB ans=YES N=67027
89 Correct 113 ms 21448 KB ans=YES N=68879
90 Correct 136 ms 18204 KB ans=YES N=67256
91 Correct 355 ms 36816 KB ans=YES N=148315
92 Correct 132 ms 24144 KB ans=NO N=142745
93 Correct 203 ms 54096 KB ans=NO N=148443
94 Correct 372 ms 37796 KB ans=YES N=148328
95 Correct 379 ms 37984 KB ans=YES N=147855
96 Correct 367 ms 38748 KB ans=YES N=150000
97 Correct 342 ms 37056 KB ans=YES N=144725
98 Correct 370 ms 38208 KB ans=YES N=149445
99 Correct 359 ms 37648 KB ans=YES N=144455
100 Correct 340 ms 36960 KB ans=YES N=143487
101 Correct 355 ms 38332 KB ans=YES N=149688
102 Correct 354 ms 47100 KB ans=YES N=141481
103 Correct 395 ms 64700 KB ans=YES N=147430
104 Correct 356 ms 43708 KB ans=YES N=142247
105 Correct 377 ms 49256 KB ans=YES N=149941
106 Correct 361 ms 61888 KB ans=YES N=141635
107 Correct 378 ms 54988 KB ans=YES N=142896
108 Correct 388 ms 58604 KB ans=YES N=142069
109 Correct 360 ms 39140 KB ans=YES N=142378
110 Correct 390 ms 54752 KB ans=YES N=150000
111 Correct 381 ms 65012 KB ans=YES N=141452
112 Correct 384 ms 69812 KB ans=YES N=134453
113 Correct 403 ms 101384 KB ans=YES N=144172

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 137 ms 19048 KB ans=NO N=66151
2 Correct 42 ms 11204 KB ans=NO N=64333
3 Incorrect 139 ms 17348 KB Contestant's solution is not lexicographically largest at index 69316 (69235 vs 7320)
4 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1112 KB ans=NO N=1934
2 Correct 1 ms 604 KB ans=NO N=1965
3 Incorrect 3 ms 860 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -