oj.uz

Submission #211638

# Submission time Handle Problem Language Result Execution time Memory
211638 2020-03-20T21:18:35 Z M0REDA Building 4 (JOI20_building4) C++14
100 / 100
 470 ms 143500 KB 
#include <bits/stdc++.h>
#define debug(x) cerr << #x << " = " << x << ", ";
#define ll long long
#define pb push_back
using namespace std;
#define FAST_IO                       \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
int main()
{
    FAST_IO
    ll n, len;
    cin >> n;
    len = 2 * n;
    vector<vector<ll>> v(len, vector<ll>(2));
    for (int i = 0; i < len; i++)
    {
        cin >> v[i][1];
    }
    for (int i = 0; i < len; i++)
    {
        cin >> v[i][0];
    }
    vector<vector<pair<pair<ll, ll>, ll>>> dp(len, vector<pair<pair<ll, ll>, ll>>(2));
    for (int i = 0; i < len; i++)
    {
        dp[i][0] = {{-1, -1}, -1};
        dp[i][1] = {{-1, -1}, -1};
    }
    dp[0][0] = {{0, 0}, -1};
    dp[0][1] = {{1, 1}, -1};
    for (int i = 0; i < len - 1; i++)
    {
        for (int prev = 0; prev < 2; prev++)
        {
            if (dp[i][prev].first != make_pair((ll)-1, (ll)-1))
            {
                for (int nxt = 0; nxt < 2; nxt++)
                {
                    pair<ll, ll> pp;
                    if (v[i][prev] > v[i + 1][nxt])
                    {
                        continue;
                    }
                    pp = {dp[i][prev].first.first + nxt, dp[i][prev].first.second + nxt};
                    if (dp[i + 1][nxt].first == make_pair((ll)-1, (ll)-1))
                    {
                        dp[i + 1][nxt].first = pp;
                        dp[i + 1][nxt].second = prev;
                    }
                    else
                    {
                        dp[i + 1][nxt].first = {min(dp[i + 1][nxt].first.first, pp.first), max(dp[i + 1][nxt].first.second, pp.second)};

                        if (dp[i + 1][nxt].second == 0)
                        {
                            if (prev == 1)
                            {
                                dp[i + 1][nxt].second = 2;
                            }
                        }
                        else if (dp[i + 1][nxt].second == 1)
                        {
                            if (prev == 0)
                                dp[i + 1][nxt].second = 2;
                        }
                    }
                }
            }
        }
    }
    ll cnt = n;
    string ans = "";
    // debug(dp[len - 1][0].first.first);
    // debug(dp[len - 1][0].first.second);
    // debug(dp[len - 1][1].first.first);
    // debug(dp[len - 1][1].first.second);
    // cout << endl;
    if (!((dp[len - 1][0].first.first <= n && dp[len - 1][0].first.second >= n) || (dp[len - 1][1].first.first <= n && dp[len - 1][1].first.second >= n)))
    {
        cout << -1 << endl;
        return 0;
    }
    bool from2 = false;
    for (int i = len - 1; i >= 0; i--)
    {
        for (int nxt = 0; nxt < 2; nxt++)
        {
            pair<ll, ll> curr = dp[i][nxt].first;
            int prevv = dp[i][nxt].second;
            // debug(i);
            // debug(prevv);
            // debug(curr.first);
            // debug(curr.second);
            // debug(cnt);
            // debug(nxt);
            // cout << endl;
            // cout << "==========" << endl;
            if (from2 && !(cnt >= curr.first && cnt <= curr.second))
            {
                from2 = false;
                nxt = -1;
                continue;
            }
            if (cnt >= curr.first && cnt <= curr.second)
            {
                ans += (nxt == 0 ? "B" : "A");
                cnt -= (nxt == 0 ? 0 : 1);
                if (prevv == 2)
                {
                    if (cnt)
                    {
                        from2 = true;
                        i--;
                        nxt = 0;
                        continue;
                    }
                    else
                    {
                        i--;
                        nxt = -1;
                        continue;
                    }
                }
                if (prevv == 1)
                {
                    i--;
                    nxt = 0;
                    continue;
                }
                if (prevv == 0)
                {
                    i--;
                    nxt = -1;
                    continue;
                }
                break;
            }
        }
    }
    // cout << cnt << endl;
    reverse(ans.begin(), ans.end());
    // cout << ans.size() << endl;
    cout << ans << endl;

    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 6 ms 896 KB Output is correct
6 Correct 8 ms 896 KB Output is correct
7 Correct 6 ms 768 KB Output is correct
8 Correct 6 ms 768 KB Output is correct
9 Correct 6 ms 896 KB Output is correct
10 Correct 6 ms 768 KB Output is correct
11 Correct 7 ms 896 KB Output is correct
12 Correct 8 ms 896 KB Output is correct
13 Correct 6 ms 896 KB Output is correct
14 Correct 6 ms 896 KB Output is correct
15 Correct 6 ms 896 KB Output is correct
16 Correct 6 ms 896 KB Output is correct
17 Correct 6 ms 896 KB Output is correct
18 Correct 6 ms 896 KB Output is correct
19 Correct 6 ms 896 KB Output is correct
20 Correct 6 ms 896 KB Output is correct
21 Correct 7 ms 896 KB Output is correct
22 Correct 6 ms 896 KB Output is correct
23 Correct 6 ms 896 KB Output is correct
24 Correct 6 ms 896 KB Output is correct
25 Correct 6 ms 896 KB Output is correct
26 Correct 6 ms 896 KB Output is correct
27 Correct 6 ms 896 KB Output is correct
28 Correct 6 ms 896 KB Output is correct
29 Correct 6 ms 896 KB Output is correct
30 Correct 6 ms 896 KB Output is correct
31 Correct 6 ms 896 KB Output is correct
32 Correct 5 ms 896 KB Output is correct
33 Correct 6 ms 896 KB Output is correct
34 Correct 397 ms 139000 KB Output is correct
35 Correct 418 ms 132912 KB Output is correct
36 Correct 413 ms 130736 KB Output is correct
37 Correct 426 ms 133680 KB Output is correct
38 Correct 429 ms 133552 KB Output is correct
39 Correct 414 ms 134064 KB Output is correct
40 Correct 456 ms 142624 KB Output is correct
41 Correct 426 ms 136400 KB Output is correct
42 Correct 449 ms 138904 KB Output is correct
43 Correct 470 ms 143340 KB Output is correct
44 Correct 453 ms 143500 KB Output is correct
45 Correct 457 ms 143468 KB Output is correct
46 Correct 434 ms 143380 KB Output is correct
47 Correct 427 ms 143468 KB Output is correct
48 Correct 432 ms 143468 KB Output is correct
49 Correct 431 ms 143368 KB Output is correct
50 Correct 429 ms 143340 KB Output is correct
51 Correct 435 ms 143468 KB Output is correct
52 Correct 311 ms 143372 KB Output is correct
53 Correct 308 ms 143340 KB Output is correct
54 Correct 308 ms 143340 KB Output is correct
55 Correct 324 ms 143372 KB Output is correct
56 Correct 429 ms 143364 KB Output is correct
57 Correct 395 ms 142956 KB Output is correct
58 Correct 395 ms 143340 KB Output is correct
59 Correct 391 ms 143340 KB Output is correct
60 Correct 370 ms 134704 KB Output is correct
61 Correct 403 ms 143340 KB Output is correct
62 Correct 392 ms 141292 KB Output is correct
63 Correct 397 ms 143468 KB Output is correct
64 Correct 385 ms 138544 KB Output is correct
65 Correct 407 ms 143468 KB Output is correct