oj.uz

답안 #300147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
300147 2020-09-16T20:51:37 Z BeanZ 건물 4 (JOI20_building4) C++14
100 / 100
 407 ms 146168 KB 
// I_LOVE_LPL
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define endl '\n'
const int N = 1e6 + 5;
const int lim = 3e2;
ll inf = 1e18;
ll a[N][2], vis[N][2];
pair<ll, ll> dp[N][2]; // dem B
void DP(ll i, ll j){
        if (vis[i][j]) return;
        vis[i][j] = 1;
        ll mn = inf, mx = -inf;
        if (a[i][j] <= a[i + 1][0]){
                DP(i + 1, 0);
                mn = min(mn, dp[i + 1][0].first);
                mx = max(mx, dp[i + 1][0].second);
        }
        if (a[i][j] <= a[i + 1][1]){
                DP(i + 1, 1);
                mn = min(mn, dp[i + 1][1].first + 1);
                mx = max(mx, dp[i + 1][1].second + 1);
        }
        dp[i][j] = {mn, mx};
        //cout << dp[i][j].first << " " << dp[i][j].second << endl;
}
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        if (fopen("A.inp", "r")){
                freopen("test.inp", "r", stdin);
                freopen("test.out", "w", stdout);
        }
        ll n;
        cin >> n;
        n *= 2;
        for (int j = 0; j < 2; j++){
                for (int i = 1; i <= n; i++){
                        cin >> a[i][j];
                }
        }
        vis[n][0] = vis[n][1] = 1;
        DP(0, 0);
        if (dp[0][0].first > (n / 2) || dp[0][0].second < (n / 2)) return cout << -1, 0;
        ll cur = n / 2;
        ll last = 0;
        for (int i = 1; i <= n; i++){
                //cout << dp[i][1].first << " " << dp[i][1].second << endl;
                if (a[i][1] >= a[i - 1][last] && dp[i][1].first <= (cur - 1) && (cur - 1) <= dp[i][1].second){
                        cout << "B";
                        last = 1;
                        cur--;
                } else {
                        cout << "A";
                        last = 0;
                }
        }
}
/*
*/

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:34:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   34 |                 freopen("test.inp", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
building4.cpp:35:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   35 |                 freopen("test.out", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 2 ms 896 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 2 ms 896 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 2 ms 896 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 896 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 2 ms 896 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 2 ms 896 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 2 ms 1024 KB Output is correct
32 Correct 2 ms 896 KB Output is correct
33 Correct 2 ms 896 KB Output is correct

Subtask #2
89.0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 2 ms 768 KB Output is correct
8 Correct 2 ms 768 KB Output is correct
9 Correct 2 ms 768 KB Output is correct
10 Correct 2 ms 768 KB Output is correct
11 Correct 2 ms 768 KB Output is correct
12 Correct 2 ms 896 KB Output is correct
13 Correct 2 ms 896 KB Output is correct
14 Correct 2 ms 896 KB Output is correct
15 Correct 2 ms 896 KB Output is correct
16 Correct 2 ms 896 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 3 ms 1024 KB Output is correct
19 Correct 2 ms 896 KB Output is correct
20 Correct 2 ms 896 KB Output is correct
21 Correct 2 ms 896 KB Output is correct
22 Correct 2 ms 896 KB Output is correct
23 Correct 2 ms 896 KB Output is correct
24 Correct 2 ms 896 KB Output is correct
25 Correct 2 ms 896 KB Output is correct
26 Correct 2 ms 896 KB Output is correct
27 Correct 2 ms 896 KB Output is correct
28 Correct 1 ms 768 KB Output is correct
29 Correct 2 ms 896 KB Output is correct
30 Correct 2 ms 768 KB Output is correct
31 Correct 2 ms 1024 KB Output is correct
32 Correct 2 ms 896 KB Output is correct
33 Correct 2 ms 896 KB Output is correct
34 Correct 225 ms 29816 KB Output is correct
35 Correct 339 ms 135288 KB Output is correct
36 Correct 331 ms 133112 KB Output is correct
37 Correct 336 ms 135928 KB Output is correct
38 Correct 346 ms 135800 KB Output is correct
39 Correct 333 ms 135416 KB Output is correct
40 Correct 356 ms 144888 KB Output is correct
41 Correct 359 ms 138104 KB Output is correct
42 Correct 354 ms 141176 KB Output is correct
43 Correct 371 ms 146040 KB Output is correct
44 Correct 366 ms 146040 KB Output is correct
45 Correct 364 ms 145912 KB Output is correct
46 Correct 352 ms 146040 KB Output is correct
47 Correct 349 ms 145144 KB Output is correct
48 Correct 352 ms 144888 KB Output is correct
49 Correct 360 ms 145748 KB Output is correct
50 Correct 407 ms 145016 KB Output is correct
51 Correct 367 ms 145016 KB Output is correct
52 Correct 285 ms 134136 KB Output is correct
53 Correct 289 ms 134264 KB Output is correct
54 Correct 278 ms 134136 KB Output is correct
55 Correct 277 ms 133880 KB Output is correct
56 Correct 384 ms 146168 KB Output is correct
57 Correct 337 ms 140492 KB Output is correct
58 Correct 334 ms 141176 KB Output is correct
59 Correct 324 ms 141176 KB Output is correct
60 Correct 308 ms 133112 KB Output is correct
61 Correct 338 ms 141688 KB Output is correct
62 Correct 331 ms 139512 KB Output is correct
63 Correct 330 ms 141688 KB Output is correct
64 Correct 324 ms 136824 KB Output is correct
65 Correct 351 ms 141728 KB Output is correct