oj.uz

Submission #566537

# Submission time Handle Problem Language Result Execution time Memory
566537 2022-05-22T11:37:05 Z Redhood Match (CEOI16_match) C++14
100 / 100
 16 ms 12372 KB 
#include <bits/stdc++.h>

using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()

typedef long long ll;
typedef long double ld;

const int N = (int)1e5 + 10;
string s;
int bst[N][26];
int n;
string answer;
bool bad = 0;
void solve(int l , int r){
    if(l > r)
        return;
    answer[l] = '(';
    int x;
    if(s[l] == s[r])
        x = r;
    else
        x = bst[r][s[l]-'a'];
    if(x == -1 || x < l){
        bad = 1;
        return;
    }
    answer[x] = ')';
    solve(l + 1 , x - 1);
    solve(x + 1 , r);
}
int main()
{
    ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0);
    cin >> s;
    /// unique problem guys
    n = s.size();
    answer = string(n, 'x');
    for(int t=0;t<n;++t){
        for(int tt=0;tt<26;++tt)
            bst[t][tt]=-1;
    }
    for(int i = 1 ; i < n; ++i){
        for(int j = 0; j < 26; ++j){
            int x;
            if(s[i - 1] == s[i]){
                x = i-1;
            }else{
                x = bst[i - 1][s[i]-'a'];
            }
            if(x == -1)
                continue;
            assert(s[x] == s[i]);
            if(x - 1 >= 0 && s[x - 1]-'a' == j){
                bst[i][j] = x - 1;
            }else if(x - 1 >= 0){
                bst[i][j] = bst[x - 1][j];
            }
        }
    }
    /// abbaaa
//    cerr << " damn \n";
//    cout << bst[2][0] << endl;



    solve(0 , n - 1);


//    cout << "lol " << answer << endl;

    if(bad)
        cout << -1 << '\n';
    else
        cout << answer << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 1 ms 468 KB Output is correct
8 Correct 1 ms 980 KB Output is correct
9 Correct 2 ms 1108 KB Output is correct
10 Correct 1 ms 1108 KB Output is correct
11 Correct 1 ms 1232 KB Output is correct
12 Correct 10 ms 7648 KB Output is correct
13 Correct 10 ms 8276 KB Output is correct
14 Correct 10 ms 9172 KB Output is correct
15 Correct 12 ms 10808 KB Output is correct
16 Correct 12 ms 10716 KB Output is correct
17 Correct 11 ms 11328 KB Output is correct
18 Correct 12 ms 10564 KB Output is correct
19 Correct 13 ms 11592 KB Output is correct
20 Correct 9 ms 7824 KB Output is correct
21 Correct 16 ms 12372 KB Output is correct