답안 #379506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
379506 2021-03-18T11:11:54 Z Pietra 건물 4 (JOI20_building4) C++14
100 / 100
440 ms 104680 KB
#include<bits/stdc++.h>
#define pb push_back 

using namespace std ;

const int maxn = 2e6 + 12 ; 

int n, v[2][maxn], dpmax[maxn][2], dpmin[maxn][2] ;

int mind(int n, int flag){

	if(n == 0) return 0 ; 
	if(dpmin[n][flag] != -1) return dpmin[n][flag] ;

	int ans = 4*maxn ; 

	for(int i = 0 ; i < 2 ; i++){
		if(v[i][n] <= v[flag][n+1]) ans = min(ans, mind(n-1, i) + i) ; 
	}

	return dpmin[n][flag] = ans ; 

}

int maxd(int n, int flag){

	if(n == 0) return 0 ; 
	if(dpmax[n][flag] != -1) return dpmax[n][flag] ;

	int ans = -4*maxn ; 

	for(int i = 0 ; i < 2 ; i++){
		if(v[i][n] <= v[flag][n+1]) ans = max(ans, maxd(n-1, i) + i) ; 
	}

	return dpmax[n][flag] = ans ; 

}

int main(){

	ios_base::sync_with_stdio(false) ; cin.tie(NULL) ; 

	cin >> n ; 

	n*=2 ; 
	string s ;

	for(int i = 1 ; i <= n ; i++) cin >> v[0][i] ;
	for(int i = 1 ; i <= n ; i++) cin >> v[1][i] ;

	v[1][n+1] = v[0][n+1] = (int) 2e9 ; 
	int qa = n/2, qb = n/2, ant = 0 ;
    memset(dpmin, -1, sizeof dpmin), memset(dpmax, -1, sizeof dpmax) ; 

    for(int i = n ; i > 0 ; i--){

    	if(mind(i, ant) <= qb && maxd(i, ant) >= qb){

    		int mina = mind(i - 1, 0), maxa = maxd(i-1, 0) ;
    		int minb = mind(i-1, 1), maxb = maxd(i-1, 1) ; 

    		if(qa && mina <= qb && maxa >= qb && v[0][i] <= v[ant][i+1]) qa--, s.pb('A'), ant = 0 ;
    		else if(qb) qb--, ant = 1, s.pb('B') ; 

    	}

    	else{
    		cout << -1 << "\n" ;
    		return 0 ; 
    	}

    }

    reverse(s.begin(), s.end()) ;

    if(qa != 0 || qb != 0) cout << -1 << "\n" ;
    else cout << s << "\n" ;

} 

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:61:11: warning: unused variable 'minb' [-Wunused-variable]
   61 |       int minb = mind(i-1, 1), maxb = maxd(i-1, 1) ;
      |           ^~~~
building4.cpp:61:32: warning: unused variable 'maxb' [-Wunused-variable]
   61 |       int minb = mind(i-1, 1), maxb = maxd(i-1, 1) ;
      |                                ^~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31596 KB Output is correct
2 Correct 18 ms 31596 KB Output is correct
3 Correct 18 ms 31596 KB Output is correct
4 Correct 18 ms 31596 KB Output is correct
5 Correct 20 ms 31724 KB Output is correct
6 Correct 22 ms 31852 KB Output is correct
7 Correct 23 ms 31852 KB Output is correct
8 Correct 20 ms 31948 KB Output is correct
9 Correct 19 ms 31880 KB Output is correct
10 Correct 19 ms 31852 KB Output is correct
11 Correct 20 ms 31980 KB Output is correct
12 Correct 23 ms 31980 KB Output is correct
13 Correct 22 ms 31980 KB Output is correct
14 Correct 21 ms 31980 KB Output is correct
15 Correct 19 ms 31980 KB Output is correct
16 Correct 23 ms 31980 KB Output is correct
17 Correct 19 ms 32128 KB Output is correct
18 Correct 20 ms 31980 KB Output is correct
19 Correct 22 ms 31980 KB Output is correct
20 Correct 23 ms 31980 KB Output is correct
21 Correct 22 ms 31980 KB Output is correct
22 Correct 22 ms 31980 KB Output is correct
23 Correct 19 ms 31980 KB Output is correct
24 Correct 19 ms 31980 KB Output is correct
25 Correct 19 ms 31980 KB Output is correct
26 Correct 19 ms 31980 KB Output is correct
27 Correct 22 ms 31980 KB Output is correct
28 Correct 19 ms 31852 KB Output is correct
29 Correct 19 ms 31980 KB Output is correct
30 Correct 20 ms 32128 KB Output is correct
31 Correct 22 ms 32128 KB Output is correct
32 Correct 19 ms 31852 KB Output is correct
33 Correct 23 ms 31980 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 31596 KB Output is correct
2 Correct 18 ms 31596 KB Output is correct
3 Correct 18 ms 31596 KB Output is correct
4 Correct 18 ms 31596 KB Output is correct
5 Correct 20 ms 31724 KB Output is correct
6 Correct 22 ms 31852 KB Output is correct
7 Correct 23 ms 31852 KB Output is correct
8 Correct 20 ms 31948 KB Output is correct
9 Correct 19 ms 31880 KB Output is correct
10 Correct 19 ms 31852 KB Output is correct
11 Correct 20 ms 31980 KB Output is correct
12 Correct 23 ms 31980 KB Output is correct
13 Correct 22 ms 31980 KB Output is correct
14 Correct 21 ms 31980 KB Output is correct
15 Correct 19 ms 31980 KB Output is correct
16 Correct 23 ms 31980 KB Output is correct
17 Correct 19 ms 32128 KB Output is correct
18 Correct 20 ms 31980 KB Output is correct
19 Correct 22 ms 31980 KB Output is correct
20 Correct 23 ms 31980 KB Output is correct
21 Correct 22 ms 31980 KB Output is correct
22 Correct 22 ms 31980 KB Output is correct
23 Correct 19 ms 31980 KB Output is correct
24 Correct 19 ms 31980 KB Output is correct
25 Correct 19 ms 31980 KB Output is correct
26 Correct 19 ms 31980 KB Output is correct
27 Correct 22 ms 31980 KB Output is correct
28 Correct 19 ms 31852 KB Output is correct
29 Correct 19 ms 31980 KB Output is correct
30 Correct 20 ms 32128 KB Output is correct
31 Correct 22 ms 32128 KB Output is correct
32 Correct 19 ms 31852 KB Output is correct
33 Correct 23 ms 31980 KB Output is correct
34 Correct 255 ms 39532 KB Output is correct
35 Correct 352 ms 98980 KB Output is correct
36 Correct 366 ms 97916 KB Output is correct
37 Correct 423 ms 99240 KB Output is correct
38 Correct 351 ms 99264 KB Output is correct
39 Correct 358 ms 99532 KB Output is correct
40 Correct 393 ms 103904 KB Output is correct
41 Correct 347 ms 100676 KB Output is correct
42 Correct 426 ms 102180 KB Output is correct
43 Correct 387 ms 104544 KB Output is correct
44 Correct 403 ms 104288 KB Output is correct
45 Correct 380 ms 104264 KB Output is correct
46 Correct 375 ms 104288 KB Output is correct
47 Correct 357 ms 104280 KB Output is correct
48 Correct 410 ms 104288 KB Output is correct
49 Correct 358 ms 104416 KB Output is correct
50 Correct 440 ms 104288 KB Output is correct
51 Correct 431 ms 104304 KB Output is correct
52 Correct 304 ms 104328 KB Output is correct
53 Correct 315 ms 104288 KB Output is correct
54 Correct 278 ms 104288 KB Output is correct
55 Correct 323 ms 104200 KB Output is correct
56 Correct 356 ms 104416 KB Output is correct
57 Correct 335 ms 103904 KB Output is correct
58 Correct 350 ms 104288 KB Output is correct
59 Correct 434 ms 104288 KB Output is correct
60 Correct 351 ms 100220 KB Output is correct
61 Correct 340 ms 104408 KB Output is correct
62 Correct 353 ms 103376 KB Output is correct
63 Correct 336 ms 104680 KB Output is correct
64 Correct 326 ms 102048 KB Output is correct
65 Correct 332 ms 104564 KB Output is correct