oj.uz

Submission #116849

# Submission time Handle Problem Language Result Execution time Memory
116849 2019-06-14T02:42:37 Z minhtung0404 Match (CEOI16_match) C++17
10 / 100
 2000 ms 384 KB 
//https://oj.uz/problem/view/CEOI16_match

#include<bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;

string s, x;
int n, nxt[N][26], f[N];

void solve(int l, int r){
    if (l > r) return;
    x[l] = '(';
    int mat = nxt[r][s[l] - 'a'];
    x[mat] = ')';
    solve(l+1, mat-1); solve(mat+1, r);
}

int main(){
    cin >> s;
    n = s.size();
    for (int i = 0; i < n; i++){
        if (i > 0 && s[i-1] == s[i]) f[i] = i-1;
        else {
            if (i == 0) f[i] = -1;
            else f[i] = nxt[i-1][s[i] - 'a'];
        }
        for (int j = 0; j < 26; j++){
            if (f[i] > 0) {
                if (s[i]-'a' != j) nxt[i][j] = nxt[f[i]-1][j];
                else nxt[i][j] = i;
            }
            else nxt[i][j] = -1;
        }
    }
    stack <int> ms;
    for (int i = 0; i < n; i++){
        if (ms.size() && ms.top() == s[i] - 'a') ms.pop();
        else ms.push(s[i] - 'a');
    }
    if (ms.size()) return cout << -1, 0;
    x = s;
    solve(0, n-1);
    cout << x;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Execution timed out 2054 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Execution timed out 2054 ms 384 KB Time limit exceeded
5 Halted 0 ms 0 KB -