# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
589090 | andrei_boaca | Match (CEOI16_match) | C++14 | 10 ms | 9940 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>
//#pragma GCC optimize("O3")
using namespace std;
typedef pair<int,int> pii;
int n;
string s,sol;
stack<char> st;
vector<int> mypoz[31],v;
set<int> mysums[100005];
map<int,int> nrm;
int nxt[100005];
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cin>>s;
n=s.size();
s=" "+s;
if(n%2==1)
{
cout<<-1;
return 0;
}
for(int i=1;i<=n;i++)
{
mypoz[s[i]-'a'+1].push_back(i);
if(!st.empty()&&st.top()==s[i])
st.pop();
else
st.push(s[i]);
}
if(!st.empty())
{
cout<<-1;
return 0;
}
sol.resize(n+1);
for(int i=1;i<=26;i++)
{
v=mypoz[i];
int suma=0;
nrm.clear();
int nr=0;
nxt[0]=v[0];
nrm[0]=1;
nr=1;
for(int j=0;j<v.size();j++)
{
if(v[j]%2==1)
suma++;
else
suma--;
if(nrm.count(suma)==0)
{
nr++;
nrm[suma]=nr;
}
mysums[nrm[suma]].insert(v[j]);
}
suma=0;
for(int j=0;j<v.size();j++)
{
if(sol[v[j]]!=')')
{
sol[v[j]]='(';
auto it=prev(mysums[nrm[suma]].end());
int poz=(*it);
sol[poz]=')';
mysums[nrm[suma]].erase(it);
}
if(v[j]%2==1)
suma++;
else
suma--;
}
for(int j=1;j<=nr;j++)
mysums[j].clear();
}
for(int i=1;i<=n;i++)
cout<<sol[i];
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... |