oj.uz

Submission #954757

# Submission time Handle Problem Language Result Execution time Memory
954757 2024-03-28T13:54:13 Z abczz Building 4 (JOI20_building4) C++14
100 / 100
 695 ms 122008 KB 
#include <iostream>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#define ll long long
#define ld long double

using namespace std;

bool visited[1000000][2], X[1000000][2], B[1000000];
string S;
vector <array<ll, 2>> V, R;
ll n, s, k, p, x, mn, mx, A[1000000][2], cnt[1000000];
void dfs(ll u, ll x) {
  visited[u][x] = 1;
  if (u == n-1) {
    X[u][x] = 1;
    return;
  }
  if (A[u][x] <= A[u+1][0]) {
    if (!visited[u+1][0]) dfs(u+1, 0);
    X[u][x] |= X[u+1][0];
  }
  if (A[u][x] <= A[u+1][1]) {
    if (!visited[u+1][1]) dfs(u+1, 1);
    X[u][x] |= X[u+1][1];
  }
}
int main() {
  cin >> n;
  n *= 2;
  for (int j=0; j<2; ++j) {
    for (int i=0; i<n; ++i) cin >> A[i][j];
  }
  dfs(0, 0);
  dfs(0, 1);
  if (!X[0][0] && !X[0][1]) {
    cout << "-1\n";
    return 0;
  }
  for (int i=0; i<n; ++i) {
    S += '.';
    cnt[i] = X[i][0] + X[i][1];
    if (cnt[i] == 1) {
      if (X[i][0]) {
        S.back() = 'A';
        ++s;
      }
      else {
        S.back() = 'B';
        --s;
      }
    }
  }
  k = 0, p = 1e18;
  for (ll i=0; i+1<n; ++i) {
    if (cnt[i] == 1 || cnt[i+1] == 1 || max(A[i][0], A[i][1]) <= min(A[i+1][0], A[i+1][1])) {
      if (p != 1e18) {
        if (A[i][0] > A[i][1]) ++k;
        else --k;
        mn = mx = k;
        for (int j=p; j<=i; ++j) {
          B[j] = 1;
          if (A[j][0] > A[j][1]) k -= 2;
          else k += 2;
          mn = min(mn, k);
          mx = max(mx, k);
        }
        R.push_back({p, i});
        V.push_back({mn, mx});
        k = 0, p = 1e18;
      }
      continue;
    }
    p = min(p, i);
    if (A[i][0] > A[i][1]) ++k;
    else --k;
  }
  if (p != 1e18) {
    if (A[n-1][0] > A[n-1][1]) ++k;
    else --k;
    mn = mx = k;
    for (int j=p; j<n; ++j) {
      B[j] = 1;
      if (A[j][0] > A[j][1]) k -= 2;
      else k += 2;
      mn = min(mn, k);
      mx = max(mx, k);
    }
    R.push_back({p, n-1});
    V.push_back({mn, mx});
    k = 0, p = 1e18;
  }
  k = 0;
  for (int i=0; i<n; ++i) {
    if (cnt[i] == 2 && !B[i]) ++k;
  }
  for (auto [l, r] : V) {
    s += l;
  }
  for (auto &[l, r] : V) {
    while (s < 0 && l < r) {
      s += 2;
      l += 2;
    }
  }
  if (s + k < 0 || s - k > 0) {
    cout << "-1\n";
    return 0;
  }
  int i = 0;
  for (auto [l, r] : R) {
    x = 0;
    for (int j=l; j<=r; ++j) {
      if (A[j][0] > A[j][1]) {
        S[j] = 'A';
        ++x;
      }
      else {
        S[j] = 'B';
        --x;
      }
    }
    if (x == V[i][0]) {
      ++i;
      continue;
    }
    for (int j=l; j<=r; ++j) {
      if (A[j][0] > A[j][1]) {
        S[j] = 'B';
        x -= 2;
      }
      else {
        S[j] = 'A';
        x += 2;
      }
      if (x == V[i][0]) break;
    }
    ++i;
  }
  for (int i=0; i<n; ++i) {
    if (cnt[i] == 2 && !B[i]) {
      if (s <= 0) {
        ++s;
        S[i] = 'A';
      }
      else {
        --s;
        S[i] = 'B';
      }
    }
  }
  cout << S << '\n';
}

Compilation message

building4.cpp: In function 'int main()':
building4.cpp:99:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   99 |   for (auto [l, r] : V) {
      |             ^
building4.cpp:102:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  102 |   for (auto &[l, r] : V) {
      |              ^
building4.cpp:113:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  113 |   for (auto [l, r] : R) {
      |             ^

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 6 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6748 KB Output is correct
10 Correct 4 ms 6860 KB Output is correct
11 Correct 4 ms 6744 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6748 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 7256 KB Output is correct
16 Correct 4 ms 7000 KB Output is correct
17 Correct 4 ms 7004 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 3 ms 6860 KB Output is correct
23 Correct 3 ms 6864 KB Output is correct
24 Correct 4 ms 6744 KB Output is correct
25 Correct 3 ms 6748 KB Output is correct
26 Correct 3 ms 6864 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 3 ms 6748 KB Output is correct
29 Correct 3 ms 6744 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 4 ms 7260 KB Output is correct

Subtask #2
89.0 / 89.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 3 ms 6492 KB Output is correct
6 Correct 4 ms 6748 KB Output is correct
7 Correct 6 ms 6748 KB Output is correct
8 Correct 4 ms 6748 KB Output is correct
9 Correct 4 ms 6748 KB Output is correct
10 Correct 4 ms 6860 KB Output is correct
11 Correct 4 ms 6744 KB Output is correct
12 Correct 4 ms 6748 KB Output is correct
13 Correct 4 ms 6748 KB Output is correct
14 Correct 4 ms 6748 KB Output is correct
15 Correct 4 ms 7256 KB Output is correct
16 Correct 4 ms 7000 KB Output is correct
17 Correct 4 ms 7004 KB Output is correct
18 Correct 4 ms 6748 KB Output is correct
19 Correct 4 ms 6748 KB Output is correct
20 Correct 3 ms 6748 KB Output is correct
21 Correct 4 ms 6748 KB Output is correct
22 Correct 3 ms 6860 KB Output is correct
23 Correct 3 ms 6864 KB Output is correct
24 Correct 4 ms 6744 KB Output is correct
25 Correct 3 ms 6748 KB Output is correct
26 Correct 3 ms 6864 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 3 ms 6748 KB Output is correct
29 Correct 3 ms 6744 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 4 ms 7260 KB Output is correct
34 Correct 591 ms 39864 KB Output is correct
35 Correct 615 ms 106348 KB Output is correct
36 Correct 607 ms 105228 KB Output is correct
37 Correct 611 ms 106900 KB Output is correct
38 Correct 613 ms 106796 KB Output is correct
39 Correct 601 ms 114264 KB Output is correct
40 Correct 653 ms 119060 KB Output is correct
41 Correct 634 ms 108044 KB Output is correct
42 Correct 637 ms 110020 KB Output is correct
43 Correct 666 ms 112976 KB Output is correct
44 Correct 672 ms 112876 KB Output is correct
45 Correct 637 ms 112676 KB Output is correct
46 Correct 664 ms 112808 KB Output is correct
47 Correct 652 ms 122008 KB Output is correct
48 Correct 656 ms 120916 KB Output is correct
49 Correct 669 ms 120852 KB Output is correct
50 Correct 648 ms 111952 KB Output is correct
51 Correct 635 ms 111880 KB Output is correct
52 Correct 375 ms 101028 KB Output is correct
53 Correct 373 ms 100988 KB Output is correct
54 Correct 385 ms 100936 KB Output is correct
55 Correct 381 ms 100680 KB Output is correct
56 Correct 695 ms 113060 KB Output is correct
57 Correct 567 ms 107860 KB Output is correct
58 Correct 551 ms 108068 KB Output is correct
59 Correct 553 ms 107944 KB Output is correct
60 Correct 515 ms 103564 KB Output is correct
61 Correct 565 ms 108616 KB Output is correct
62 Correct 559 ms 107496 KB Output is correct
63 Correct 570 ms 108616 KB Output is correct
64 Correct 529 ms 105556 KB Output is correct
65 Correct 556 ms 108584 KB Output is correct