oj.uz

Submission #959632

# Submission time Handle Problem Language Result Execution time Memory
959632 2024-04-08T14:39:58 Z AndreiBOTO Building 4 (JOI20_building4) C++14
100 / 100
 215 ms 52484 KB 
#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define int long long

const int INF=1e10;
const int NMAX=1e6+5;

long long dp[NMAX][2];
int v[NMAX][2];

int n;

void get_dp(int x)
{
    int i,j,k;
    for(i=n;i>0;i--)
    {
        for(j=0;j<2;j++)
        {
            dp[i][j]=-INF;
            for(k=0;k<2;k++)
            {
                if(v[i-1][j]<=v[i][k])
                {
                    if(k==x)
                        dp[i][j]=max(dp[i][j],dp[i+1][k]+1);
                    else
                        dp[i][j]=max(dp[i][j],dp[i+1][k]);
                }
            }
        }
    }
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);

    int i,k;
    cin>>n;
    n*=2;
    for(k=0;k<2;k++)
    {
        for(i=1;i<=n;i++)
            cin>>v[i][k];
    }
    for(i=1;i>=0;i--)
    {
        get_dp(i);
        if(dp[1][0]<n/2)
        {
            cout<<-1;
            exit(0);
        }
    }
    int curr=0,kon=n/2;
    for(i=1;i<=n;i++)
    {
        if(v[i][1]>=curr && dp[i+1][1]>=kon)
        {
            cout<<"B";
            curr=v[i][1];
        }
        else
        {
            cout<<"A";
            kon--;
            curr=v[i][0];
        }
    }
    return 0;
}

Compilation message

building4.cpp:3: warning: ignoring '#pragma optimize GCC' [-Wunknown-pragmas]
    3 | #pragma optimize GCC ("Ofast")
      |

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2608 KB Output is correct
6 Correct 2 ms 2868 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 2 ms 2900 KB Output is correct
12 Correct 1 ms 2656 KB Output is correct
13 Correct 1 ms 2652 KB Output is correct
14 Correct 1 ms 2652 KB Output is correct
15 Correct 2 ms 2780 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 1 ms 2528 KB Output is correct
28 Correct 1 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 172 ms 50260 KB Output is correct
35 Correct 189 ms 49016 KB Output is correct
36 Correct 183 ms 48764 KB Output is correct
37 Correct 198 ms 50256 KB Output is correct
38 Correct 167 ms 50160 KB Output is correct
39 Correct 171 ms 49152 KB Output is correct
40 Correct 202 ms 51336 KB Output is correct
41 Correct 178 ms 48724 KB Output is correct
42 Correct 201 ms 50532 KB Output is correct
43 Correct 208 ms 51960 KB Output is correct
44 Correct 203 ms 51964 KB Output is correct
45 Correct 208 ms 52484 KB Output is correct
46 Correct 215 ms 51848 KB Output is correct
47 Correct 173 ms 51060 KB Output is correct
48 Correct 180 ms 50808 KB Output is correct
49 Correct 179 ms 51572 KB Output is correct
50 Correct 200 ms 51028 KB Output is correct
51 Correct 207 ms 51508 KB Output is correct
52 Correct 138 ms 40240 KB Output is correct
53 Correct 143 ms 40192 KB Output is correct
54 Correct 122 ms 40188 KB Output is correct
55 Correct 124 ms 40016 KB Output is correct
56 Correct 179 ms 52204 KB Output is correct
57 Correct 161 ms 47104 KB Output is correct
58 Correct 150 ms 47228 KB Output is correct
59 Correct 160 ms 47236 KB Output is correct
60 Correct 153 ms 46208 KB Output is correct
61 Correct 176 ms 47700 KB Output is correct
62 Correct 157 ms 47200 KB Output is correct
63 Correct 168 ms 47536 KB Output is correct
64 Correct 149 ms 46656 KB Output is correct
65 Correct 163 ms 47708 KB Output is correct