oj.uz

Submission #412864

# Submission time Handle Problem Language Result Execution time Memory
412864 2021-05-27T17:34:04 Z MasterTaster parentrises (BOI18_parentrises) C++14
16 / 100
 1000 ms 250020 KB 
#include <bits/stdc++.h>

#define pb push_back
#define ll long long
#define pii pair<int, int>
#define xx first
#define yy second
#define MAXN 1006

using namespace std;

int n, a[MAXN];
bool dp[MAXN][505][505];

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);

    //cout<<__builtin_popcount(4)<<endl;

    int p; cin>>p;

    if (p==1)
    {
        int t; cin>>t;
        while (t--)
        {
            vector<char> ress;
            string s; cin>>s;
            n=s.size();
            for (int i=0; i<n; i++) if (s[i]=='(') a[i]=1; else a[i]=-1;

            for (int i=0; i<n; i++) for (int j=0; j<n; j++) for (int k=0; k<n; k++) dp[i][j][k]=0;

            ///prvi-R, G
            ///drugi-B, G

            if (a[0]==-1) { cout<<"impossible"<<endl; continue; }
            if (a[n-1]==1) { cout<<"impossible"<<endl; continue; }

            dp[0][1][0]=1;
            dp[0][1][1]=1;
            dp[0][0][1]=1;
            for (int i=1; i<n; i++)
            {
                for (int j=0; j<(n/2); j++)
                {
                    for (int k=0; k<(n/2); k++)
                    {
                        //cout<<dp[i][j][k]<<" "<<a[i]<<endl;
                        ///ako bojim u R
                        if (j-a[i]>=0 && j-a[i]<(n/2)) dp[i][j][k]=max(dp[i][j][k], dp[i-1][j-a[i]][k]);
                        ///ako bojim u B
                        if (k-a[i]>=0 && k-a[i]<(n/2)) dp[i][j][k]=max(dp[i][j][k], dp[i-1][j][k-a[i]]);
                        ///ako bojim u G
                        if (j-a[i]>=0 && j-a[i]<(n/2) && k-a[i]>=0 && k-a[i]<(n/2)) dp[i][j][k]=max(dp[i][j][k], dp[i-1][j-a[i]][k-a[i]]);

                        //cout<<i<<" "<<j<<" "<<k<<" "<<dp[i][j][k]<<endl;
                    }
                }
            }
            if (dp[n-1][0][0]==0) { cout<<"impossible"<<endl; continue; }


            int i=n-1, j=0, k=0;
            while (i>=0)
            {
                if (i==0) { if (j==1 && k==1) ress.pb('G'); else if (j==1) ress.pb('R'); else ress.pb('B'); break; }
                if (dp[i-1][j-a[i]][k]) { ress.pb('R'); j-=a[i]; }
                else if (dp[i-1][j][k-a[i]]) { ress.pb('B'); k-=a[i]; }
                else { ress.pb('G'); j-=a[i]; k-=a[i]; }
                i--;
            }
            reverse(ress.begin(), ress.end());
            for (int i=0; i<ress.size(); i++) cout<<ress[i];
            cout<<endl;
        }
    }
}
/*
1
3
())(()
()(()
()))
*/

Compilation message

parentrises.cpp: In function 'int main()':
parentrises.cpp:74:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |             for (int i=0; i<ress.size(); i++) cout<<ress[i];
      |                           ~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3788 KB Output is correct
2 Correct 4 ms 5588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 2 ms 1740 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct

Subtask #3
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3788 KB Output is correct
2 Correct 4 ms 5588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 2 ms 1740 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 106 ms 200092 KB Output is correct
7 Execution timed out 1084 ms 250020 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #4
0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3788 KB Output is correct
2 Correct 4 ms 5588 KB Output is correct
3 Correct 1 ms 588 KB Output is correct
4 Correct 2 ms 1740 KB Output is correct
5 Correct 4 ms 5580 KB Output is correct
6 Correct 106 ms 200092 KB Output is correct
7 Execution timed out 1084 ms 250020 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected

Subtask #7
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Unexpected end of file - int32 expected