oj.uz

Submission #930854

# Submission time Handle Problem Language Result Execution time Memory
930854 2024-02-20T13:52:24 Z ksujay2 Building 4 (JOI20_building4) C++17
100 / 100
 218 ms 48208 KB 
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define F0R(i, b) for(int i = 0; i < (b); i++)
#define R0F(i, b) for(int i = (b) - 1; i >= 0; i--)
#define ROF(i, a, b) for(int i = (b) - 1; i >= (a); i--)
using pi = pair<int, int>;
int main() {
  ios::sync_with_stdio(false), cin.tie(nullptr);
  int N; cin >> N;
  vector<int> A(2 * N), B(2 * N);
  F0R(i, 2 * N) cin >> A[i];
  F0R(i, 2 * N) cin >> B[i];
  vector<array<pi, 2>> dp(2 * N, {{{1e9, -1e9}, {1e9, -1e9}}});
  dp[0][0] = {1, 1};
  dp[0][1] = {-1, -1};
  FOR(i, 1, 2 * N) {
    if(A[i - 1] <= A[i]) {
      dp[i][0].second = max(dp[i][0].second, dp[i - 1][0].second + 1);
      dp[i][0].first = min(dp[i][0].first, dp[i - 1][0].first + 1);
    }
    if(A[i - 1] <= B[i]) {
      dp[i][1].second = max(dp[i][1].second, dp[i - 1][0].second - 1);
      dp[i][1].first = min(dp[i][1].first, dp[i - 1][0].first - 1);
    }
    if(B[i - 1] <= A[i]) {
      dp[i][0].second = max(dp[i][0].second, dp[i - 1][1].second + 1);
      dp[i][0].first = min(dp[i][0].first, dp[i - 1][1].first + 1);
    }
    if(B[i - 1] <= B[i]) {
      dp[i][1].second = max(dp[i][1].second, dp[i - 1][1].second - 1);
      dp[i][1].first = min(dp[i][1].first, dp[i - 1][1].first - 1);
    }
  }
  vector<int> choice(2 * N);
  int sum = 0;
  int lv = 1e9;
  ROF(i, 0, 2 * N) {
    if(lv >= A[i] && dp[i][0].second >= -sum && -sum >= dp[i][0].first) {
      choice[i] = 0;
      lv = A[i];
      sum++;
    } else if(lv >= B[i] && dp[i][1].second >= -sum && -sum >= dp[i][1].first) {
      choice[i] = 1;
      lv = B[i];
      sum--;
    } else {
      cout << -1 << endl;
      return 0;
    }
  }
  F0R(i, 2 * N) {
    if(choice[i] == 0) cout << 'A';
    else cout << 'B';
  }
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 388 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 560 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 520 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 552 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 388 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 560 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 520 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 164 ms 46272 KB Output is correct
35 Correct 182 ms 44584 KB Output is correct
36 Correct 178 ms 43792 KB Output is correct
37 Correct 185 ms 45140 KB Output is correct
38 Correct 167 ms 44708 KB Output is correct
39 Correct 165 ms 43856 KB Output is correct
40 Correct 176 ms 47444 KB Output is correct
41 Correct 170 ms 44992 KB Output is correct
42 Correct 218 ms 46764 KB Output is correct
43 Correct 192 ms 47936 KB Output is correct
44 Correct 192 ms 47960 KB Output is correct
45 Correct 188 ms 47956 KB Output is correct
46 Correct 175 ms 48136 KB Output is correct
47 Correct 185 ms 47184 KB Output is correct
48 Correct 179 ms 46932 KB Output is correct
49 Correct 183 ms 47700 KB Output is correct
50 Correct 208 ms 47188 KB Output is correct
51 Correct 195 ms 47184 KB Output is correct
52 Correct 137 ms 36416 KB Output is correct
53 Correct 138 ms 36232 KB Output is correct
54 Correct 135 ms 36416 KB Output is correct
55 Correct 126 ms 36160 KB Output is correct
56 Correct 192 ms 48208 KB Output is correct
57 Correct 157 ms 43092 KB Output is correct
58 Correct 165 ms 43168 KB Output is correct
59 Correct 157 ms 43348 KB Output is correct
60 Correct 154 ms 41076 KB Output is correct
61 Correct 162 ms 43860 KB Output is correct
62 Correct 158 ms 43092 KB Output is correct
63 Correct 155 ms 43860 KB Output is correct
64 Correct 159 ms 42324 KB Output is correct
65 Correct 159 ms 43856 KB Output is correct