oj.uz

Submission #862699

# Submission time Handle Problem Language Result Execution time Memory
862699 2023-10-18T21:22:48 Z MilosMilutinovic Match (CEOI16_match) C++14
100 / 100
 7 ms 11840 KB 
#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

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.0 / 10.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2652 KB Output is correct
12 Correct 4 ms 7516 KB Output is correct
13 Correct 4 ms 9820 KB Output is correct
14 Correct 4 ms 10076 KB Output is correct
15 Correct 5 ms 10332 KB Output is correct
16 Correct 5 ms 10564 KB Output is correct
17 Correct 5 ms 10844 KB Output is correct
18 Correct 5 ms 10328 KB Output is correct
19 Correct 6 ms 11352 KB Output is correct
20 Correct 3 ms 7772 KB Output is correct
21 Correct 7 ms 11840 KB Output is correct