oj.uz

Submission #592352

# Submission time Handle Problem Language Result Execution time Memory
592352 2022-07-09T04:32:56 Z Hanksburger Building 4 (JOI20_building4) C++17
100 / 100
 261 ms 28652 KB 
#include <bits/stdc++.h>
using namespace std;
int a[1000005], b[1000005];
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, l=0, r=0, k=0, cnt=0;
    cin >> n;
    for (int i=1; i<=n*2; i++)
        cin >> a[i];
    for (int i=1; i<=n*2; i++)
        cin >> b[i];
    for (int i=2; i<=n*2; i++)
    {
        int mn=min(a[i-1]==-1?2e9:a[i-1], b[i-1]==-1?2e9:b[i-1]);
        if (a[i]<mn)
            a[i]=-1;
        if (b[i]<mn)
            b[i]=-1;
    }
    for (int i=n*2-1; i>=1; i--)
    {
        int mx=max(a[i+1], b[i+1]);
        if (a[i]>mx)
            a[i]=-1;
        if (b[i]>mx)
            b[i]=-1;
    }
    for (int i=1; i<=n*2; i++)
    {
        if (a[i]==-1 && b[i]==-1)
        {
            cout << -1;
            return 0;
        }
        else if (b[i]==-1)
        {
            l++;
            r++;
            k++;
        }
        else if (a[i]!=-1)
        {
            int x=0, y=0, mn=0, mx=0;
            while (i<n*2 && a[i+1]!=-1 && b[i+1]!=-1 && max(a[i], b[i])>min(a[i+1], b[i+1]))
            {
                if (a[i]>b[i])
                {
                    x++;
                    y--;
                }
                else
                    y++;
                mn=min(mn, y);
                mx=max(mx, y);
                i++;
            }
            if (a[i]>b[i])
            {
                x++;
                y--;
            }
            else
                y++;
            l+=x+min(mn, y);
            r+=x+max(mx, y);
            k+=x;
        }
    }
    if (n<l || r<n)
    {
        cout << -1;
        return 0;
    } /*
    for (int i=1; i<=n*2; i++)
        cout << a[i] << ' ';
    cout << '\n';
    for (int i=1; i<=n*2; i++)
        cout << b[i] << ' ';
    cout << '\n';
    cout << "l r " << l << ' ' << r << '\n'; */
    for (int i=1; i<=n*2; i++)
    {
        if (a[i]==-1)
            cout << 'B';
        else if (b[i]==-1)
            cout << 'A';
        else
        {
            int ind=i, y=0, mn=0, mx=0, tar;
            while (ind<n*2 && a[ind+1]!=-1 && b[ind+1]!=-1 && max(a[ind], b[ind])>min(a[ind+1], b[ind+1]))
            {
                if (a[ind]>b[ind])
                    y--;
                else
                    y++;
                mn=min(mn, y);
                mx=max(mx, y);
                ind++;
            }
            if (a[ind]>b[ind])
                y--;
            else
                y++;
            mn=min(mn, y);
            mx=max(mx, y);
            if (k+cnt<=n)
                tar=min(n-k-cnt, mx);
            else
                tar=max(n-k-cnt, mn);
            cnt+=tar;
            y=0;
            while (i<n*2 && a[i+1]!=-1 && b[i+1]!=-1 && max(a[i], b[i])>min(a[i+1], b[i+1]))
            {
                if (y==tar)
                {
                    if (a[i]>b[i])
                        cout << 'A';
                    else
                        cout << 'B';
                }
                else
                {
                    if (a[i]>b[i])
                    {
                        cout << 'B';
                        y--;
                    }
                    else
                    {
                        cout << 'A';
                        y++;
                    }
                }
                i++;
            }
            if (y==tar)
            {
                if (a[i]>b[i])
                    cout << 'A';
                else
                    cout << 'B';
            }
            else
            {
                if (a[i]>b[i])
                    cout << 'B';
                else
                    cout << 'A';
            }
        }
    }
    return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 284 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 420 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 596 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 380 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 239 ms 26952 KB Output is correct
35 Correct 215 ms 26424 KB Output is correct
36 Correct 244 ms 25976 KB Output is correct
37 Correct 251 ms 26512 KB Output is correct
38 Correct 215 ms 26520 KB Output is correct
39 Correct 195 ms 25548 KB Output is correct
40 Correct 222 ms 27980 KB Output is correct
41 Correct 213 ms 26276 KB Output is correct
42 Correct 236 ms 27468 KB Output is correct
43 Correct 261 ms 28400 KB Output is correct
44 Correct 238 ms 28452 KB Output is correct
45 Correct 239 ms 28372 KB Output is correct
46 Correct 260 ms 28572 KB Output is correct
47 Correct 232 ms 27576 KB Output is correct
48 Correct 213 ms 27388 KB Output is correct
49 Correct 218 ms 28136 KB Output is correct
50 Correct 233 ms 27568 KB Output is correct
51 Correct 231 ms 27636 KB Output is correct
52 Correct 164 ms 16672 KB Output is correct
53 Correct 164 ms 16648 KB Output is correct
54 Correct 145 ms 16636 KB Output is correct
55 Correct 148 ms 16388 KB Output is correct
56 Correct 210 ms 28652 KB Output is correct
57 Correct 175 ms 23476 KB Output is correct
58 Correct 183 ms 23636 KB Output is correct
59 Correct 191 ms 23712 KB Output is correct
60 Correct 174 ms 22656 KB Output is correct
61 Correct 237 ms 24112 KB Output is correct
62 Correct 194 ms 23808 KB Output is correct
63 Correct 185 ms 24144 KB Output is correct
64 Correct 176 ms 23300 KB Output is correct
65 Correct 200 ms 24140 KB Output is correct