oj.uz

답안 #64227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
64227 2018-08-03T14:08:46 Z antimirage parentrises (BOI18_parentrises) C++17
50 / 100
 135 ms 19244 KB 
#include <iostream>
#include <assert.h>
#include <stdio.h>
#include <iomanip>
#include <utility>
#include <string.h>
#include <random>
#include <math.h>
#include <time.h>
#include <vector>
#include <set>
#include <map>
#include <algorithm>

#define fr first
#define sc second
#define mk make_pair
#define pb push_back
#define sz(s) (int)s.size()
#define all(s) s.begin(), s.end()

using namespace std;

const int N = 1e6 + 5;

int type, tests, pref[2][N], n, mn[2], bal1, bal2, sum[2][N], bal;

char s[N], ans[N];

bool fl;

main()
{
    cin >> type >> tests;
    while (tests--)
    {
        fl = false;
        bal = 0;
        scanf("%s", s + 1);

        n = strlen(s + 1);

        if (s[n] == '(')
                fl = 1;

        for (int i = 1; i <= n; i++)
        {
            pref[0][i] = pref[1][i] = 0;
            sum[0][i] = sum[1][i] = 0;
            if ( s[i] == '(' )
                pref[0][i] = 1, pref[1][i] = 1, ans[i] = 'G', bal += 2;
            else
            {
                if (pref[0][i - 1] > pref[1][i - 1])
                    ans[i] = 'R', pref[0][i] = -1;
                else
                    ans[i] = 'B', pref[1][i] = -1;

                bal--;
            }
            pref[0][i] += pref[0][i - 1];
            pref[1][i] += pref[1][i - 1];

            if (bal < 0)
                fl = 1;
        }
        bal1 = pref[0][n];
        bal2 = pref[1][n];
        mn[0] = mn[1] = 1e9 + 7;

        for (int i = n; i >= 1; i--)
        {
            mn[0] = min( mn[0], pref[0][i] );
            mn[1] = min( mn[1], pref[1][i] );
            if ( ans[i] == 'R' && mn[1] > 0 )
            {
                sum[1][i] = -1;
                ans[i] = 'G';
                mn[1]--;
                bal2--;
            }
            if ( ans[i] == 'B' && mn[0] > 0)
            {
                sum[0][i] = -1;
                ans[i] = 'G';
                mn[0]--;
                bal1--;
            }
        }
        for (int i = 1; i <= n; i++)
        {
            sum[0][i] += sum[0][i - 1];
            sum[1][i] += sum[1][i - 1];
            pref[0][i] += sum[0][i];
            pref[1][i] += sum[1][i];
        }
        mn[0] = mn[1] = 1e9 + 7;

        for (int i = n; i >= 1; i--)
        {
            mn[0] = min( mn[0], pref[0][i] );
            mn[1] = min( mn[1], pref[1][i] );
            if (s[i] == ')') continue;
            if (mn[0] > 0 && bal1 > bal2)
            {
                ans[i] = 'B';
                mn[0]--;
                bal1--;
            }
            else if (mn[1] > 0)
            {
                ans[i] = 'R';
                mn[1]--;
                bal2--;
            }
        }
        if (bal < 0 || bal > n) fl = 1;

        reverse(s + 1, s + n + 1);

        bal = 0;

        for (int i = 1; i <= n; i++)
        {
            if ( s[i] == '(' )
                bal--;
            else
                bal += 2;

            if (bal < 0)
                fl = 1;
        }
        if (bal < 0 || bal > n) fl = 1;

        if (fl)
            puts("impossible");
        else
        {
            for (int i = 1; i <= n; i++)
                printf("%c", ans[i]);
            printf("\n");
        }
    }
}

Compilation message

parentrises.cpp:32:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main()
      ^
parentrises.cpp: In function 'int main()':
parentrises.cpp:39:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", s + 1);
         ~~~~~^~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
11.0 / 11.0

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

Subtask #3
6.0 / 6.0

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

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 712 KB Output is correct
2 Correct 3 ms 712 KB Output is correct
3 Correct 2 ms 712 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 720 KB Output is correct
6 Correct 3 ms 720 KB Output is correct
7 Correct 2 ms 720 KB Output is correct
8 Correct 3 ms 720 KB Output is correct
9 Correct 3 ms 720 KB Output is correct
10 Correct 3 ms 720 KB Output is correct
11 Correct 4 ms 744 KB Output is correct
12 Correct 4 ms 744 KB Output is correct
13 Correct 5 ms 744 KB Output is correct
14 Correct 3 ms 744 KB Output is correct
15 Correct 4 ms 780 KB Output is correct
16 Correct 9 ms 780 KB Output is correct
17 Correct 15 ms 2460 KB Output is correct
18 Correct 9 ms 2460 KB Output is correct
19 Correct 11 ms 2460 KB Output is correct
20 Correct 13 ms 2516 KB Output is correct
21 Correct 59 ms 2516 KB Output is correct
22 Correct 135 ms 19244 KB Output is correct
23 Correct 73 ms 19244 KB Output is correct
24 Correct 94 ms 19244 KB Output is correct
25 Correct 103 ms 19244 KB Output is correct

Subtask #5
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 19244 KB Expected integer, but "impossible" found

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 19244 KB Expected integer, but "impossible" found

Subtask #7
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 19244 KB Expected integer, but "impossible" found