oj.uz

Submission #69996

# Submission time Handle Problem Language Result Execution time Memory
69996 2018-08-22T08:12:23 Z 3zp parentrises (BOI18_parentrises) C++14
72 / 100
 208 ms 18936 KB 
#include<bits/stdc++.h>
using namespace std;
int f[2000009];
int dp[2][609][609];
int ans[309];
int mod = 1e9+7;
main(){
    int P;
    cin >> P;
    if(P == 1){
        int t;
        cin >> t;

        while(t--){
            string s, ans = "";
            cin >> s;
            int a = 0, b = 0, fl = 0;
            for(int i = 0; i < s.size(); i++){
                if(s[i] == '(') a++;
                else b++;
            }
            if(a > 2 * b || b > 2 * a){
                cout << "impossible"<<endl;
                continue;
            }
            if(a > b){
                fl = 1;
                swap(a, b);
                reverse(s.begin(), s.end());
                for(int i = 0; i < s.size(); i++)
                    if(s[i] == '(') s[i] = ')';
                else s[i] = '(';
            }
            int k =  b - a;
            vector<int> X, Y;
            for(int i = 0; i < s.size(); i++){
                f[i] = 0;
                if(s[i] == '(') X.push_back(i);

            else Y.push_back(i);
            }
            for(int i = 0; i < k; i++)
                f[X[i]] = 1;
            int x = k, y = Y.size()-1;
            int A = 0, B = 0;
            while(x < X.size() && y >= 0 && X[x] < Y[y])
                f[X[x]] = 1, f[Y[y]] = 1, x++, y--;
            for(int i = 0; i < s.size(); i++){
                if(s[i] == '('){

                    if(f[i]) A++,B++,ans+='G';
                    else if(A < B) A++,ans+='R';
                    else B++, ans += 'B';
                }
                else{
                    if(f[i]) A--,B--, ans+='G';
                    else {if(A > B) A--, ans+='R';
                    else B--,ans+='B';
                    }
                }
                if(A < 0 ||  B < 0) fl = 2;
            }
            if(fl == 2) cout <<"impossible"<<endl;
            else {if (fl) reverse(ans.begin(), ans.end());
            cout<<ans<<endl;}
        }
    }
    else{

        dp[0][0][0] = 1;
        for(int i = 0; i <= 299; i++){
            int d = i % 2;
            int d1 = (i + 1) %2;
            for(int l = 0; l <= 600; l++)
                for(int r = l; r <= 600; r++)
                    dp[d1][l][r] = 0;
            for(int l = 0; l <= 600; l++)
                for(int r = l; r <= 600; r++){
                    dp[d1][max(0, l-2)][r - 1] += dp[d][l][r];
                    dp[d1][l + 1][r + 2] += dp[d][l][r];
                    if(dp[d1][max(0, l - 2)][r - 1] >= mod)
                        dp[d1][max(0, l - 2)][r - 1] -= mod;
                    if(dp[d1][l + 1][r + 2] >= mod)
                        dp[d1][l + 1][r + 2] -= mod;
                }
            for(int j = 0;  j <= 600; j++)
                ans[i] = (ans[i] + dp[d][0][j])% mod;
        }
        int t;
        cin >> t;
        while(t--){
            int N;
            cin >> N;
            cout << ans[N]<<endl;
        }
    }
}

Compilation message

parentrises.cpp:7:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^
parentrises.cpp: In function 'int main()':
parentrises.cpp:18:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~
parentrises.cpp:30:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
                 for(int i = 0; i < s.size(); i++)
                                ~~^~~~~~~~~~
parentrises.cpp:36:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~
parentrises.cpp:46:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             while(x < X.size() && y >= 0 && X[x] < Y[y])
                   ~~^~~~~~~~~~
parentrises.cpp:48:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i = 0; i < s.size(); i++){
                            ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 724 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct

Subtask #4
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 468 KB Output is correct
2 Correct 2 ms 472 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 592 KB Output is correct
5 Correct 2 ms 724 KB Output is correct
6 Correct 3 ms 724 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 2 ms 724 KB Output is correct
11 Correct 5 ms 724 KB Output is correct
12 Correct 3 ms 784 KB Output is correct
13 Correct 3 ms 784 KB Output is correct
14 Correct 3 ms 784 KB Output is correct
15 Correct 3 ms 868 KB Output is correct
16 Correct 27 ms 1044 KB Output is correct
17 Correct 10 ms 2104 KB Output is correct
18 Correct 9 ms 2104 KB Output is correct
19 Correct 10 ms 2104 KB Output is correct
20 Correct 10 ms 2456 KB Output is correct
21 Correct 208 ms 3060 KB Output is correct
22 Correct 77 ms 15976 KB Output is correct
23 Correct 81 ms 15976 KB Output is correct
24 Correct 73 ms 15976 KB Output is correct
25 Correct 79 ms 18936 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 18936 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 18936 KB Output is correct
2 Correct 171 ms 18936 KB Output is correct

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 193 ms 18936 KB Output is correct
2 Correct 171 ms 18936 KB Output is correct
3 Incorrect 185 ms 18936 KB Output isn't correct