# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
231356 | nicolaalexandra | Match (CEOI16_match) | C++14 | 2099 ms | 504 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 DIM 100010
using namespace std;
char v[DIM];
deque <char> s,d;
int n,i;
int verif (int poz){
for (int i=poz;i<=n;i++){
if (!d.empty() && d.back() == v[i])
d.pop_back();
else d.push_back(v[i]);
}
return d.empty();
}
int main (){
//ifstream cin ("match.in");
//ofstream cout ("match.out");
cin>>v+1;
n = strlen (v+1);
/// verific daca am solutie
s.push_back(v[1]);
for (i=2;i<=n;i++){
if (!s.empty() && s.back() == v[i])
s.pop_back();
else s.push_back(v[i]);
}
if (!s.empty()){
cout<<-1;
return 0;
}
s.push_back(v[1]);
cout<<"(";
for (i=2;i<=n;i++){
/// incerc sa pun (
d = s;
d.push_back(v[i]);
if (verif(i+1)){
s.push_back(v[i]);
cout<<"(";
} else {
cout<<")";
s.pop_back();
}
}
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... |