oj.uz

Submission #211802

# Submission time Handle Problem Language Result Execution time Memory
211802 2020-03-21T10:19:57 Z achvanov Building 4 (JOI20_building4) C++17
100 / 100
 321 ms 26988 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6;
int a[N][2];
int dp[N][2][2];

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  int n;
  cin >> n;
  for (int j = 0; j < 2; ++j) {
    for (int i = 0; i < 2 * n; ++i) {
      cin >> a[i][j];
    }
  }
  dp[0][0][0] = dp[0][0][1] = 1;
  for (int i = 1; i < 2 * n; ++i) {
    for (int j = 0; j < 2; ++j) {
      dp[i][j][0] = 1e9;
      dp[i][j][1] = -1e9;
      for (int k = 0; k < 2; ++k) {
        if (a[i - 1][k] > a[i][j]) {
          continue;
        }
        dp[i][j][0] = min(dp[i][j][0], dp[i - 1][k][0] + (j ^ 1));
        dp[i][j][1] = max(dp[i][j][1], dp[i - 1][k][1] + (j ^ 1));
      }
    }
  }
  for (int it = 0; it < 2; ++it) {
    if (dp[2 * n - 1][it][0] > n or dp[2 * n - 1][it][1] < n) {
      continue;
    }
    string ans;
    ans += char('A' + it);
    int tot = n - (it ^ 1);
    for (int i = 2 * n - 2; i >= 0; --i) {
      for (int j = 0; j < 2; ++j) {
        if (a[i][j] <= a[i + 1][it] and dp[i][j][0] <= tot and tot <= dp[i][j][1] and tot >= (j ^ 1)) {
          ans += char('A' + j);
          tot -= (j ^ 1);
          it = j;
          break;
        }
      }
    }
    reverse(ans.begin(), ans.end());
    cout << ans;
    return 0;
  }
  cout << -1;

  return 0;
}

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 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 504 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 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 6 ms 512 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 512 KB Output is correct
20 Correct 6 ms 560 KB Output is correct
21 Correct 10 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 5 ms 512 KB Output is correct
29 Correct 5 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 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 6 ms 512 KB Output is correct
6 Correct 6 ms 512 KB Output is correct
7 Correct 6 ms 512 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 6 ms 504 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 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 7 ms 512 KB Output is correct
15 Correct 6 ms 512 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 512 KB Output is correct
20 Correct 6 ms 560 KB Output is correct
21 Correct 10 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 5 ms 512 KB Output is correct
29 Correct 5 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 308 ms 23620 KB Output is correct
35 Correct 287 ms 24624 KB Output is correct
36 Correct 283 ms 24112 KB Output is correct
37 Correct 315 ms 25180 KB Output is correct
38 Correct 294 ms 25264 KB Output is correct
39 Correct 279 ms 24880 KB Output is correct
40 Correct 307 ms 25964 KB Output is correct
41 Correct 290 ms 25008 KB Output is correct
42 Correct 300 ms 25264 KB Output is correct
43 Correct 321 ms 26868 KB Output is correct
44 Correct 321 ms 26860 KB Output is correct
45 Correct 310 ms 26476 KB Output is correct
46 Correct 291 ms 26860 KB Output is correct
47 Correct 315 ms 26348 KB Output is correct
48 Correct 313 ms 26340 KB Output is correct
49 Correct 303 ms 26916 KB Output is correct
50 Correct 306 ms 26220 KB Output is correct
51 Correct 315 ms 26092 KB Output is correct
52 Correct 190 ms 26604 KB Output is correct
53 Correct 188 ms 26732 KB Output is correct
54 Correct 167 ms 26604 KB Output is correct
55 Correct 184 ms 26732 KB Output is correct
56 Correct 317 ms 26988 KB Output is correct
57 Correct 259 ms 26348 KB Output is correct
58 Correct 271 ms 26476 KB Output is correct
59 Correct 254 ms 26604 KB Output is correct
60 Correct 259 ms 24864 KB Output is correct
61 Correct 262 ms 26476 KB Output is correct
62 Correct 264 ms 26220 KB Output is correct
63 Correct 272 ms 26476 KB Output is correct
64 Correct 263 ms 25648 KB Output is correct
65 Correct 288 ms 26564 KB Output is correct