oj.uz

답안 #280018

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
280018 2020-08-22T12:45:18 Z infinite_iq Building Skyscrapers (CEOI19_skyscrapers) C++14
54 / 100
 1300 ms 96240 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mp make_pair
#define mid (l+r)/2
#define le node * 2 
#define ri node * 2 + 1 
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
#define all(x) x.begin(), x.end()
#define gc getchar_unlocked
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
typedef pair<double,ll>pdi;
const ll inf=1e18;
const ll Mod=1e9+7;
const ld Pi=acos(-1) ;
int n , t , yes = 0 , num = 0 ;
vi ans ;
map < pi , int > Node , who , done , crnt ;
map < int , pi > id ;
int X [] = { 0 , 1 , 1 , 1 , 0 , -1 , -1 , -1 } ;
int Y [] = { 1 , 1 , 0 , -1 , -1 , -1 , 0 , 1 } ;
void bfs ( int stx , int sty ) {
        done .clear () ;
        ans  .clear () ;
        done [mp(stx,sty)] = 1 ;
        set < pi > q ;
        q .ins ( { stx , sty } ) ;
        while ( q .size () ) {
                pi ret = *q .begin () ;
                q .era (ret) ;
                ans .pb ( who [ret] ) ;
                for ( int i = 0 ; i < 8 ; i ++ ) {
                        int nx = ret.fi + X [i] ;
                        int ny = ret.se + Y [i] ;
                        if ( done [mp(nx,ny)] ) C ;
                        if ( ! Node [mp(nx,ny)] ) C ;
                        done [mp(nx,ny)] = 1 ;
                        q .ins ( { nx , ny } ) ;
                }
        }
        if ( ans .size () != n ) cout << "NO" << endl ;
        else {
                cout << "YES" << endl ;
                for ( auto u : ans ) cout << u + 1 << endl ;
        }
}
int main () {
        cin >> n >> t ;
        for ( int i = 0 ; i < n ; i ++ ) {
                int x , y ;
                cin >> x >> y ;
                Node [ mp ( x , y ) ] = 1 ;
                who  [ mp ( x , y ) ] = i ;
                id [i] = mp ( x , y ) ;
        }
        bfs ( id [0] .fi , id [0] .se ) ;
}

Compilation message

skyscrapers.cpp: In function 'void bfs(int, int)':
skyscrapers.cpp:60:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   60 |         if ( ans .size () != n ) cout << "NO" << endl ;
      |              ~~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 640 KB ans=NO N=1934
2 Correct 4 ms 768 KB ans=NO N=1965
3 Incorrect 9 ms 768 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 0 ms 256 KB ans=YES N=1
2 Correct 0 ms 256 KB ans=YES N=4
3 Correct 0 ms 256 KB ans=NO N=4
4 Correct 1 ms 308 KB ans=YES N=5
5 Correct 0 ms 256 KB ans=YES N=9
6 Correct 0 ms 256 KB ans=YES N=5
7 Correct 0 ms 256 KB ans=NO N=9
8 Correct 0 ms 256 KB ans=NO N=10
9 Correct 1 ms 256 KB ans=YES N=10
10 Correct 1 ms 256 KB ans=YES N=10
11 Correct 1 ms 256 KB ans=YES N=10
12 Correct 0 ms 256 KB ans=YES N=9
13 Correct 0 ms 256 KB ans=YES N=9
14 Correct 1 ms 256 KB ans=YES N=8
15 Correct 0 ms 256 KB ans=YES N=8
16 Correct 0 ms 256 KB ans=NO N=2
17 Correct 0 ms 256 KB ans=YES N=17
18 Correct 1 ms 256 KB ans=YES N=25
19 Correct 1 ms 384 KB ans=YES N=100
20 Correct 1 ms 384 KB ans=YES N=185
21 Correct 1 ms 384 KB ans=NO N=174
22 Correct 1 ms 384 KB ans=YES N=90
23 Correct 1 ms 384 KB ans=YES N=63
24 Correct 1 ms 384 KB ans=YES N=87
25 Correct 1 ms 384 KB ans=YES N=183
26 Correct 2 ms 384 KB ans=YES N=188
27 Correct 2 ms 384 KB ans=YES N=183
28 Correct 1 ms 384 KB ans=YES N=189
29 Correct 2 ms 384 KB ans=YES N=200
30 Correct 2 ms 384 KB ans=YES N=190
31 Correct 2 ms 384 KB ans=YES N=187
32 Correct 2 ms 384 KB ans=YES N=187
33 Correct 2 ms 384 KB ans=YES N=182
34 Correct 2 ms 384 KB ans=YES N=184
35 Correct 2 ms 384 KB ans=YES N=188
36 Correct 2 ms 384 KB ans=YES N=181
37 Correct 2 ms 384 KB ans=YES N=188
38 Correct 2 ms 384 KB ans=YES N=191
39 Correct 2 ms 384 KB ans=YES N=196
40 Correct 1 ms 384 KB ans=YES N=196
41 Correct 1 ms 384 KB ans=YES N=196
42 Correct 1 ms 384 KB ans=YES N=196
43 Correct 2 ms 384 KB ans=YES N=195
44 Correct 5 ms 768 KB ans=NO N=1934
45 Correct 4 ms 768 KB ans=NO N=1965
46 Correct 9 ms 896 KB ans=YES N=1824
47 Correct 11 ms 896 KB ans=YES N=1981
48 Correct 10 ms 896 KB ans=YES N=1814
49 Correct 11 ms 896 KB ans=YES N=1854
50 Correct 11 ms 896 KB ans=YES N=1831
51 Correct 13 ms 1024 KB ans=YES N=2000
52 Correct 13 ms 1024 KB ans=YES N=1847
53 Correct 15 ms 1152 KB ans=YES N=1819
54 Correct 14 ms 1024 KB ans=YES N=1986
55 Correct 14 ms 1348 KB ans=YES N=2000
56 Correct 14 ms 1408 KB ans=YES N=1834
57 Correct 14 ms 1408 KB ans=YES N=1860
58 Correct 14 ms 1536 KB ans=YES N=1898
59 Correct 13 ms 1280 KB ans=YES N=1832
60 Correct 17 ms 1536 KB ans=YES N=1929
61 Correct 12 ms 1024 KB ans=YES N=1919
62 Correct 16 ms 1280 KB ans=YES N=1882
63 Correct 14 ms 1792 KB ans=YES N=1922
64 Correct 11 ms 1016 KB ans=YES N=1989
65 Correct 12 ms 1280 KB ans=YES N=1978
66 Correct 11 ms 1280 KB ans=YES N=1867
67 Correct 13 ms 1280 KB ans=YES N=1942
68 Correct 275 ms 22596 KB ans=NO N=66151
69 Correct 152 ms 12920 KB ans=NO N=64333
70 Correct 410 ms 19356 KB ans=YES N=69316
71 Correct 383 ms 18672 KB ans=YES N=66695
72 Correct 463 ms 19184 KB ans=YES N=68436
73 Correct 426 ms 19828 KB ans=YES N=70000
74 Correct 429 ms 19464 KB ans=YES N=68501
75 Correct 441 ms 20208 KB ans=YES N=70000
76 Correct 424 ms 20596 KB ans=YES N=65009
77 Correct 478 ms 29520 KB ans=YES N=67007
78 Correct 475 ms 33392 KB ans=YES N=66357
79 Correct 481 ms 36468 KB ans=YES N=65430
80 Correct 480 ms 35312 KB ans=YES N=65790
81 Correct 483 ms 33140 KB ans=YES N=66020
82 Correct 501 ms 30960 KB ans=YES N=65809
83 Correct 433 ms 22928 KB ans=YES N=65651
84 Correct 535 ms 44144 KB ans=YES N=68040
85 Correct 499 ms 39536 KB ans=YES N=66570
86 Correct 391 ms 19580 KB ans=YES N=65421
87 Correct 415 ms 21484 KB ans=YES N=68351
88 Correct 394 ms 18544 KB ans=YES N=67027
89 Correct 482 ms 27748 KB ans=YES N=68879
90 Correct 422 ms 21744 KB ans=YES N=67256
91 Correct 967 ms 41976 KB ans=YES N=148315
92 Correct 351 ms 28536 KB ans=NO N=142745
93 Correct 493 ms 31224 KB ans=NO N=148443
94 Correct 1044 ms 42448 KB ans=YES N=148328
95 Correct 1052 ms 42732 KB ans=YES N=147855
96 Correct 1072 ms 43380 KB ans=YES N=150000
97 Correct 1045 ms 41716 KB ans=YES N=144725
98 Correct 1084 ms 42888 KB ans=YES N=149445
99 Correct 1030 ms 41960 KB ans=YES N=144455
100 Correct 1064 ms 41364 KB ans=YES N=143487
101 Correct 1079 ms 43244 KB ans=YES N=149688
102 Correct 1234 ms 65844 KB ans=YES N=141481
103 Correct 1300 ms 88704 KB ans=YES N=147430
104 Correct 1119 ms 55016 KB ans=YES N=142247
105 Correct 1240 ms 64148 KB ans=YES N=149941
106 Correct 1215 ms 84072 KB ans=YES N=141635
107 Correct 1231 ms 77420 KB ans=YES N=142896
108 Correct 1271 ms 84716 KB ans=YES N=142069
109 Correct 1002 ms 46184 KB ans=YES N=142378
110 Correct 1217 ms 71400 KB ans=YES N=150000
111 Correct 1277 ms 96236 KB ans=YES N=141452
112 Correct 1218 ms 91620 KB ans=YES N=134453
113 Correct 1231 ms 96240 KB ans=YES N=144172

Subtask #6
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 273 ms 22132 KB ans=NO N=66151
2 Correct 146 ms 12384 KB ans=NO N=64333
3 Incorrect 393 ms 18672 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 5 ms 640 KB ans=NO N=1934
2 Correct 4 ms 768 KB ans=NO N=1965
3 Incorrect 9 ms 768 KB Contestant's solution is not lexicographically largest at index 1824 (1813 vs 1702)
4 Halted 0 ms 0 KB -