| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1117865 | vjudge1 | Match (CEOI16_match) | C++17 | 28 ms | 26704 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 all(v) v.begin(), v.end()
#define int long long
using namespace std;
void f(int l, int r, string &s, string &t, vector<vector<int>> &last)
{
if(l > r) return;
int pos = last[r][s[l] - 'a'];
t[l] = '(', t[pos] = ')';
f(l + 1, pos - 1, s, t, last), f(pos + 1, r, s, t, last);
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
vector<vector<int>> last(s.size(), vector<int>(26, -1));
stack<int> st;
for(int i = 0; i < s.size(); i++)
{
if(!st.empty() && s[st.top()] == s[i]) st.pop();
else st.push(i);
}
if(!st.empty())
{
cout << -1;
return 0;
}
for(int i = 0; i < s.size(); i++)
{
last[i][s[i] - 'a'] = i;
for(int j = 0; j < 26 && i > 0; j++)
{
int prv = last[i - 1][s[i] - 'a'];
if(prv > 0 && s[i] - 'a' != j)
{
last[i][j] = last[prv - 1][j];
}
}
}
string t(s.size(), ' ');
f(0, s.size() - 1, s, t, last);
cout << t;
}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... | ||||
