oj.uz

Submission #224741

# Submission time Handle Problem Language Result Execution time Memory
224741 2020-04-18T17:22:01 Z Minnakhmetov Building 4 (JOI20_building4) C++14
100 / 100
 356 ms 44268 KB 
#include <bits/stdc++.h>
using namespace std;
  
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()

const int N = 1e6 + 5;
pair<int, int> dp[N][2];
int a[N][2];
int n;

pair<int, int> mrg(pair<int, int> a, pair<int, int> b) {
	if (a.first > a.second)
		return b;
	if (b.first > b.second)
		return a;
	return {min(a.first, b.first), max(a.second, b.second)};
}
  
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;

    for (int j = 0; j < 2; j++) {
    	for (int i = 0; i < n + n; i++) {
	    	cin >> a[i][j];
	    }
    }

    for (int i = 0; i <= n + n; i++) {
    	for (int j = 0; j < 2; j++) {
    		dp[i][j] = {1, 0};
    	}
    }

	dp[1][0] = {0, 0};
    dp[1][1] = {1, 1};

    for (int i = 1; i < n + n; i++) {
    	for (int j = 0; j < 2; j++) {
    		for (int k = 0; k < 2; k++) {
    			if (a[i - 1][j] <= a[i][k]) {
    				dp[i + 1][k] = mrg(dp[i + 1][k], dp[i][j]);
    			}
    		}
    	}
        dp[i + 1][1].first++;
        dp[i + 1][1].second++;
    }

    int x = n + n, y = -1, z = n;

    for (int i = 0; i < 2; i++) {
        if (dp[n + n][i].first <= n && n <= dp[n + n][i].second) {
            y = i;
            break;
        }
    }

    if (y == -1) {
        cout << "-1";
    }
    else {
        string ans;
        while (true) {
            ans.push_back({y ? 'B' : 'A'});
            if (x == 1)
                break;
            z -= y;
            x--;
            for (int i = 0; i < 2; i++) {
                if (a[x - 1][i] <= a[x][y] &&
                    dp[x][i].first <= z && z <= dp[x][i].second) {
                    y = i;
                    break;
                }
            }
        }
        reverse(all(ans));
        cout << ans << "\n";
    }

    return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 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 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 7 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 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 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 7 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 6 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 512 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 6 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 6 ms 512 KB Output is correct
24 Correct 7 ms 512 KB Output is correct
25 Correct 6 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 6 ms 512 KB Output is correct
32 Correct 6 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 335 ms 30404 KB Output is correct
35 Correct 300 ms 42032 KB Output is correct
36 Correct 317 ms 41468 KB Output is correct
37 Correct 331 ms 42244 KB Output is correct
38 Correct 287 ms 42160 KB Output is correct
39 Correct 283 ms 41392 KB Output is correct
40 Correct 311 ms 34284 KB Output is correct
41 Correct 298 ms 42416 KB Output is correct
42 Correct 328 ms 38068 KB Output is correct
43 Correct 336 ms 28780 KB Output is correct
44 Correct 356 ms 28712 KB Output is correct
45 Correct 333 ms 28780 KB Output is correct
46 Correct 309 ms 28668 KB Output is correct
47 Correct 331 ms 41028 KB Output is correct
48 Correct 315 ms 44268 KB Output is correct
49 Correct 323 ms 32644 KB Output is correct
50 Correct 327 ms 39788 KB Output is correct
51 Correct 328 ms 39788 KB Output is correct
52 Correct 195 ms 33776 KB Output is correct
53 Correct 203 ms 33516 KB Output is correct
54 Correct 195 ms 33636 KB Output is correct
55 Correct 183 ms 33260 KB Output is correct
56 Correct 316 ms 28716 KB Output is correct
57 Correct 279 ms 40300 KB Output is correct
58 Correct 286 ms 40556 KB Output is correct
59 Correct 278 ms 40556 KB Output is correct
60 Correct 263 ms 38496 KB Output is correct
61 Correct 285 ms 41032 KB Output is correct
62 Correct 283 ms 40428 KB Output is correct
63 Correct 283 ms 40944 KB Output is correct
64 Correct 264 ms 39728 KB Output is correct
65 Correct 278 ms 41080 KB Output is correct