| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 48086 | Extazy | Match (CEOI16_match) | C++17 | 2075 ms | 888 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N = 100007;
int n;
char a[N],ans[N];
bool can(int l, int r) {
  stack < char > s;
  int i;
  for(i=l;i<=r;i++) {
    if(!s.empty() && s.top()==a[i]) s.pop();
    else s.push(a[i]);
  }
  return s.empty();
}
void solve(int l, int r) {
  if(l>r) return;
  for(int i=r;i>=l;i--) {
    if(a[i]==a[l]) if(can(i+1,r)) {
      solve(l+1,i-1);
      solve(i+1,r);
      ans[l]='(';
      ans[i]=')';
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int i;
  scanf("%s", a+1);
  n=strlen(a+1);
  if(!can(1,n)) {
    printf("-1\n");
    return 0;
  }
    
  solve(1,n);
  for(i=1;i<=n;i++) {
    printf("%c", ans[i]);
  }
  printf("\n");
  return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
