oj.uz

Submission #467625

# Submission time Handle Problem Language Result Execution time Memory
467625 2021-08-23T21:53:39 Z Bench0310 Match (CEOI16_match) C++17
100 / 100
 32 ms 27788 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string s;
    cin >> s;
    int n=s.size();
    s="$"+s;
    vector<array<int,26>> trie(1);
    trie[0].fill(-1);
    vector<int> p(1,-1);
    int id=0;
    int now=0;
    auto mv=[&](char c)
    {
        if(trie[now][c-'a']==-1)
        {
            trie[now][c-'a']=++id;
            trie.emplace_back();
            trie.back().fill(-1);
            p.push_back(now);
        }
        now=trie[now][c-'a'];
    };
    string t;
    vector<array<int,26>> mx(n+1);
    for(int i=0;i<=n;i++) mx[i].fill(-1);
    vector<array<int,26>> opt(n+1);
    for(int i=1;i<=n;i++)
    {
        if(t.empty()||t.back()!=s[i])
        {
            mv(s[i]);
            t+=s[i];
        }
        else
        {
            now=p[now];
            t.pop_back();
        }
        mx[now][s[i]-'a']=i;
        for(int j=0;j<26;j++) opt[i][j]=mx[now][j];
    }
    if(t.empty())
    {
        string res(n+1,'$');
        function<void(int,int)> go=[&](int l,int r)
        {
            if(l==r+1) return;
            res[l]='(';
            int m=opt[r][s[l]-'a'];
            res[m]=')';
            go(l+1,m-1);
            go(m+1,r);
        };
        go(1,n);
        cout << res.substr(1,n) << "\n";
    }
    else cout << "-1\n";
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 844 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 588 KB Output is correct
5 Correct 1 ms 588 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 844 KB Output is correct
8 Correct 2 ms 1928 KB Output is correct
9 Correct 2 ms 2308 KB Output is correct
10 Correct 2 ms 2276 KB Output is correct
11 Correct 2 ms 2336 KB Output is correct
12 Correct 18 ms 16832 KB Output is correct
13 Correct 20 ms 18308 KB Output is correct
14 Correct 19 ms 20088 KB Output is correct
15 Correct 21 ms 19068 KB Output is correct
16 Correct 17 ms 19068 KB Output is correct
17 Correct 21 ms 22356 KB Output is correct
18 Correct 19 ms 19968 KB Output is correct
19 Correct 26 ms 26832 KB Output is correct
20 Correct 16 ms 17288 KB Output is correct
21 Correct 32 ms 27788 KB Output is correct