oj.uz

Submission #139206

# Submission time Handle Problem Language Result Execution time Memory
139206 2019-07-31T11:42:06 Z mlyean00 parentrises (BOI18_parentrises) C++17
50 / 100
 69 ms 4740 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;

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;

            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;
                }
            }
            if (possible) {
                cout << ans;
            } else {
                cout << "impossible";
            }
            cout << endl;
        }
    } else if (p == 2) {
        assert(false);
    }

    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 376 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 376 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 376 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 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 10 ms 504 KB Output is correct
17 Correct 6 ms 900 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 6 ms 632 KB Output is correct
20 Correct 6 ms 888 KB Output is correct
21 Correct 69 ms 2168 KB Output is correct
22 Correct 40 ms 4732 KB Output is correct
23 Correct 29 ms 2400 KB Output is correct
24 Correct 34 ms 2816 KB Output is correct
25 Correct 38 ms 4740 KB Output is correct

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Runtime error 3 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)