oj.uz

Submission #251184

# Submission time Handle Problem Language Result Execution time Memory
251184 2020-07-20T13:48:23 Z imeimi2000 Building 4 (JOI20_building4) C++17
100 / 100
 332 ms 45548 KB 
#include <bits/stdc++.h>

using namespace std;
typedef pair<int, int> pii;

const pii inf = pii(1e8, -1e8);

pii operator+(pii a, pii b) {
    return pii(min(a.first, b.first), max(a.second, b.second));
}

pii operator+(pii a, int b) {
    return pii(a.first + b, a.second + b);
}

bool operator>(pii a, int b) {
    return a.first <= b && b <= a.second;
}

int n;
int A[1000001][2];
pii dp[1000001][2];

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> n; n <<= 1;
    for (int j = 0; j < 2; ++j) for (int i = 1; i <= n; ++i)
        cin >> A[i][j];
    dp[1][0] = pii(-1, -1);
    dp[1][1] = pii(1, 1);
    for (int i = 2; i <= n; ++i) {
        for (int j = 0; j < 2; ++j) {
            dp[i][j] = inf;
            for (int k = 0; k < 2; ++k) {
                if (A[i - 1][k] <= A[i][j])
                    dp[i][j] = dp[i][j] + (dp[i - 1][k] + (j + j - 1));
            }
        }
    }
    int j;
    for (j = 0; j < 2; ++j) if (dp[n][j] > 0) break;
    if (j == 2) return printf("-1\n"), 0;
    string ans;
    for (int i = n, sum = 0; ; --i) {
        ans.push_back('A' + j);
        if (i == 1) break;
        sum -= j + j - 1;
        for (int k = 0; k < 2; ++k) {
            if (A[i - 1][k] <= A[i][j] && dp[i - 1][k] > sum) {
                j = k;
                break;
            }
        }
    }
    reverse(ans.begin(), ans.end());
    printf("%s\n", ans.c_str());
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 2 ms 532 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 2 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 KB Output is correct
32 Correct 1 ms 512 KB Output is correct
33 Correct 1 ms 512 KB Output is correct
34 Correct 320 ms 42424 KB Output is correct
35 Correct 295 ms 41940 KB Output is correct
36 Correct 276 ms 41392 KB Output is correct
37 Correct 296 ms 42160 KB Output is correct
38 Correct 280 ms 42160 KB Output is correct
39 Correct 275 ms 41392 KB Output is correct
40 Correct 305 ms 44780 KB Output is correct
41 Correct 275 ms 42416 KB Output is correct
42 Correct 290 ms 43696 KB Output is correct
43 Correct 306 ms 45292 KB Output is correct
44 Correct 332 ms 45424 KB Output is correct
45 Correct 326 ms 45204 KB Output is correct
46 Correct 295 ms 45296 KB Output is correct
47 Correct 293 ms 44400 KB Output is correct
48 Correct 319 ms 44140 KB Output is correct
49 Correct 290 ms 45080 KB Output is correct
50 Correct 322 ms 44652 KB Output is correct
51 Correct 325 ms 44524 KB Output is correct
52 Correct 191 ms 33644 KB Output is correct
53 Correct 184 ms 33648 KB Output is correct
54 Correct 169 ms 33644 KB Output is correct
55 Correct 171 ms 33260 KB Output is correct
56 Correct 298 ms 45548 KB Output is correct
57 Correct 270 ms 40300 KB Output is correct
58 Correct 263 ms 40428 KB Output is correct
59 Correct 263 ms 40556 KB Output is correct
60 Correct 260 ms 38576 KB Output is correct
61 Correct 283 ms 40940 KB Output is correct
62 Correct 291 ms 40368 KB Output is correct
63 Correct 307 ms 40940 KB Output is correct
64 Correct 259 ms 39600 KB Output is correct
65 Correct 296 ms 41072 KB Output is correct