oj.uz

Submission #959635

# Submission time Handle Problem Language Result Execution time Memory
959635 2024-04-08T14:41:46 Z AndreiBOTO Building 4 (JOI20_building4) C++14
100 / 100
 206 ms 39924 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;

const int INF=1e9;
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=1;i<=n;i++)
        for(j=0;j<2;j++)
            dp[i][j]=-INF;
    for(i=n;i>0;i--)
    {
        for(j=0;j<2;j++)
        {
            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]);
                }
            }
        }
    }
}

int 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][i]<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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2400 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2604 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2580 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 2396 KB Output is correct
25 Correct 1 ms 2580 KB Output is correct
26 Correct 1 ms 2528 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 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 2452 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 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 2 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 2 ms 2400 KB Output is correct
17 Correct 2 ms 2396 KB Output is correct
18 Correct 2 ms 2396 KB Output is correct
19 Correct 1 ms 2604 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2580 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 2396 KB Output is correct
25 Correct 1 ms 2580 KB Output is correct
26 Correct 1 ms 2528 KB Output is correct
27 Correct 1 ms 2396 KB Output is correct
28 Correct 2 ms 2392 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 2452 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 158 ms 33404 KB Output is correct
35 Correct 195 ms 33192 KB Output is correct
36 Correct 176 ms 32288 KB Output is correct
37 Correct 179 ms 32876 KB Output is correct
38 Correct 183 ms 33176 KB Output is correct
39 Correct 167 ms 32544 KB Output is correct
40 Correct 185 ms 34544 KB Output is correct
41 Correct 201 ms 33004 KB Output is correct
42 Correct 179 ms 33688 KB Output is correct
43 Correct 201 ms 34896 KB Output is correct
44 Correct 203 ms 34684 KB Output is correct
45 Correct 189 ms 34692 KB Output is correct
46 Correct 176 ms 34688 KB Output is correct
47 Correct 170 ms 34388 KB Output is correct
48 Correct 179 ms 34240 KB Output is correct
49 Correct 178 ms 39492 KB Output is correct
50 Correct 203 ms 39020 KB Output is correct
51 Correct 206 ms 39280 KB Output is correct
52 Correct 148 ms 31056 KB Output is correct
53 Correct 144 ms 30972 KB Output is correct
54 Correct 121 ms 31076 KB Output is correct
55 Correct 124 ms 30804 KB Output is correct
56 Correct 187 ms 39924 KB Output is correct
57 Correct 164 ms 35864 KB Output is correct
58 Correct 158 ms 35948 KB Output is correct
59 Correct 157 ms 35972 KB Output is correct
60 Correct 147 ms 34452 KB Output is correct
61 Correct 158 ms 32544 KB Output is correct
62 Correct 162 ms 32348 KB Output is correct
63 Correct 158 ms 32592 KB Output is correct
64 Correct 155 ms 31600 KB Output is correct
65 Correct 157 ms 32380 KB Output is correct