oj.uz

Submission #930259

# Submission time Handle Problem Language Result Execution time Memory
930259 2024-02-19T08:14:48 Z ttamx Match (CEOI16_match) C++14
10 / 100
 0 ms 348 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]-'a'];
    ans[m]=')';
    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++){
        for(int j=0;j<26;j++)dp[i][j]=dp[i-1][j];
        dp[i][t[i]-'a']=i;
    }
    solve(0,n-1);
    cout << ans;
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:31:48: warning: iteration 20 invokes undefined behavior [-Waggressive-loop-optimizations]
   31 |         for(int j=0;j<26;j++)dp[i][j]=dp[i-1][j];
      |                                       ~~~~~~~~~^
match.cpp:31:22: note: within this loop
   31 |         for(int j=0;j<26;j++)dp[i][j]=dp[i-1][j];
      |                     ~^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -