oj.uz

Submission #213152

# Submission time Handle Problem Language Result Execution time Memory
213152 2020-03-25T04:46:03 Z ho94949 Building 4 (JOI20_building4) C++17
100 / 100
 1277 ms 26020 KB 
#include<bits/stdc++.h>
using namespace std;

int main()
{
    int N; cin >> N;
    vector<int> A(2*N), B(2*N);
    for(int i=0; i<2*N; ++i) cin >> A[i];
    for(int i=0; i<2*N; ++i) cin >> B[i];

    const int INF = 0x3f3f3f3f;

    vector<pair<int, int> > dpA(2*N), dpB(2*N); //# of A
    dpA[0] = make_pair(1, 1);
    dpB[0] = make_pair(0, 0);
    for(int i=0; i<2*N-1; ++i)
    {
        int mina = INF, maxa = -INF, minb = INF, maxb = -INF;
        auto [al, ar] = dpA[i]; auto[bl, br] = dpB[i];

        if(al != -1)
        {
            if(A[i] <= A[i+1])
                mina = min(mina, al+1), maxa = max(maxa, ar+1);
            if(A[i] <= B[i+1])
                minb = min(minb, al), maxb = max(maxb, ar);
        }
        if(bl != -1)
        {
            if(B[i] <= A[i+1])
                mina = min(mina, bl+1), maxa = max(maxa, br+1);
            if(B[i] <= B[i+1])
                minb = min(minb, bl), maxb = max(maxb, br);
        }
        if(mina > maxa) mina = maxa = -1;
        if(minb > maxb) minb = maxb = -1;
        dpA[i+1] = make_pair(mina, maxa);
        dpB[i+1] = make_pair(minb, maxb);
    }

    bool a; int b = 2*N-1, c = N;
    if(dpA[2*N-1].first <= N && N <= dpA[2*N-1].second)
        a = true;
    else if(dpB[2*N-1].first <= N && N <= dpB[2*N-1].second)
        a = false;
    else
    {
        puts("-1"); return 0;
    }

    string s;
    if(a) s = "A", c=N-1; else s = "B";

    while(b)
    {
        if(a)
        {
            if(A[b] >= A[b-1] && dpA[b-1].first != -1 && dpA[b-1].first <= c && c <= dpA[b-1].second)
            {
                s += "A";
                a = true; b = b-1; c = c-1;
            }
            else
            {
                s += "B";
                a = false; b = b-1; c = c;                
            }
        }
        else
        {
            if(B[b] >= A[b-1] && dpA[b-1].first != -1 && dpA[b-1].first <= c && c <= dpA[b-1].second)
            {
                s += "A";
                a = true; b = b-1; c = c-1;
            }
            else
            {
                s += "B";
                a = false; b = b-1; c=c;
            }
        }
    }
    reverse(s.begin(), s.end());
    puts(s.c_str());
}

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 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 10 ms 384 KB Output is correct
14 Correct 10 ms 512 KB Output is correct
15 Correct 9 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Correct 10 ms 384 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 256 KB Output is correct
26 Correct 8 ms 384 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 8 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 8 ms 384 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 9 ms 512 KB Output is correct
6 Correct 9 ms 512 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Correct 9 ms 384 KB Output is correct
10 Correct 9 ms 384 KB Output is correct
11 Correct 9 ms 384 KB Output is correct
12 Correct 10 ms 512 KB Output is correct
13 Correct 10 ms 384 KB Output is correct
14 Correct 10 ms 512 KB Output is correct
15 Correct 9 ms 384 KB Output is correct
16 Correct 9 ms 384 KB Output is correct
17 Correct 10 ms 640 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Correct 10 ms 384 KB Output is correct
20 Correct 8 ms 512 KB Output is correct
21 Correct 7 ms 384 KB Output is correct
22 Correct 7 ms 512 KB Output is correct
23 Correct 7 ms 512 KB Output is correct
24 Correct 10 ms 512 KB Output is correct
25 Correct 8 ms 256 KB Output is correct
26 Correct 8 ms 384 KB Output is correct
27 Correct 8 ms 512 KB Output is correct
28 Correct 7 ms 384 KB Output is correct
29 Correct 8 ms 512 KB Output is correct
30 Correct 8 ms 384 KB Output is correct
31 Correct 8 ms 384 KB Output is correct
32 Correct 7 ms 384 KB Output is correct
33 Correct 8 ms 384 KB Output is correct
34 Correct 1213 ms 23428 KB Output is correct
35 Correct 1155 ms 24112 KB Output is correct
36 Correct 1135 ms 23728 KB Output is correct
37 Correct 1172 ms 24244 KB Output is correct
38 Correct 1137 ms 24240 KB Output is correct
39 Correct 1119 ms 24368 KB Output is correct
40 Correct 1246 ms 25836 KB Output is correct
41 Correct 1145 ms 24752 KB Output is correct
42 Correct 1208 ms 25136 KB Output is correct
43 Correct 1241 ms 25964 KB Output is correct
44 Correct 1240 ms 25964 KB Output is correct
45 Correct 1277 ms 25964 KB Output is correct
46 Correct 1244 ms 25964 KB Output is correct
47 Correct 1203 ms 25964 KB Output is correct
48 Correct 1193 ms 25964 KB Output is correct
49 Correct 1229 ms 25964 KB Output is correct
50 Correct 1230 ms 25964 KB Output is correct
51 Correct 1210 ms 25964 KB Output is correct
52 Correct 662 ms 25964 KB Output is correct
53 Correct 679 ms 25968 KB Output is correct
54 Correct 651 ms 25964 KB Output is correct
55 Correct 644 ms 25964 KB Output is correct
56 Correct 1251 ms 25964 KB Output is correct
57 Correct 1000 ms 25840 KB Output is correct
58 Correct 1000 ms 26020 KB Output is correct
59 Correct 993 ms 25964 KB Output is correct
60 Correct 958 ms 24368 KB Output is correct
61 Correct 1034 ms 25964 KB Output is correct
62 Correct 1016 ms 25580 KB Output is correct
63 Correct 1035 ms 25964 KB Output is correct
64 Correct 1002 ms 25136 KB Output is correct
65 Correct 1040 ms 26020 KB Output is correct