oj.uz

Submission #230710

# Submission time Handle Problem Language Result Execution time Memory
230710 2020-05-11T09:41:00 Z rama_pang Match (CEOI16_match) C++14
100 / 100
 20 ms 16512 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 100005;
const int ALPH = 26;

int N;
string S;

// Trie
int Trie[MAXN][ALPH];
int ParN[MAXN];
int ParE[MAXN];

int pos[MAXN];
vector<int> occ[MAXN];

string Answer;

void Read() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  cin >> S;
  N = S.size();
}

bool Solve(int l, int r) {
  if (l == r) return true;
  auto m = upper_bound(begin(occ[pos[l + 1]]), end(occ[pos[l + 1]]), r - 1);

  if (m == begin(occ[pos[l + 1]])) return false;
  m--;

  Answer[l] = '('; Answer[*m] = ')';
  return Solve(l + 1, *m) && Solve(*m + 1, r);
}

void Solve() {
  memset(Trie, -1, sizeof(Trie));
  memset(ParN, -1, sizeof(ParN));
  memset(ParE, -1, sizeof(ParE));
  memset(pos, -1, sizeof(pos));

  int node = 0;
  int TrieSize = 1;
  
  pos[0] = 0;
  occ[0].emplace_back(0);

  for (int i = 0; i < N; i++) {
    if (node > 0 && ParE[node] == S[i] - 'a') {
      node = ParN[node];
    } else {
      if (Trie[node][S[i] - 'a'] == -1) {
        Trie[node][S[i] - 'a'] = TrieSize++;
      }
      int prv = node;
      node = Trie[node][S[i] - 'a'];
      ParN[node] = prv;
      ParE[node] = S[i] - 'a';
    }
    pos[i + 1] = node;
    occ[node].emplace_back(i + 1);
  }
  
  Answer = string(N, '-');
  if (N % 2 == 1 || node != 0 || !Solve(0, N)) {
    cout << -1 << "\n";
  } else {
    cout << Answer << "\n";
  }
}



int main() {
  Read();
  Solve();
  return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14080 KB Output is correct
2 Correct 11 ms 14080 KB Output is correct
3 Correct 11 ms 14080 KB Output is correct
4 Correct 12 ms 14080 KB Output is correct
5 Correct 12 ms 14080 KB Output is correct
6 Correct 12 ms 14080 KB Output is correct
7 Correct 12 ms 14080 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 14080 KB Output is correct
2 Correct 11 ms 14080 KB Output is correct
3 Correct 11 ms 14080 KB Output is correct
4 Correct 12 ms 14080 KB Output is correct
5 Correct 12 ms 14080 KB Output is correct
6 Correct 12 ms 14080 KB Output is correct
7 Correct 12 ms 14080 KB Output is correct
8 Correct 12 ms 14208 KB Output is correct
9 Correct 12 ms 14208 KB Output is correct
10 Correct 12 ms 14208 KB Output is correct
11 Correct 12 ms 14208 KB Output is correct
12 Correct 16 ms 15616 KB Output is correct
13 Correct 16 ms 15872 KB Output is correct
14 Correct 17 ms 16000 KB Output is correct
15 Correct 16 ms 15872 KB Output is correct
16 Correct 17 ms 15872 KB Output is correct
17 Correct 18 ms 16256 KB Output is correct
18 Correct 17 ms 15360 KB Output is correct
19 Correct 19 ms 16384 KB Output is correct
20 Correct 16 ms 15744 KB Output is correct
21 Correct 20 ms 16512 KB Output is correct