# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
930261 |
2024-02-19T08:20:41 Z |
ttamx |
Match (CEOI16_match) |
C++14 |
|
401 ms |
524288 KB |
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int n;
int dp[N][20];
string t,ans;
stack<char> s;
void solve(int l,int r){
if(l>r)return;
int m=dp[r][t[l-1]-'a'];
ans[m-1]=')';
solve(l+1,m-1);
solve(m+1,r);
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> t;
int n=t.size();
for(auto x:t){
if(!s.empty()&&x==s.top())s.pop();
else s.emplace(x);
}
if(!s.empty())cout << -1,exit(0);
ans.assign(n,'(');
for(int i=1;i<=n;i++){
int p=dp[i-1][t[i-1]-'a'];
for(int j=0;j<26;j++)if(p>1){
dp[i][j]=t[p-2]=='a'+j?p-1:dp[p-1][j];
}
dp[i][t[i-1]-'a']=i;
}
solve(1,n);
cout << ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Runtime error |
401 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Runtime error |
401 ms |
524288 KB |
Execution killed with signal 9 |
6 |
Halted |
0 ms |
0 KB |
- |