oj.uz

Submission #139216

# Submission time Handle Problem Language Result Execution time Memory
139216 2019-07-31T12:18:15 Z mlyean00 parentrises (BOI18_parentrises) C++17
56 / 100
 1000 ms 4272 KB 
#ifdef DEBUG
#include "debug.hpp"
#else
#pragma GCC optimize("Ofast")
#define trace(...)
#include <bits/stdc++.h>
#define endl '\n'
#endif

using namespace std;

const int MOD = 1'000'000'007;

string rgb_string(string const& s) {
    int n = s.length();
    vector<bool> red(n), blue(n);

    {
        stack<int> st;
        for (int i = 0; i < n; ++i) {
            if (s[i] == '(') {
                st.push(i);
            } else if (s[i] == ')') {
                if (!st.empty()) {
                    red[i] = true;
                    red[st.top()] = true;
                    st.pop();
                }
            }
        }
    }
    bool possible = true;
    {
        stack<int> st_red, st_blue;
        for (int i = 0; i < n; ++i) {
            if (s[i] == '(') {
                if (red[i]) {
                    st_red.push(i);
                } else {
                    st_blue.push(i);
                }
            } else if (s[i] == ')') {
                if (red[i]) {
                    if (!st_blue.empty()) {
                        blue[i] = true;
                        blue[st_blue.top()] = true;
                        st_blue.pop();
                    }
                } else {
                    if (st_red.empty())
                        possible = false;
                    else {
                        blue[i] = true;
                        blue[st_red.top()] = true;
                        st_red.pop();
                    }
                }
            }
            if (!possible) break;
        }
    }

    string ans;
    for (int i = 0; i < n; ++i) {
        if (red[i] && blue[i]) {
            ans.push_back('G');
        } else if (red[i]) {
            ans.push_back('R');
        } else if (blue[i]) {
            ans.push_back('B');
        } else {
            possible = false;
        }
    }
    return possible ? ans : "";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int p, t;
    cin >> p >> t;
    if (p == 1) {
        while (t--) {
            string s;
            cin >> s;

            string ans = rgb_string(s);
            cout << (ans.empty() ? "impossible" : ans) << endl;
        }
    } else if (p == 2) {
        while (t--) {
            int n;
            cin >> n;

            int ans = 0;
            for (int i = 0; i < 1 << n; ++i) {
                string s(n, '(');
                for (int j = 0; j < n; ++j) {
                    if ((i >> j) & 1) s[j] = ')';
                }
                if (!rgb_string(s).empty()) ++ans;
            }
            cout << ans << endl;
        }
    }

    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 504 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 10 ms 504 KB Output is correct
17 Correct 5 ms 888 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 5 ms 632 KB Output is correct
20 Correct 5 ms 888 KB Output is correct
21 Correct 70 ms 1144 KB Output is correct
22 Correct 40 ms 4272 KB Output is correct
23 Correct 29 ms 1472 KB Output is correct
24 Correct 34 ms 2320 KB Output is correct
25 Correct 38 ms 4268 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 372 KB Output is correct

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 372 KB Output is correct
2 Execution timed out 1053 ms 424 KB Time limit exceeded

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 372 KB Output is correct
2 Execution timed out 1053 ms 424 KB Time limit exceeded