oj.uz

답안 #212961

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
212961 2020-03-24T15:57:54 Z jovan_b 건물 4 (JOI20_building4) C++17
100 / 100
 348 ms 69868 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;

const int INF = 1000000007;

int a[1000005];
int b[1000005];
pair <int, int> dp[1000005][2];

string res = "";

void uradi(int n, int koji, int kolko){
    if(n == 1){
        if(koji == 0) res += 'A';
        else res += 'B';
        return;
    }
    if(koji == 0){
        if(a[n] >= a[n-1] && dp[n-1][0].first <= kolko && dp[n-1][0].second >= kolko) uradi(n-1, 0, kolko-1);
        else uradi(n-1, 1, kolko);
        res += 'A';
    }
    else{
        if(b[n] >= a[n-1] && dp[n-1][0].first <= kolko && dp[n-1][0].second >= kolko) uradi(n-1, 0, kolko-1);
        else uradi(n-1, 1, kolko);
        res += 'B';
    }
}

int main(){
    ios_base::sync_with_stdio(false), cin.tie(0);
    cout.precision(10);
    cout << fixed;

	int n;
	cin >> n;
	for(int i=1; i<=2*n; i++){
        cin >> a[i];
	}
	for(int i=1; i<=2*n; i++){
        cin >> b[i];
	}
	for(int i=1; i<=2*n; i++){
        dp[i][0] = dp[i][1] = {INF, -INF};
        if(a[i] >= a[i-1]){
            dp[i][0].second = max(dp[i][0].second, dp[i-1][0].second+1);
            dp[i][0].first = min(dp[i][0].first, dp[i-1][0].first+1);
        }
        if(a[i] >= b[i-1]){
            dp[i][0].second = max(dp[i][0].second, dp[i-1][1].second+1);
            dp[i][0].first = min(dp[i][0].first, dp[i-1][1].first+1);
        }
        if(b[i] >= a[i-1]){
            dp[i][1].second = max(dp[i][1].second, dp[i-1][0].second);
            dp[i][1].first = min(dp[i][1].first, dp[i-1][0].first);
        }
        if(b[i] >= b[i-1]){
            dp[i][1].second = max(dp[i][1].second, dp[i-1][1].second);
            dp[i][1].first = min(dp[i][1].first, dp[i-1][1].first);
        }
	}
	if(dp[2*n][1].second >= n && dp[2*n][1].first <= n){
        uradi(2*n, 1, n);
        cout << res;
        return 0;
	}
	if(dp[2*n][0].second >= n && dp[2*n][0].first <= n){
        uradi(2*n, 0, n-1);
        cout << res;
        return 0;
	}
	cout << -1;
    return 0;
}
/*
1
1 2
1 2
*/

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 6 ms 640 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 640 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 640 KB Output is correct
7 Correct 6 ms 640 KB Output is correct
8 Correct 6 ms 640 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 6 ms 640 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 640 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 640 KB Output is correct
21 Correct 6 ms 640 KB Output is correct
22 Correct 6 ms 640 KB Output is correct
23 Correct 5 ms 640 KB Output is correct
24 Correct 6 ms 640 KB Output is correct
25 Correct 6 ms 640 KB Output is correct
26 Correct 5 ms 640 KB Output is correct
27 Correct 5 ms 640 KB Output is correct
28 Correct 5 ms 640 KB Output is correct
29 Correct 5 ms 640 KB Output is correct
30 Correct 6 ms 640 KB Output is correct
31 Correct 5 ms 640 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 640 KB Output is correct
34 Correct 302 ms 25184 KB Output is correct
35 Correct 312 ms 57904 KB Output is correct
36 Correct 320 ms 60120 KB Output is correct
37 Correct 322 ms 55856 KB Output is correct
38 Correct 314 ms 56036 KB Output is correct
39 Correct 291 ms 62768 KB Output is correct
40 Correct 316 ms 58604 KB Output is correct
41 Correct 299 ms 62384 KB Output is correct
42 Correct 314 ms 57224 KB Output is correct
43 Correct 340 ms 58860 KB Output is correct
44 Correct 340 ms 58860 KB Output is correct
45 Correct 340 ms 58988 KB Output is correct
46 Correct 312 ms 58860 KB Output is correct
47 Correct 325 ms 58860 KB Output is correct
48 Correct 325 ms 58860 KB Output is correct
49 Correct 321 ms 58988 KB Output is correct
50 Correct 340 ms 59032 KB Output is correct
51 Correct 348 ms 58860 KB Output is correct
52 Correct 229 ms 63724 KB Output is correct
53 Correct 215 ms 63720 KB Output is correct
54 Correct 190 ms 63596 KB Output is correct
55 Correct 215 ms 63724 KB Output is correct
56 Correct 320 ms 58860 KB Output is correct
57 Correct 310 ms 67564 KB Output is correct
58 Correct 293 ms 67948 KB Output is correct
59 Correct 297 ms 67816 KB Output is correct
60 Correct 268 ms 63536 KB Output is correct
61 Correct 306 ms 68844 KB Output is correct
62 Correct 291 ms 68080 KB Output is correct
63 Correct 287 ms 69228 KB Output is correct
64 Correct 279 ms 66608 KB Output is correct
65 Correct 301 ms 69868 KB Output is correct