oj.uz

답안 #96610

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
96610 2019-02-10T12:56:28 Z josiftepe parentrises (BOI18_parentrises) C++14
50 / 100
 227 ms 111476 KB 
#include <bits/stdc++.h>

using namespace std;
int dp[305][305][305];
const int MOD = 1e9 + 7;
int rek(int at, int open, int closed){
    if(at == 0){
        if(closed == 0){
            return 1;
        }
        return 0;
    }
    if(dp[at][open][closed] != -1){
        return dp[at][open][closed];
    }
    int ret = 0;
    ret += rek(at - 1, open + 2, closed + 1);
    if(open > 0){
        ret += rek(at - 1, open - 1, max(closed - 2, 0));
    }
    return dp[at][open][closed] = ret % MOD;
}
void solve(string s){
    string ret = s;
    for(int i = 0; i < s.size(); i ++){
        ret[i] = '?';
    }
    stack<int> st1, st2;
    for(int i = 0; i < (int)s.size(); i ++){
        if(s[i] == '('){
            st1.push(i);
            st2.push(i);
        }
        else{
            if(!st1.empty()){
                ret[st1.top()] = 'G';
                ret[i] = 'R';
                st1.pop();
            }
            else if(!st2.empty()){
                ret[i] = 'B';
                st2.pop();
            }
            else{
                cout << "impossible\n";
                return;
            }
        }

    }

    queue<int> q;
    for(int i = (int)s.size() - 1; i >= 0; i --){
        if(s[i] == ')'){
            q.push(i);
        }
        else{
           if(!q.empty() and st2.top() == i){
                ret[i] = 'B';
                st2.pop();
                q.pop();
           }
           else {
                ret[i] = 'G';
           }
        }

    }
    cout << ret << endl;
}
int main()
{
    ios_base::sync_with_stdio(false);
    int t_case;
    cin >> t_case;
    if(t_case == 1){
        int t;
        cin >> t;
        string s;
        while(t --){
            cin >> s;
            solve(s);
        }

    }
    else if(t_case == 2){
        int t;
        cin >> t;
        memset(dp, -1, sizeof dp);
        while(t --){
            int n;
            cin >> n;
            cout << rek(n, 0, 0) << endl;
        }
    }
    return 0;
}

Compilation message

parentrises.cpp: In function 'void solve(std::__cxx11::string)':
parentrises.cpp:25:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < s.size(); i ++){
                    ~~^~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 5 ms 504 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 111352 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 111352 KB Output is correct
2 Correct 87 ms 111440 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 76 ms 111352 KB Output is correct
2 Correct 87 ms 111440 KB Output is correct
3 Correct 227 ms 111476 KB Output is correct