oj.uz

답안 #639457

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
639457 2022-09-10T02:22:05 Z BossBobster parentrises (BOI18_parentrises) C++17
50 / 100
 32 ms 10216 KB 
#include <iostream>
#include <string.h>
#include <random>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <iomanip>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <vector>
#include <stack>
#include <queue>
#include <array>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <complex>
#include <valarray>
#include <memory>
#include <cassert>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef pair<int, int> pii;
typedef pair<int, string> pis;
typedef pair<int, short> pish;
typedef pair<string, string> pss;
typedef pair<int, char> pic;
typedef pair<pii, int> piii;
typedef pair<double, double> pdd;
typedef pair<float, float> pff;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef unsigned short ushort;
typedef pair<uint, uint> puint;
typedef pair<ll, ll> pll;
typedef pair<pll, ll> plll;
typedef pair<pll, ld> plld;
typedef pair<int, ll> pil;
typedef pair<ull, ull> pull;
typedef pair<ld, ld> pld;
typedef complex<double> cd;
//#define max(n, m) ((n>m)?n:m)
//#define min(n, m) ((n<m)?n:m)
#define f first
#define s second
#define input() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define eps 1e-9
#define leni(x) sizeof(x)/sizeof(int)
//#define cin fin
//#define cout fout

int nums[1000010];
int pre;
char col[1000010];
queue<int> cur;
int main()
{
    input();
    int p, t, n;
    string st;
    cin >> p >> t;
    if(p == 1)
    {
        while(t--)
        {
            cin >> st;
            n = (int)st.length();
            for(int i = 0; i < n; i ++)
                nums[i] = (st[i]=='(')?1:-1;
            pre = 0;
            //if prefix becomes < 0, remove two ')' from the beginning
            //if prefix ends up positive in the end, remove '(' from the end
            bool bad = false;
            while(cur.size())
                cur.pop();
            for(int i = 0; i < n; i ++)
                col[i] = 'G';
            for(int i = 0; i < n; i ++)
            {
                if(nums[i] == -1)
                {
                    cur.push(i);
                    pre --;
                    if(pre == -1)
                    {
                        if(cur.size() < 2) { bad = true; break; }
                        int a = cur.front(); cur.pop(); int b = cur.front(); cur.pop();
                        col[a] = 'R'; col[b] = 'B';
                        pre = 0;
                    }
                }
                else pre ++;
            }
            if(nums[n-1] == 1 || bad)
            {
                cout << "impossible\n";
                continue;
            }
            if(pre > 0)
            {
                int num = pre*2;
                char c = 'R';
                for(int i = n-1; i >= 0; i --)
                {
                    if(num == 0) break;
                    if(nums[i] == 1)
                    {
                        col[i] = c;
                        c = ((c=='R')?'B':'R');
                        num --;
                    }
                }
                if(num)
                {
                    cout << "impossible\n";
                    continue;
                }
            }
            pre = 0;
            for(int i = 0; i < n; i ++)
            {
                pre += nums[i]*((col[i]=='G')?2:1);
                if(pre < 0)
                {
                    bad = true;
                    break;
                }
            }
            if(pre > 0 || bad)
            {
                cout << "impossible\n";
                continue;
            }
            for(int i = 0; i < n; i ++)
                cout << col[i];
            cout << '\n';
        }
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 4 ms 1232 KB Output is correct
18 Correct 3 ms 596 KB Output is correct
19 Correct 3 ms 852 KB Output is correct
20 Correct 4 ms 1324 KB Output is correct
21 Correct 17 ms 2052 KB Output is correct
22 Correct 31 ms 10216 KB Output is correct
23 Correct 22 ms 2756 KB Output is correct
24 Correct 26 ms 6128 KB Output is correct
25 Correct 32 ms 10212 KB Output is correct

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -