Submission #59749

#	Time	Username	Problem	Language	Result	Execution time	Memory
59749		model_code	parentrises (BOI18_parentrises)	C++17	22 / 100	250 ms	134408 KiB

parentrises

#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 1000;

bitset<kMaxN + 1> dp[kMaxN + 1][kMaxN + 1];

string SolveTest(string s) {
    dp[0][0].set(0);
    int id = 0;
    for (auto ch : s) {
        for (int i = 0; i <= id + 1; ++i) {
            dp[id + 1][i].reset();
        }
        if (ch == '(') {
            for (int i = 0; i <= id; ++i) {
                dp[id + 1][i + 1] |= dp[id][i] << 1;
                dp[id + 1][i + 1] |= dp[id][i];
                dp[id + 1][i]     |= dp[id][i] << 1;
            }
        } else {
            for (int i = 1; i <= id; ++i) {
                dp[id + 1][i - 1] |= dp[id][i] >> 1;
                dp[id + 1][i - 1] |= dp[id][i];
                dp[id + 1][i]     |= dp[id][i] >> 1;
            }
        }
        ++id;
    }  
    
    if (not dp[id][0].test(0)) {
        return "impossible";
    }
    
    int x = 0, y = 0;
    string result = "";
    for (int i = id - 1; i >= 0; --i) {
        const int sign = (s[i] == ')') ? +1 : -1;
        if (x + sign >= 0 and dp[i][x + sign].test(y)) {
            x += sign;
            result += "R";
        } else if (y + sign >= 0 and dp[i][x].test(y + sign)) {
            y += sign;
            result += "B";
        } else {
            x += sign;
            y += sign;
            result += "G";
        }
    }
    reverse(result.begin(), result.end());
    return result;
}

int main() {
    int type, num_tests; cin >> type >> num_tests;
    if (type == 2) {
	return 0;
    }

    while (num_tests--> 0) {
        string s; cin >> s;
        cout << SolveTest(s) << '\n';
    }
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 11 / 11
• Subtask 3: 6 / 6
• Subtask 4: 0 / 28
• Subtask 5: 0 / 6
• Subtask 6: 0 / 16
• Subtask 7: 0 / 28