oj.uz

Submission #237962

# Submission time Handle Problem Language Result Execution time Memory
237962 2020-06-09T13:38:12 Z egekabas Building 4 (JOI20_building4) C++14
100 / 100
 359 ms 48480 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int n, a[1000009][2];
int dp[1000009][2][2];
void calc(int i, int j){
    if(a[i][j] >= a[i-1][0]){
        dp[i][j][0] = min(dp[i][j][0], dp[i-1][0][0]+j);
        dp[i][j][1] = max(dp[i][j][1], dp[i-1][0][1]+j);
    }
    if(a[i][j] >= a[i-1][1]){
        dp[i][j][0] = min(dp[i][j][0], dp[i-1][1][0]+j);
        dp[i][j][1] = max(dp[i][j][1], dp[i-1][1][1]+j);
    }
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    n *= 2;
    for(int i = 0; i < n; ++i)
        cin >> a[i][0];
    for(int i = 0; i < n; ++i)
        cin >> a[i][1];
    for(int i = 0; i < n; ++i){
        dp[i][0][0] = 1e9;
        dp[i][0][1] = -1e9;
        dp[i][1][0] = 1e9;
        dp[i][1][1] = -1e9;
    }   
    dp[0][0][0] = 0;
    dp[0][0][1] = 0;
    dp[0][1][0] = 1;
    dp[0][1][1] = 1;
    for(int i = 1; i < n; ++i){
        calc(i, 0);
        calc(i, 1);
    }
    vector<int> ans;
    int pos, cur;
    if(dp[n-1][0][0] <= n/2 && n/2 <= dp[n-1][0][1])
        pos = cur = 0;
    else if(dp[n-1][1][0] <= n/2 && n/2 <= dp[n-1][1][1])
        pos = cur = 1;
    else{
        cout << -1;
        return 0;
    }
    ans.pb(pos);
    for(int i = n-2; i >= 0; --i){
        if(a[i][0] <= a[i+1][pos] && dp[i][0][0] <= n/2-cur && n/2-cur <= dp[i][0][1])
            pos = 0;
        else
            pos = 1;
        ans.pb(pos);
        cur += pos;
    }
    reverse(ans.begin(), ans.end());
    for(auto u : ans){
        if(u)
            cout << 'B';
        else
            cout << 'A';
    }
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 512 KB Output is correct
10 Correct 5 ms 512 KB Output is correct
11 Correct 6 ms 512 KB Output is correct
12 Correct 6 ms 640 KB Output is correct
13 Correct 6 ms 640 KB Output is correct
14 Correct 6 ms 640 KB Output is correct
15 Correct 6 ms 640 KB Output is correct
16 Correct 6 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 6 ms 512 KB Output is correct
19 Correct 6 ms 640 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 5 ms 512 KB Output is correct
22 Correct 6 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 6 ms 512 KB Output is correct
25 Correct 5 ms 512 KB Output is correct
26 Correct 5 ms 512 KB Output is correct
27 Correct 6 ms 512 KB Output is correct
28 Correct 6 ms 512 KB Output is correct
29 Correct 6 ms 512 KB Output is correct
30 Correct 6 ms 512 KB Output is correct
31 Correct 5 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 6 ms 512 KB Output is correct
34 Correct 317 ms 42488 KB Output is correct
35 Correct 328 ms 44900 KB Output is correct
36 Correct 331 ms 44128 KB Output is correct
37 Correct 341 ms 45032 KB Output is correct
38 Correct 312 ms 44900 KB Output is correct
39 Correct 304 ms 44144 KB Output is correct
40 Correct 348 ms 47972 KB Output is correct
41 Correct 319 ms 45160 KB Output is correct
42 Correct 338 ms 46688 KB Output is correct
43 Correct 359 ms 48224 KB Output is correct
44 Correct 353 ms 48224 KB Output is correct
45 Correct 351 ms 48224 KB Output is correct
46 Correct 341 ms 48344 KB Output is correct
47 Correct 332 ms 47328 KB Output is correct
48 Correct 329 ms 47184 KB Output is correct
49 Correct 333 ms 47968 KB Output is correct
50 Correct 355 ms 47404 KB Output is correct
51 Correct 342 ms 47444 KB Output is correct
52 Correct 225 ms 36576 KB Output is correct
53 Correct 219 ms 36580 KB Output is correct
54 Correct 208 ms 36448 KB Output is correct
55 Correct 218 ms 36320 KB Output is correct
56 Correct 332 ms 48480 KB Output is correct
57 Correct 297 ms 43368 KB Output is correct
58 Correct 303 ms 43468 KB Output is correct
59 Correct 297 ms 43416 KB Output is correct
60 Correct 295 ms 41312 KB Output is correct
61 Correct 302 ms 43872 KB Output is correct
62 Correct 290 ms 43232 KB Output is correct
63 Correct 299 ms 43952 KB Output is correct
64 Correct 290 ms 42432 KB Output is correct
65 Correct 309 ms 44072 KB Output is correct