oj.uz

Submission #422070

# Submission time Handle Problem Language Result Execution time Memory
422070 2021-06-09T17:01:55 Z alextodoran Building 4 (JOI20_building4) C++17
100 / 100
 294 ms 45368 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 1000000;

const int A = 0;
const int B = 1;

int n;

int a[N_MAX + 2];
int b[N_MAX + 2];

int L[N_MAX + 2][2];
int R[N_MAX + 2][2];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    n *= 2;
    for(int i = 1; i <= n; i++)
        cin >> a[i];
    for(int i = 1; i <= n; i++)
        cin >> b[i];
    for(int i = 1; i <= n; i++)
    {
        L[i][A] = L[i][B] = INT_MAX / 2;
        R[i][A] = R[i][B] = INT_MIN / 2;
    }
    L[1][A] = 1;
    R[1][A] = 1;
    L[1][B] = 0;
    R[1][B] = 0;
    for(int i = 1; i < n; i++)
    {
        if(a[i] <= a[i + 1])
        {
            L[i + 1][A] = min(L[i + 1][A], L[i][A] + 1);
            R[i + 1][A] = max(R[i + 1][A], R[i][A] + 1);
        }
        if(a[i] <= b[i + 1])
        {
            L[i + 1][B] = min(L[i + 1][B], L[i][A]);
            R[i + 1][B] = max(R[i + 1][B], R[i][A]);
        }
        if(b[i] <= a[i + 1])
        {
            L[i + 1][A] = min(L[i + 1][A], L[i][B] + 1);
            R[i + 1][A] = max(R[i + 1][A], R[i][B] + 1);
        }
        if(b[i] <= b[i + 1])
        {
            L[i + 1][B] = min(L[i + 1][B], L[i][B]);
            R[i + 1][B] = max(R[i + 1][B], R[i][B]);
        }
    }
    bool okA = (L[n][A] <= n / 2 && n / 2 <= R[n][A]);
    bool okB = (L[n][B] <= n / 2 && n / 2 <= R[n][B]);
    if(okA == false && okB == false)
    {
        cout << "-1\n";
        return 0;
    }
    int pos = n;
    int cnt = n / 2;
    int last = (okA == true ? A : B);
    string sol;
    while(pos >= 2)
    {
        if(last == A)
            sol += 'A';
        else
            sol += 'B';
        if(last == A)
        {
            if(a[pos - 1] <= a[pos] && L[pos - 1][A] + 1 <= cnt && cnt <= R[pos - 1][A] + 1)
                last = A;
            else if(b[pos - 1] <= a[pos] && L[pos - 1][B] + 1 <= cnt && cnt <= R[pos - 1][B] + 1)
                last = B;
            cnt--;
        }
        else
        {
            if(a[pos - 1] <= b[pos] && L[pos - 1][A] <= cnt && cnt <= R[pos - 1][A])
                last = A;
            else if(b[pos - 1] <= b[pos] && L[pos - 1][B] <= cnt && cnt <= R[pos - 1][B])
                last = B;
        }
        pos--;
    }
    if(last == A)
        sol += 'A';
    else
        sol += 'B';
    reverse(sol.begin(), sol.end());
    cout << sol << "\n";
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 2 ms 460 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 460 KB Output is correct
23 Correct 1 ms 460 KB Output is correct
24 Correct 2 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 460 KB Output is correct
34 Correct 269 ms 37464 KB Output is correct
35 Correct 266 ms 42004 KB Output is correct
36 Correct 254 ms 41216 KB Output is correct
37 Correct 262 ms 42212 KB Output is correct
38 Correct 255 ms 42240 KB Output is correct
39 Correct 244 ms 41280 KB Output is correct
40 Correct 265 ms 44796 KB Output is correct
41 Correct 254 ms 42240 KB Output is correct
42 Correct 273 ms 43676 KB Output is correct
43 Correct 284 ms 45308 KB Output is correct
44 Correct 294 ms 45212 KB Output is correct
45 Correct 282 ms 45292 KB Output is correct
46 Correct 270 ms 45244 KB Output is correct
47 Correct 283 ms 44264 KB Output is correct
48 Correct 272 ms 44200 KB Output is correct
49 Correct 276 ms 44988 KB Output is correct
50 Correct 279 ms 44404 KB Output is correct
51 Correct 282 ms 44332 KB Output is correct
52 Correct 212 ms 33432 KB Output is correct
53 Correct 208 ms 33488 KB Output is correct
54 Correct 196 ms 33596 KB Output is correct
55 Correct 191 ms 33220 KB Output is correct
56 Correct 276 ms 45368 KB Output is correct
57 Correct 238 ms 40296 KB Output is correct
58 Correct 237 ms 40376 KB Output is correct
59 Correct 246 ms 40380 KB Output is correct
60 Correct 232 ms 38496 KB Output is correct
61 Correct 242 ms 40896 KB Output is correct
62 Correct 242 ms 40284 KB Output is correct
63 Correct 243 ms 40872 KB Output is correct
64 Correct 235 ms 39528 KB Output is correct
65 Correct 242 ms 40912 KB Output is correct