oj.uz

Submission #212968

# Submission time Handle Problem Language Result Execution time Memory
212968 2020-03-24T17:14:03 Z qkxwsm Building 4 (JOI20_building4) C++14
100 / 100
 367 ms 25208 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

const int INF = 1000000007;
const int MAXN = 1000013;

int N;
pii arr[MAXN];
pair<pii, pii> dp[MAXN];
bitset<MAXN> ans;

int32_t main()
{
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N;
    FOR(i, 0, 2 * N)
    {
        cin >> arr[i].fi;
    }
    FOR(i, 0, 2 * N)
    {
        cin >> arr[i].se;
    }
    dp[0] = {{0, 0}, {0, 0}};
    FOR(i, 0, 2 * N)
    {
        dp[i + 1] = {{INF, -INF}, {INF, -INF}};
        if (i == 0 || arr[i - 1].fi <= arr[i].fi)
        {
            ckmin(dp[i + 1].fi.fi, dp[i].fi.fi);
            ckmax(dp[i + 1].fi.se, dp[i].fi.se);
        }
        if (i == 0 || arr[i - 1].se <= arr[i].fi)
        {
            ckmin(dp[i + 1].fi.fi, dp[i].se.fi);
            ckmax(dp[i + 1].fi.se, dp[i].se.se);
        }
        if (i == 0 || arr[i - 1].fi <= arr[i].se)
        {
            ckmin(dp[i + 1].se.fi, dp[i].fi.fi + 1);
            ckmax(dp[i + 1].se.se, dp[i].fi.se + 1);
        }
        if (i == 0 || arr[i - 1].se <= arr[i].se)
        {
            ckmin(dp[i + 1].se.fi, dp[i].se.fi + 1);
            ckmax(dp[i + 1].se.se, dp[i].se.se + 1);
        }
    }
    if ((dp[2 * N].fi.se < N || dp[2 * N].fi.fi > N) && (dp[2 * N].se.se < N || dp[2 * N].se.fi > N))
    {
        cout << "-1\n";
        return 0;
    }
    int rem = N;
    bool dir = (dp[2 * N].se.fi <= N && N <= dp[2 * N].se.se);
    FORD(i, 2 * N, 0)
    {
        if (dir)
        {
            ans[i] = true;
            rem--;
            if (dp[i].fi.fi <= rem && rem <= dp[i].fi.se && (i == 0 || arr[i - 1].fi <= arr[i].se))
            {
                dir = false;
            }
            else
            {
                dir = true;
            }
        }
        else
        {
            ans[i] = false;
            if (dp[i].fi.fi <= rem && rem <= dp[i].fi.se && (i == 0 || arr[i - 1].fi <= arr[i].fi))
            {
                dir = false;
            }
            else
            {
                dir = true;
            }
        }
    }
    FOR(i, 0, 2 * N)
    {
        cout << (ans[i] ? 'B' : 'A');
    }
    cout << '\n';
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 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 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 384 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 6 ms 384 KB Output is correct
12 Correct 6 ms 384 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 6 ms 384 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 384 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 6 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 6 ms 384 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 5 ms 512 KB Output is correct
28 Correct 5 ms 512 KB Output is correct
29 Correct 5 ms 512 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 6 ms 384 KB Output is correct
34 Correct 311 ms 23416 KB Output is correct
35 Correct 309 ms 23140 KB Output is correct
36 Correct 337 ms 22776 KB Output is correct
37 Correct 311 ms 23288 KB Output is correct
38 Correct 302 ms 23288 KB Output is correct
39 Correct 316 ms 23416 KB Output is correct
40 Correct 329 ms 24824 KB Output is correct
41 Correct 302 ms 23712 KB Output is correct
42 Correct 336 ms 24184 KB Output is correct
43 Correct 367 ms 24952 KB Output is correct
44 Correct 331 ms 24952 KB Output is correct
45 Correct 344 ms 24952 KB Output is correct
46 Correct 327 ms 24952 KB Output is correct
47 Correct 327 ms 25080 KB Output is correct
48 Correct 339 ms 24952 KB Output is correct
49 Correct 338 ms 24952 KB Output is correct
50 Correct 350 ms 24952 KB Output is correct
51 Correct 352 ms 24952 KB Output is correct
52 Correct 230 ms 25080 KB Output is correct
53 Correct 223 ms 24952 KB Output is correct
54 Correct 202 ms 24928 KB Output is correct
55 Correct 211 ms 25208 KB Output is correct
56 Correct 357 ms 24824 KB Output is correct
57 Correct 299 ms 24800 KB Output is correct
58 Correct 307 ms 24952 KB Output is correct
59 Correct 309 ms 24956 KB Output is correct
60 Correct 274 ms 23544 KB Output is correct
61 Correct 307 ms 24952 KB Output is correct
62 Correct 300 ms 24696 KB Output is correct
63 Correct 298 ms 24952 KB Output is correct
64 Correct 291 ms 24184 KB Output is correct
65 Correct 307 ms 25080 KB Output is correct