Submission #1086554

#TimeUsernameProblemLanguageResultExecution timeMemory
1086554juicyMatch (CEOI16_match)C++17
100 / 100
10 ms12104 KiB
#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

const int N = 1e5, C = 26;

int n;
array<int, C> p[N];
string s, res;

void solve(int l, int r) {
  if (l > r) {
    return;
  }
  int c = s[l] - 'a';
  int m = p[r][c];
  if (m < l) {
    cout << -1;
    exit(0);
  } 
  res[l] = '(', res[m] = ')';
  solve(l + 1, m - 1);
  solve(m + 1, r);
}

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  cin >> s;
  n = s.size();
  p[0].fill(-1);
  p[0][s[0] - 'a'] = 0;
  for (int i = 1; i < n; ++i) {
    for (int j = 0; j < C; ++j) {
      if (j == s[i] - 'a') {
        p[i][j] = i;
      } else if (p[i - 1][s[i] - 'a'] > 0) {
        p[i][j] = p[p[i - 1][s[i] - 'a'] - 1][j];
      } else {
        p[i][j] = -1;
      }
    }
  }
  res.resize(n);
  solve(0, n - 1);
  cout << res;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...