Submission #930259

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
930259	2024-02-19 08:14:48	ttamx	Match (CEOI16_match)	C++14	10 / 100	0 ms	348 KiB

match

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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++){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Compilation message (stderr)

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 / 10
• Subtask 2: 0 / 27
• Subtask 3: 0 / 63