oj.uz

답안 #756981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756981 2023-06-12T12:00:58 Z Desh03 건물 4 (JOI20_building4) C++17
0 / 100
 2000 ms 596 KB 
#include <bits/stdc++.h>
using namespace std;

int n;
vector<int> A, B;
bool ok;
string ans, cur;

void recurse(int i, int last, int cntA, int cntB) {
    if (ok || max(cntA, cntB) > n) return;
    if (i == (n << 1)) {
        ok = true;
        ans = cur;
        return;
    }
    if (A[i] >= last) {
        cur.push_back('A');
        recurse(i + 1, A[i], cntA + 1, cntB);
        cur.pop_back();
    }
    if (B[i] >= last) {
        cur.push_back('B');
        recurse(i + 1, B[i], cntA, cntB + 1);
        cur.pop_back();
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n;
    A.resize(n << 1), B.resize(n << 1);
    for (int i = 0; i < (n << 1); i++) cin >> A[i];
    for (int i = 0; i < (n << 1); i++) cin >> B[i];
    recurse(0, -1, 0, 0);
    if (ok) {
        cout << ans << '\n';
    } else {
        cout << "-1\n";
    }
}

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Execution timed out 2057 ms 540 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #2
0 / 89.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 3 ms 596 KB Output is correct
7 Correct 2 ms 596 KB Output is correct
8 Execution timed out 2057 ms 540 KB Time limit exceeded
9 Halted 0 ms 0 KB -