oj.uz

Submission #336732

# Submission time Handle Problem Language Result Execution time Memory
336732 2020-12-16T15:17:27 Z Sho10 Match (CEOI16_match) C++14
100 / 100
 8 ms 3296 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int n;
string s;
vector<int>v;
void calc(int l,int r){
if(l>r){
    return;
}
if(s[l]==s[r]){
    cout<<'(';
    calc(l+1,r-1);
    cout<<')';
    return;
}
int mid=v[r];
while(s[mid-1]!=s[l]){
mid=v[mid-1];
}
cout<<'(';
calc(l+1,mid-2);
cout<<')';
calc(mid,r);
}
int32_t main(){
CODE_START;
cin>>s;
n=s.size();
for(int i=0;i<n;i++)
{
    if(!v.empty()&&s[v.back()]==s[i]){
        v.pop_back();
    }else v.pb(i);
}
if(v.size()){
    rc("-1");
}
v.assign(n,-1);
for(int i=1;i<n;i++)
{
    v[i]=i-1;
    while(v[i]>=0&&s[v[i]]!=s[i]){
    v[i]=v[v[i]]-1;
    }
}
calc(0,n-1);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 492 KB Output is correct
11 Correct 1 ms 620 KB Output is correct
12 Correct 4 ms 1900 KB Output is correct
13 Correct 5 ms 2028 KB Output is correct
14 Correct 6 ms 2652 KB Output is correct
15 Correct 8 ms 3052 KB Output is correct
16 Correct 8 ms 3052 KB Output is correct
17 Correct 7 ms 3180 KB Output is correct
18 Correct 7 ms 1900 KB Output is correct
19 Correct 7 ms 2668 KB Output is correct
20 Correct 5 ms 2340 KB Output is correct
21 Correct 8 ms 3296 KB Output is correct