Submission #930262

#	Time	Username	Problem	Language	Result	Execution time	Memory
930262		ttamx	Match (CEOI16_match)	C++14	100 / 100	8 ms	14172 KiB

match

#include<bits/stdc++.h>

using namespace std;

const int N=1e5+5;

int n;
int dp[N][30];
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;
}

• Subtask 1: 10 / 10
• Subtask 2: 27 / 27
• Subtask 3: 63 / 63