oj.uz

Submission #366399

# Submission time Handle Problem Language Result Execution time Memory
366399 2021-02-14T06:39:46 Z Kazalika Building 4 (JOI20_building4) C++14
100 / 100
 299 ms 45536 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
const int N = 1e6 + 7, inf = 1e9 + 9;
 
int n, a[N][2];
int mn[N][2], mx[N][2];
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n;
  for (int i = 1; i <= 2 * n; ++i)
    cin >> a[i][0];
  for (int i = 1; i <= 2 * n; ++i)
    cin >> a[i][1];
  for (int i = 1; i <= 2 * n; i++) {
   mn[i][0] = mn[i][1] = inf;
   mx[i][0] = mx[i][1] = -inf;
  }
  for (int i = 1; i <= 2 * n; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < 2; k++) {
        if (a[i - 1][k] <= a[i][j]) {
          if (mn[i - 1][k] != inf)
            mn[i][j] = min(mn[i][j], mn[i - 1][k] + j);
          if (mx[i - 1][k] != -inf)
            mx[i][j] = max(mx[i][j], mx[i - 1][k] + j);
        }
      }
    }
  }
  int j = -1;
  for (int i = 0; i < 2; i++) {
    if (mn[2 * n][i] <= n && n <= mx[2 * n][i]) {
      j = i;
      break;
    }
  }
  if (j == -1) {
    cout << -1;
    return 0;
  }
  string ans;
  int cur = n;
  for (int i = 2 * n; i; i--) {
    cur -= j;
    ans.push_back('A' + j);
    int jj = -1;
    for (int k = 0; k < 2; k++) {
      if (mn[i - 1][k] <= cur && cur <= mx[i - 1][k] && a[i - 1][k] <= a[i][j]) {
        jj = k;
        break;
      }
    }
    j = jj;
  }
  reverse(ans.begin(), ans.end());
  cout << ans << endl;
  return 0;
}

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 2 ms 492 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 2 ms 492 KB Output is correct
8 Correct 1 ms 492 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 2 ms 492 KB Output is correct
13 Correct 2 ms 492 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 492 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 492 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 1 ms 492 KB Output is correct
21 Correct 2 ms 492 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 492 KB Output is correct
25 Correct 2 ms 492 KB Output is correct
26 Correct 2 ms 492 KB Output is correct
27 Correct 2 ms 492 KB Output is correct
28 Correct 2 ms 492 KB Output is correct
29 Correct 2 ms 492 KB Output is correct
30 Correct 2 ms 492 KB Output is correct
31 Correct 41 ms 492 KB Output is correct
32 Correct 2 ms 492 KB Output is correct
33 Correct 2 ms 492 KB Output is correct
34 Correct 263 ms 42552 KB Output is correct
35 Correct 299 ms 42184 KB Output is correct
36 Correct 260 ms 41380 KB Output is correct
37 Correct 258 ms 42276 KB Output is correct
38 Correct 240 ms 42276 KB Output is correct
39 Correct 241 ms 41380 KB Output is correct
40 Correct 267 ms 44768 KB Output is correct
41 Correct 234 ms 42404 KB Output is correct
42 Correct 260 ms 43812 KB Output is correct
43 Correct 274 ms 45024 KB Output is correct
44 Correct 276 ms 45408 KB Output is correct
45 Correct 272 ms 45384 KB Output is correct
46 Correct 253 ms 45280 KB Output is correct
47 Correct 254 ms 44384 KB Output is correct
48 Correct 248 ms 44252 KB Output is correct
49 Correct 257 ms 45024 KB Output is correct
50 Correct 273 ms 44512 KB Output is correct
51 Correct 269 ms 44672 KB Output is correct
52 Correct 217 ms 33632 KB Output is correct
53 Correct 194 ms 33504 KB Output is correct
54 Correct 175 ms 33652 KB Output is correct
55 Correct 177 ms 33248 KB Output is correct
56 Correct 255 ms 45536 KB Output is correct
57 Correct 217 ms 40288 KB Output is correct
58 Correct 223 ms 40544 KB Output is correct
59 Correct 222 ms 40672 KB Output is correct
60 Correct 216 ms 38564 KB Output is correct
61 Correct 226 ms 41056 KB Output is correct
62 Correct 224 ms 40416 KB Output is correct
63 Correct 227 ms 41056 KB Output is correct
64 Correct 220 ms 39588 KB Output is correct
65 Correct 224 ms 41056 KB Output is correct