Submission #862699

#	Time	Username	Problem	Language	Result	Execution time	Memory
862699		MilosMilutinovic	괄호 문자열 (CEOI16_match)	C++14	100 / 100	7 ms	11840 KiB

match

#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

char s[100005];
int lst[100005][26];

void solve(int l,int r){
	if(l>r) return;
	int c=s[l]-'a',p=lst[r][c];
	if(p<=l){printf("-1\n");exit(0);}
	s[l]='('; s[p]=')';
	solve(l+1,p-1);
	solve(p+1,r);
}

int main(){
	scanf("%s",s+1);
	int n=strlen(s+1);
	for(int i=1;i<=n;i++){
		int c=s[i]-'a';
		for(int j=0;j<26;j++){
			if(lst[i-1][c]!=0) lst[i][j]=lst[lst[i-1][c]-1][j];
		}
		lst[i][c]=i;
	}
	solve(1,n);
	printf("%s\n",s+1);
	return 0;
}

Compilation message (stderr)

match.cpp: In function 'int main()':
match.cpp:39:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  scanf("%s",s+1);
      |  ~~~~~^~~~~~~~~~

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