oj.uz

Submission #250366

# Submission time Handle Problem Language Result Execution time Memory
250366 2020-07-17T15:08:36 Z dolphingarlic Match (CEOI16_match) C++14
100 / 100
 17 ms 11648 KB 
#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

string s;
int n, opt[100000][26];
char ans[100000];

void solve(int l = 0, int r = n - 1) {
    if (l > r) return;
    ans[l] = '(';
    ans[opt[r][s[l] - 'a']] = ')';
    solve(l + 1, opt[r][s[l] - 'a'] - 1);
    solve(opt[r][s[l] - 'a'] + 1, r);
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> s;
    n = s.size();
    stack<char> stck;
    FOR(i, 0, n) {
        if (stck.size() && s[i] == stck.top()) stck.pop();
        else stck.push(s[i]);
        FOR(j, 0, 26) {
            if (j == s[i] - 'a') opt[i][j] = i;
            else if (i && opt[i - 1][s[i] - 'a'])
                opt[i][j] = opt[opt[i - 1][s[i] - 'a'] - 1][j];
            else opt[i][j] = -1;
        }
    }
    if (stck.size()) return cout << -1, 0;
    solve();
    FOR(i, 0, n) cout << ans[i];
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

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

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 2 ms 1024 KB Output is correct
9 Correct 2 ms 1152 KB Output is correct
10 Correct 2 ms 1152 KB Output is correct
11 Correct 2 ms 1152 KB Output is correct
12 Correct 11 ms 7168 KB Output is correct
13 Correct 11 ms 7808 KB Output is correct
14 Correct 12 ms 8512 KB Output is correct
15 Correct 12 ms 9728 KB Output is correct
16 Correct 12 ms 9856 KB Output is correct
17 Correct 13 ms 10368 KB Output is correct
18 Correct 15 ms 10240 KB Output is correct
19 Correct 16 ms 11008 KB Output is correct
20 Correct 10 ms 7296 KB Output is correct
21 Correct 17 ms 11648 KB Output is correct