Submission #678399

# Submission time Handle Problem Language Result Execution time Memory
678399 2023-01-05T17:59:19 Z MarcuMihai Building 4 (JOI20_building4) C++14
100 / 100
923 ms 75580 KB
#include <iostream>

using namespace std;

int n;
struct el
{
    int sus;
    int jos;
};
el a[1000005];

struct din
{
    int minim;
    int maxim;
};
din dp[1000005][2];

void inapoi(int n, int niv, int puse)
{

    if(n==0)
        return;

    int x;
    if(niv==0)
        x=a[n].sus;
    else
        x=a[n].jos;

    if(dp[n-1][0].minim<=puse && dp[n-1][0].maxim>=puse && x>=a[n-1].sus)
        inapoi(n-1, 0, puse-1);
    else
        inapoi(n-1, 1, puse);


    if(niv==0)
        cout<<'A';
    else
        cout<<'B';
}


int main()
{
    cin>>n;
    for(int i=1; i<=2*n; ++i)
        cin>>a[i].sus;
    for(int i=1; i<=2*n; ++i)
        cin>>a[i].jos;

    for(int i=1; i<=2*n; ++i)
    {
        dp[i][0].minim=dp[i][1].minim=999999999;
        dp[i][0].maxim=dp[i][1].maxim=-999999999;
    }

    dp[1][0]= {1,1};
    dp[1][1]= {0,0};

    for(int i=2; i<=2*n; ++i)
    {
        if(a[i].sus>=a[i-1].sus)
        {
            dp[i][0].minim=min(dp[i][0].minim, dp[i-1][0].minim+1);
            dp[i][0].maxim=max(dp[i][0].maxim, dp[i-1][0].maxim+1);
        }
        if(a[i].sus>=a[i-1].jos)
        {
            dp[i][0].minim=min(dp[i][0].minim, dp[i-1][1].minim+1);
            dp[i][0].maxim=max(dp[i][0].maxim, dp[i-1][1].maxim+1);
        }



        if(a[i].jos>=a[i-1].sus)
        {
            dp[i][1].minim=min(dp[i][1].minim, dp[i-1][0].minim);
            dp[i][1].maxim=max(dp[i][1].maxim, dp[i-1][0].maxim);
        }
        if(a[i].jos>=a[i-1].jos)
        {
            dp[i][1].minim=min(dp[i][1].minim, dp[i-1][1].minim);
            dp[i][1].maxim=max(dp[i][1].maxim, dp[i-1][1].maxim);
        }
    }
    if((dp[2*n][0].minim>n || dp[2*n][0].maxim<n) && (dp[2*n][1].minim>n || dp[2*n][1].maxim<n))
        cout<<-1;


    else
    {


        if(dp[2*n][0].minim<=n && dp[2*n][0].maxim>=n)
        {
            inapoi(2*n,0,n-1);
        }
        else
        {
            inapoi(2*n,1,n);
        }

    }


    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 4 ms 396 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 536 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 580 KB Output is correct
12 Correct 3 ms 580 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 4 ms 596 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 456 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 4 ms 396 KB Output is correct
6 Correct 3 ms 468 KB Output is correct
7 Correct 3 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 5 ms 536 KB Output is correct
10 Correct 3 ms 468 KB Output is correct
11 Correct 3 ms 580 KB Output is correct
12 Correct 3 ms 580 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 5 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 468 KB Output is correct
21 Correct 2 ms 468 KB Output is correct
22 Correct 3 ms 468 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 4 ms 596 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 468 KB Output is correct
27 Correct 3 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 2 ms 468 KB Output is correct
31 Correct 3 ms 456 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 726 ms 42368 KB Output is correct
35 Correct 759 ms 69840 KB Output is correct
36 Correct 711 ms 68736 KB Output is correct
37 Correct 804 ms 70184 KB Output is correct
38 Correct 710 ms 70232 KB Output is correct
39 Correct 719 ms 69468 KB Output is correct
40 Correct 794 ms 74784 KB Output is correct
41 Correct 853 ms 70976 KB Output is correct
42 Correct 807 ms 72956 KB Output is correct
43 Correct 923 ms 75356 KB Output is correct
44 Correct 847 ms 75436 KB Output is correct
45 Correct 844 ms 75340 KB Output is correct
46 Correct 803 ms 75344 KB Output is correct
47 Correct 769 ms 74476 KB Output is correct
48 Correct 841 ms 74264 KB Output is correct
49 Correct 847 ms 75068 KB Output is correct
50 Correct 806 ms 74560 KB Output is correct
51 Correct 818 ms 74580 KB Output is correct
52 Correct 467 ms 63668 KB Output is correct
53 Correct 516 ms 63628 KB Output is correct
54 Correct 440 ms 63660 KB Output is correct
55 Correct 441 ms 63320 KB Output is correct
56 Correct 780 ms 75580 KB Output is correct
57 Correct 630 ms 70240 KB Output is correct
58 Correct 619 ms 70584 KB Output is correct
59 Correct 628 ms 70716 KB Output is correct
60 Correct 617 ms 66692 KB Output is correct
61 Correct 655 ms 71128 KB Output is correct
62 Correct 676 ms 70096 KB Output is correct
63 Correct 629 ms 71180 KB Output is correct
64 Correct 690 ms 68680 KB Output is correct
65 Correct 633 ms 71240 KB Output is correct