oj.uz

Submission #611952

# Submission time Handle Problem Language Result Execution time Memory
611952 2022-07-29T09:00:35 Z alireza_kaviani Building 4 (JOI20_building4) C++17
100 / 100
 333 ms 44336 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

#define all(x)      (x).begin(),(x).end()
#define X           first
#define Y           second
#define sep         ' '
#define endl        '\n'
#define SZ(x)       ll(x.size())

const ll MAXN = 1e6 + 10;
const ll LOG = 22;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; //998244353; //1e9 + 9;

int n , A[MAXN][2] , mn[MAXN][2] , mx[MAXN][2];

int main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

    cin >> n; n *= 2;
    for(int i = 1 ; i <= n ; i++){
        cin >> A[i][0];
    }
    for(int i = 1 ; i <= n ; i++){
        cin >> A[i][1];
    }

    mn[n][0] = mx[n][0] = 1;
    mn[n][1] = mx[n][1] = -1;
    for(int i = n - 1 ; i >= 1 ; i--){
        for(int j = 0 ; j < 2 ; j++){
            mn[i][j] = MOD; mx[i][j] = -MOD;
            for(int k = 0 ; k < 2 ; k++){
                if(A[i][j] > A[i + 1][k])   continue;
                mn[i][j] = min(mn[i][j] , mn[i + 1][k] + 1 - j * 2);
                mx[i][j] = max(mx[i][j] , mx[i + 1][k] + 1 - j * 2);
            }
        }
    }

    if((0 < mn[1][0] || mx[1][0] < 0) && (0 < mn[1][1] || mx[1][1] < 0)){
        return cout << -1 << endl , 0;
    }
    int last = -MOD , cur = 0;
    for(int i = 1 ; i <= n ; i++){
        int ind = -1;
        for(int j = 0 ; j < 2 ; j++){
            if(last <= A[i][j] && mn[i][j] <= cur && cur <= mx[i][j]){
                ind = j;
                break;
            }
        }
        last = A[i][ind];
        cur += ind * 2 - 1;
        cout << char(65 + ind);
    }

    return 0;
}
/*

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 472 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 428 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 472 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 396 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 468 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 468 KB Output is correct
6 Correct 2 ms 420 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 472 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 2 ms 428 KB Output is correct
13 Correct 2 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 2 ms 468 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 468 KB Output is correct
22 Correct 1 ms 472 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 460 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 468 KB Output is correct
29 Correct 1 ms 396 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 596 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 217 ms 42348 KB Output is correct
35 Correct 267 ms 40884 KB Output is correct
36 Correct 276 ms 40200 KB Output is correct
37 Correct 268 ms 41100 KB Output is correct
38 Correct 242 ms 41032 KB Output is correct
39 Correct 205 ms 40300 KB Output is correct
40 Correct 235 ms 43584 KB Output is correct
41 Correct 256 ms 41172 KB Output is correct
42 Correct 300 ms 42792 KB Output is correct
43 Correct 269 ms 44176 KB Output is correct
44 Correct 258 ms 44124 KB Output is correct
45 Correct 255 ms 44140 KB Output is correct
46 Correct 333 ms 44100 KB Output is correct
47 Correct 248 ms 43220 KB Output is correct
48 Correct 276 ms 42988 KB Output is correct
49 Correct 290 ms 43876 KB Output is correct
50 Correct 268 ms 43212 KB Output is correct
51 Correct 321 ms 43272 KB Output is correct
52 Correct 205 ms 32332 KB Output is correct
53 Correct 187 ms 32412 KB Output is correct
54 Correct 161 ms 32480 KB Output is correct
55 Correct 165 ms 32076 KB Output is correct
56 Correct 266 ms 44336 KB Output is correct
57 Correct 210 ms 39140 KB Output is correct
58 Correct 214 ms 39392 KB Output is correct
59 Correct 237 ms 39300 KB Output is correct
60 Correct 222 ms 37460 KB Output is correct
61 Correct 214 ms 39820 KB Output is correct
62 Correct 202 ms 39348 KB Output is correct
63 Correct 204 ms 39820 KB Output is correct
64 Correct 206 ms 38480 KB Output is correct
65 Correct 212 ms 39788 KB Output is correct