oj.uz

Submission #945118

# Submission time Handle Problem Language Result Execution time Memory
945118 2024-03-13T12:25:33 Z vjudge1 Building 4 (JOI20_building4) C++17
100 / 100
 194 ms 46928 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#warning That's the baby, that's not my baby

typedef long long ll;

const int NMAX = 1e6;
const int A = 0;
const int B = 1;

int dpmin[NMAX + 2][2];
int dpmax[NMAX + 2][2];
int pmin[NMAX + 2];
int pmax[NMAX + 2];

int a[NMAX + 2], b[NMAX + 2];

int main() {
#ifndef LOCAL
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
#endif

  int n;
  std::cin >> n;
  n *= 2;

  for (int i = 1; i <= n; i++) {
    std::cin >> a[i];
  }
  for (int i = 1; i <= n; i++) {
    std::cin >> b[i];
  }

  for (int i = 1; i <= n; i++) {
    dpmin[i][A] = dpmin[i][B] = 1e9;
    dpmax[i][A] = dpmax[i][B] = -1e9;
  }

  for (int i = 1; i <= n; i++) {
    if (a[i] >= a[i - 1]) {
      dpmin[i][A] = std::min(dpmin[i][A], dpmin[i - 1][A]);
      dpmax[i][A] = std::max(dpmax[i][A], dpmax[i - 1][A]);
    }
    if (a[i] >= b[i - 1]) {
      dpmin[i][A] = std::min(dpmin[i][A], dpmin[i - 1][B]);
      dpmax[i][A] = std::max(dpmax[i][A], dpmax[i - 1][B]);
    }
    if (b[i] >= a[i - 1]) {
      dpmin[i][B] = std::min(dpmin[i][B], dpmin[i - 1][A] + 1);
      dpmax[i][B] = std::max(dpmax[i][B], dpmax[i - 1][A] + 1);
    }
    if (b[i] >= b[i - 1]) {
      dpmin[i][B] = std::min(dpmin[i][B], dpmin[i - 1][B] + 1);
      dpmax[i][B] = std::max(dpmax[i][B], dpmax[i - 1][B] + 1);
    }
  }

  int m = n / 2;

  if ((dpmin[n][A] <= m && m <= dpmax[n][A]) || (dpmin[n][B] <= m && m <= dpmax[n][B])) {
    std::string answer(n + 1, 'A');
    int c;
    if (dpmin[n][A] <= m && m <= dpmax[n][A]) {
      c = A;
    } else {
      c = B;
    }
    for (int i = n; i > 0; i--) {
      if (c == A) {
        if (a[i] >= a[i - 1]) {
          if (dpmin[i - 1][A] <= m && m <= dpmax[i - 1][A]) {
            c = A;
            continue;
          }
        }
        c = B;
      } else {
        m--;
        answer[i] = 'B';
        if (b[i] >= b[i - 1]) {
          if (dpmin[i - 1][B] <= m && m <= dpmax[i - 1][B]) {
            c = B;
            continue;
          }
        }
        c = A;
      }
    }
    answer.erase(answer.begin());
    std::cout << answer;
  } else {
    std::cout << -1;
  }

  return 0;
}

Compilation message

building4.cpp:6:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    6 | #warning That's the baby, that's not my baby
      |  ^~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6612 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6492 KB Output is correct
7 Correct 1 ms 6624 KB Output is correct
8 Correct 2 ms 6520 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 2 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 2 ms 6492 KB Output is correct
14 Correct 2 ms 6620 KB Output is correct
15 Correct 2 ms 6744 KB Output is correct
16 Correct 2 ms 6492 KB Output is correct
17 Correct 2 ms 6492 KB Output is correct
18 Correct 2 ms 6624 KB Output is correct
19 Correct 2 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 2 ms 6492 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 2 ms 6492 KB Output is correct
24 Correct 2 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 2 ms 6620 KB Output is correct
27 Correct 1 ms 6628 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 2 ms 6492 KB Output is correct
30 Correct 2 ms 6492 KB Output is correct
31 Correct 2 ms 6488 KB Output is correct
32 Correct 1 ms 6492 KB Output is correct
33 Correct 1 ms 6488 KB Output is correct
34 Correct 157 ms 44372 KB Output is correct
35 Correct 168 ms 44908 KB Output is correct
36 Correct 153 ms 44624 KB Output is correct
37 Correct 162 ms 44996 KB Output is correct
38 Correct 153 ms 45048 KB Output is correct
39 Correct 143 ms 44116 KB Output is correct
40 Correct 163 ms 46444 KB Output is correct
41 Correct 148 ms 44688 KB Output is correct
42 Correct 171 ms 45908 KB Output is correct
43 Correct 172 ms 46676 KB Output is correct
44 Correct 178 ms 46904 KB Output is correct
45 Correct 182 ms 46900 KB Output is correct
46 Correct 194 ms 46672 KB Output is correct
47 Correct 154 ms 45776 KB Output is correct
48 Correct 170 ms 45808 KB Output is correct
49 Correct 167 ms 46676 KB Output is correct
50 Correct 165 ms 45908 KB Output is correct
51 Correct 163 ms 45884 KB Output is correct
52 Correct 115 ms 35124 KB Output is correct
53 Correct 124 ms 35180 KB Output is correct
54 Correct 109 ms 34956 KB Output is correct
55 Correct 110 ms 34896 KB Output is correct
56 Correct 154 ms 46928 KB Output is correct
57 Correct 132 ms 41808 KB Output is correct
58 Correct 131 ms 42052 KB Output is correct
59 Correct 134 ms 42064 KB Output is correct
60 Correct 142 ms 41064 KB Output is correct
61 Correct 136 ms 42576 KB Output is correct
62 Correct 139 ms 42068 KB Output is correct
63 Correct 136 ms 42560 KB Output is correct
64 Correct 132 ms 41716 KB Output is correct
65 Correct 162 ms 42576 KB Output is correct