Submission #900692

#	Time	Username	Problem	Language	Result	Execution time	Memory
900692		stefanneagu	건물 4 (JOI20_building4)	C++17	100 / 100	596 ms	45624 KiB

building4

// ce mai de cacat scoala : Un respectabil domn profesor de la scoala pe care o iubeste insane de mult metehau suge pula

#include <bits/stdc++.h>
#warning Un respectabil domn profesor de la scoala pe care o iubeste metehau suge pula

using namespace std;

const int nmax = 1e6 + 1;

int mat[nmax][2], ma[nmax][2], mi[nmax][2];

int main() {
  int n;
  cin >> n;
  for(int i = 0; i < 2; i ++) {
    for(int j = 0; j < 2 * n; j ++) {
      cin >> mat[j][i];
    }
  }
  mi[0][1] = 1, ma[0][1] = 1;
  for(int i = 1; i < 2 * n; i ++) {
    for(int j = 0; j < 2; j ++) {
      mi[i][j] = 1e9, ma[i][j] = -1e9;
      for(int k = 0; k < 2; k ++) {
        if(mi[i - 1][k] <= ma[i - 1][k] && mat[i][j] >= mat[i - 1][k]) {
          mi[i][j] = min(mi[i][j], mi[i - 1][k] + j);
          ma[i][j] = max(ma[i][j], ma[i - 1][k] + j);
        }
        //cout << mi[i][j] << " " << ma[i][j] << endl;
      }
    }
  }
   int i = 2 * n - 1, j;
    if (mi[2 * n - 1][0] <= n && n <= ma[2 * n - 1][0]) {
        j = 0;
    } else if (mi[2 * n - 1][1] <= n && n <= ma[2 * n - 1][1]) {
        j = 1;
    } else {
        cout << -1 << "\n";
        exit(0);
    }

    string ans;
    while (i >= 0) {
        ans.push_back(j == 0 ? 'A' : 'B');
        n -= j, --i;
        j = mi[i][1] <= n && n <= ma[i][1] && mat[i][1] <= mat[i + 1][j];
    }
    reverse(ans.begin(), ans.end());

    cout << ans << "\n";
  return 0;
}

Compilation message (stderr)

building4.cpp:4:2: warning: #warning Un respectabil domn profesor de la scoala pe care o iubeste metehau suge pula [-Wcpp]
    4 | #warning Un respectabil domn profesor de la scoala pe care o iubeste metehau suge pula
      |  ^~~~~~~

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