oj.uz

Submission #308620

# Submission time Handle Problem Language Result Execution time Memory
308620 2020-10-01T15:09:38 Z tjdgus4384 Building 4 (JOI20_building4) C++14
100 / 100
 537 ms 50264 KB 
#include<bits/stdc++.h>
using namespace std;
int N, A[1000010], B[1000010], cntA, cntB;
int dpA[1000010][2], dpB[1000010][2];
bool chk[1000010], ret[1000010];

int main(){
    scanf("%d", &N);
    for(int i = 0;i < 2*N;i++){
        scanf("%d", &A[i]);
    }
    for(int i = 0;i < 2*N;i++){
        scanf("%d", &B[i]);
    }
    dpA[0][0] = dpB[0][1] = 1;
    dpA[0][1] = dpB[0][0] = 0;
    int prev = min(A[0], B[0]);
    for(int i = 1;i < 2*N;i++){
        if(A[i] >= A[i - 1]) dpA[i][0] = dpA[i - 1][0] + 1;
        if(A[i] >= B[i - 1]) dpA[i][0] = max(dpA[i][0], dpA[i - 1][1] + 1);
        if(B[i] >= A[i - 1]) dpA[i][1] = dpA[i - 1][0];
        if(B[i] >= B[i - 1]) dpA[i][1] = max(dpA[i][1], dpA[i - 1][1]);
        if(B[i] >= A[i - 1]) dpB[i][1] = dpB[i - 1][0] + 1;
        if(B[i] >= B[i - 1]) dpB[i][1] = max(dpB[i][1], dpB[i - 1][1] + 1);
        if(A[i] >= A[i - 1]) dpB[i][0] = dpB[i - 1][0];
        if(A[i] >= B[i - 1]) dpB[i][0] = max(dpB[i][0], dpB[i - 1][1]);
        if(A[i] <= B[i]){
            if(A[i] >= prev) prev = A[i];
            else if(B[i] >= prev) prev = B[i];
            else{
                printf("-1");
                return 0;
            }
        }
        else{
            if(B[i] >= prev) prev = B[i];
            else if(A[i] >= prev) prev = A[i];
            else{
                printf("-1");
                return 0;
            }
        }
    }
    if(max(dpA[2*N-1][0], dpA[2*N-1][1]) < N || max(dpB[2*N-1][0], dpB[2*N-1][1]) < N){
        printf("-1");
        return 0;
    }
    prev = 0;
    for(int i = 0;i < 2*N;i++){
        if(A[i] <= B[i]){
            if(A[i] >= prev) {
                ret[i] = true;
                chk[i] = false;
                prev = A[i];
                cntA++;
            }
            else if(B[i] >= prev) {
                ret[i] = false;
                chk[i] = true;
                prev = B[i];
                cntB++;
            }
        }
        else{
            if(B[i] >= prev) {
                ret[i] = true;
                chk[i] = true;
                prev = B[i];
                cntB++;
            }
            else if(A[i] >= prev) {
                ret[i] = false;
                chk[i] = false;
                prev = A[i];
                cntA++;
            }
        }
    }
    vector<int> v;
    for(int i = 0;i < 2*N-1;i++){
        if(!ret[i]) continue;
        if(max(A[i], B[i]) <= min(A[i+1], B[i+1])) v.push_back(i);
        else if(max(A[i], B[i]) <= max(A[i+1], B[i+1]) && !ret[i+1]) v.push_back(i);
    }
    if(ret[2*N-1]) v.push_back(2*N-1);
    for(int i = 0;i < v.size();i++){
        if(cntA == cntB) break;
        if(cntA < cntB){
            int cnt, maxcnt = 0, maxi = v[i] + 1;
            if(chk[v[i]]) {maxcnt = cnt = 1; maxi = v[i];}
            else cnt = -1;
            if(cntA + cnt == cntB - cnt){
                chk[v[i]] = false;
                goto print;
            }
            for(int j = v[i] - 1;j >= 0;j--){
                if(!ret[j]) break;
                if(max(A[j], B[j]) <= min(A[j+1], B[j+1])) break;
                if(max(A[j], B[j]) <= max(A[j+1], B[j+1])){
                    if(chk[j]) cnt++;
                    else cnt--;
                    if(cntA + cnt == cntB - cnt){
                        for(int k = v[i];k >= j;k--){
                            if(chk[k]) chk[k] = false;
                            else chk[k] = true;
                        }
                        goto print;
                    }
                    if(cnt > maxcnt){
                        maxcnt = cnt;
                        maxi = j;
                    }
                }
                else break;
            }
            for(int j = v[i];j >= maxi;j--){
                if(chk[j]) chk[j] = false;
                else chk[j] = true;
            }
            cntA += maxcnt, cntB -= maxcnt;
        }
        else{
            int cnt, maxcnt = 0, maxi = v[i] + 1;
            if(!chk[v[i]]) {maxcnt = cnt = 1; maxi = v[i];}
            else cnt = -1;
            if(cntB + cnt == cntA - cnt){
                chk[v[i]] = true;
                goto print;
            }
            for(int j = v[i] - 1;j >= 0;j--){
                if(!ret[j]) break;
                if(max(A[j], B[j]) <= min(A[j+1], B[j+1])) break;
                if(max(A[j], B[j]) <= max(A[j+1], B[j+1])){
                    if(!chk[j]) cnt++;
                    else cnt--;
                    if(cntB + cnt == cntA - cnt){
                        for(int k = v[i];k >= j;k--){
                            if(chk[k]) chk[k] = false;
                            else chk[k] = true;
                        }
                        goto print;
                    }
                    if(cnt > maxcnt){
                        maxcnt = cnt;
                        maxi = j;
                    }
                }
                else break;
            }
            for(int j = v[i];j >= maxi;j--){
                if(chk[j]) chk[j] = false;
                else chk[j] = true;
            }
            cntB += maxcnt, cntA -= maxcnt;
        }
    }
    print:;
    for(int i = 0;i < 2*N;i++){
        if(chk[i]) printf("B");
        else printf("A");
    }
    return 0;
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:86:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |     for(int i = 0;i < v.size();i++){
      |                   ~~^~~~~~~~~~
building4.cpp:8:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    8 |     scanf("%d", &N);
      |     ~~~~~^~~~~~~~~~
building4.cpp:10:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |         scanf("%d", &A[i]);
      |         ~~~~~^~~~~~~~~~~~~
building4.cpp:13:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   13 |         scanf("%d", &B[i]);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 416 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 512 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 512 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 512 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 2 ms 512 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 3 ms 512 KB Output is correct
23 Correct 2 ms 512 KB Output is correct
24 Correct 2 ms 512 KB Output is correct
25 Correct 2 ms 512 KB Output is correct
26 Correct 2 ms 512 KB Output is correct
27 Correct 2 ms 512 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 512 KB Output is correct
30 Correct 2 ms 416 KB Output is correct
31 Correct 2 ms 512 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 2 ms 512 KB Output is correct
34 Correct 380 ms 21988 KB Output is correct
35 Correct 427 ms 42744 KB Output is correct
36 Correct 412 ms 42104 KB Output is correct
37 Correct 419 ms 43128 KB Output is correct
38 Correct 399 ms 46940 KB Output is correct
39 Correct 369 ms 43288 KB Output is correct
40 Correct 449 ms 46948 KB Output is correct
41 Correct 377 ms 43164 KB Output is correct
42 Correct 537 ms 44536 KB Output is correct
43 Correct 445 ms 46068 KB Output is correct
44 Correct 467 ms 46200 KB Output is correct
45 Correct 450 ms 46236 KB Output is correct
46 Correct 483 ms 50264 KB Output is correct
47 Correct 416 ms 46316 KB Output is correct
48 Correct 379 ms 46184 KB Output is correct
49 Correct 376 ms 47084 KB Output is correct
50 Correct 426 ms 45304 KB Output is correct
51 Correct 433 ms 45352 KB Output is correct
52 Correct 317 ms 34424 KB Output is correct
53 Correct 342 ms 34424 KB Output is correct
54 Correct 295 ms 38364 KB Output is correct
55 Correct 286 ms 37352 KB Output is correct
56 Correct 433 ms 46456 KB Output is correct
57 Correct 335 ms 41236 KB Output is correct
58 Correct 330 ms 41464 KB Output is correct
59 Correct 338 ms 41464 KB Output is correct
60 Correct 323 ms 39288 KB Output is correct
61 Correct 338 ms 41928 KB Output is correct
62 Correct 452 ms 41208 KB Output is correct
63 Correct 354 ms 41896 KB Output is correct
64 Correct 339 ms 40332 KB Output is correct
65 Correct 332 ms 41848 KB Output is correct