oj.uz

Submission #926136

# Submission time Handle Problem Language Result Execution time Memory
926136 2024-02-12T15:21:23 Z AlphaMale06 Building 4 (JOI20_building4) C++14
100 / 100
 237 ms 69056 KB 
#include <bits/stdc++.h>

using namespace std;

#define F first
#define S second
#define int long long

pair<int, int> uni(pair<int, int> p1, pair<int, int> p2){
    return {min(p1.F, p2.F), max(p1.S, p2.S)};
}

const int N =1e6+3;
int a[N], b[N];
pair<int, int> dp[N][2];

signed main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    n<<=1;
    for(int i=0; i< n; i++)cin >> a[i];
    for(int i=0; i< n; i++)cin >> b[i];
    dp[0][0]={1, 1};
    dp[0][1]={0, 0};
    for(int i=1; i<n; i++){
        dp[i][0]=dp[i][1]={2e9, -2e9};
        if(a[i]>=a[i-1] && a[i]>=b[i-1]){
            dp[i][0]=uni(dp[i-1][0], dp[i-1][1]);
        }
        else if(a[i]>=a[i-1]){
            dp[i][0]=dp[i-1][0];
        }
        else if(a[i]>=b[i-1]){
            dp[i][0]=dp[i-1][1];
        }
        dp[i][0].F++;
        dp[i][0].S++;
        if(b[i]>=a[i-1] && b[i]>=b[i-1]){
            dp[i][1]=uni(dp[i-1][0], dp[i-1][1]);
        }
        else if(b[i]>=a[i-1])dp[i][1]=dp[i-1][0];
        else if(b[i]>=b[i-1])dp[i][1]=dp[i-1][1];
    }
    bool let=0;
    string cons="";
    int cnt=n/2;
    if(dp[n-1][0].F<=n/2 && dp[n-1][0].S>=n/2){
        cnt--;
        cons+='A';
    }
    else if(dp[n-1][1].F<=n/2 && dp[n-1][1].S>=n/2){
        let=1;
        cons+='B';
    }
    for(int i=n-1; i>=1; i--){
        if(let)swap(a[i], b[i]);
        if(a[i-1]<=a[i] && cnt && dp[i-1][0].F<=cnt && dp[i-1][0].S>=cnt){
            if(let)swap(a[i], b[i]);
            cons+='A';
            let=0;
            cnt--;
        }
        else{
           if(let)swap(a[i], b[i]);
            cons+='B';
            let=1;
        }
    }
    reverse(cons.begin(), cons.end());
    int prev=0;
    for(int i = 0; i< n; i++){
        if(cons[i]=='A'){
            if(a[i]>=prev){
                prev=a[i];
            }
            else prev=2e9;
        }
        else{
            if(b[i]>=prev){
                prev=b[i];
            }
            else prev=2e9;
        }
    }
    if(prev==2e9 || cons.size()!=n || cnt!=0){
        cout << -1 << '\n';
        return 0;
    }
    cout << cons << '\n';

}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:88:32: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
   88 |     if(prev==2e9 || cons.size()!=n || cnt!=0){
      |                     ~~~~~~~~~~~^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 2 ms 4944 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 4704 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 2 ms 4572 KB Output is correct
26 Correct 1 ms 4708 KB Output is correct
27 Correct 1 ms 4600 KB Output is correct
28 Correct 2 ms 4704 KB Output is correct
29 Correct 1 ms 612 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 612 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 2 ms 572 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 2652 KB Output is correct
19 Correct 2 ms 4944 KB Output is correct
20 Correct 2 ms 4700 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 2 ms 4704 KB Output is correct
24 Correct 1 ms 4700 KB Output is correct
25 Correct 2 ms 4572 KB Output is correct
26 Correct 1 ms 4708 KB Output is correct
27 Correct 1 ms 4600 KB Output is correct
28 Correct 2 ms 4704 KB Output is correct
29 Correct 1 ms 612 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 612 KB Output is correct
32 Correct 2 ms 4700 KB Output is correct
33 Correct 2 ms 4700 KB Output is correct
34 Correct 179 ms 67900 KB Output is correct
35 Correct 175 ms 64664 KB Output is correct
36 Correct 173 ms 63760 KB Output is correct
37 Correct 215 ms 64480 KB Output is correct
38 Correct 168 ms 64856 KB Output is correct
39 Correct 153 ms 65056 KB Output is correct
40 Correct 179 ms 68300 KB Output is correct
41 Correct 163 ms 65208 KB Output is correct
42 Correct 217 ms 68100 KB Output is correct
43 Correct 222 ms 68780 KB Output is correct
44 Correct 185 ms 68864 KB Output is correct
45 Correct 187 ms 68796 KB Output is correct
46 Correct 198 ms 68868 KB Output is correct
47 Correct 177 ms 67836 KB Output is correct
48 Correct 174 ms 67772 KB Output is correct
49 Correct 198 ms 68828 KB Output is correct
50 Correct 199 ms 67900 KB Output is correct
51 Correct 237 ms 68036 KB Output is correct
52 Correct 131 ms 57080 KB Output is correct
53 Correct 132 ms 57036 KB Output is correct
54 Correct 127 ms 56924 KB Output is correct
55 Correct 127 ms 56732 KB Output is correct
56 Correct 178 ms 69056 KB Output is correct
57 Correct 225 ms 63804 KB Output is correct
58 Correct 169 ms 64072 KB Output is correct
59 Correct 147 ms 64076 KB Output is correct
60 Correct 148 ms 61076 KB Output is correct
61 Correct 169 ms 64492 KB Output is correct
62 Correct 151 ms 63556 KB Output is correct
63 Correct 212 ms 64328 KB Output is correct
64 Correct 143 ms 62468 KB Output is correct
65 Correct 192 ms 64580 KB Output is correct