제출 #1204167

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204167		avighna	건물 4 (JOI20_building4)	C++20	11 / 100	109 ms	23880 KiB

building4

#include <bits/stdc++.h>

const int N = 2000;

bool dp[2 * N + 1][N + 1][3];

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(nullptr);

  const int inf = 1e9 + 1;

  int n;
  std::cin >> n;
  std::vector<int> a(2 * n), b(2 * n);
  for (auto &i : a) {
    std::cin >> i;
  }
  for (auto &i : b) {
    std::cin >> i;
  }
  a.push_back(inf), b.push_back(inf);

  // std::vector dp(2 * n + 1, std::vector(n + 1, std::vector<bool>(3)));
  dp[2 * n][n][0] = dp[2 * n][n][1] = dp[2 * n][n][2] = true;
  for (int i = 2 * n - 1; i >= 0; --i) {
    for (int j = 0; j <= n; ++j) {
      for (int k = 0; k < 3; ++k) {
        dp[i][j][k] = false;
        int a_o = a[i], b_o = b[i];
        if (k == 1) {
          b[i] = inf + 1;
        }
        if (k == 2) {
          a[i] = inf + 1;
        }
        if (j == n) {
          dp[i][n][k] = b[i] <= b[i + 1] and dp[i + 1][n][k];
        } else {
          if (a[i] <= a[i + 1] and a[i] <= b[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j + 1][0];
          }
          if (a[i] <= a[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j + 1][1];
          }
          if (a[i] <= b[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j + 1][2];
          }
          if (b[i] <= a[i + 1] and b[i] <= b[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j][0];
          }
          if (b[i] <= a[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j][1];
          }
          if (b[i] <= b[i + 1]) {
            dp[i][j][k] = dp[i][j][k] or dp[i + 1][j][2];
          }
        }
        a[i] = a_o, b[i] = b_o;
      }
    }
  }

  if (!dp[0][0][0]) {
    std::cout << "-1\n";
    return 0;
  }
  std::string ans;
  for (int i = 0, j = 0, k = 0; i < 2 * n; ++i) {
    int a_o = a[i], b_o = b[i];
    if (k == 1) {
      b[i] = inf + 1;
    }
    if (k == 2) {
      a[i] = inf + 1;
    }
    if (j == n) {
      ans.push_back('B');
    } else if (a[i] <= a[i + 1] and a[i] <= b[i + 1] and dp[i + 1][j + 1][0]) {
      ans.push_back('A');
      j++, k = 0;
    } else if (a[i] <= a[i + 1] and dp[i + 1][j + 1][1]) {
      ans.push_back('A');
      j++, k = 1;
    } else if (a[i] <= b[i + 1] and dp[i + 1][j + 1][2]) {
      ans.push_back('A');
      j++, k = 2;
    } else if (b[i] <= a[i + 1] and dp[i + 1][j][0]) {
      ans.push_back('B');
      k = 0;
    } else if (b[i] <= a[i + 1] and dp[i + 1][j][1]) {
      ans.push_back('B');
      k = 1;
    } else if (b[i] <= b[i + 1] and dp[i + 1][j][2]) {
      ans.push_back('B');
      k = 2;
    }
    a[i] = a_o, b[i] = b_o;
  }
  std::cout << ans << '\n';
}

• Subtask 1: 11 / 11
• Subtask 2: 0 / 89