oj.uz

Submission #124704

# Submission time Handle Problem Language Result Execution time Memory
124704 2019-07-03T17:53:19 Z eriksuenderhauf Match (CEOI16_match) C++11
100 / 100
 24 ms 11256 KB 
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
char str[MAXN];
int a[MAXN], nx[MAXN][26];

void solve(int l, int r) {
	if (l > r) return;
	if (str[l] == str[r]) {
		a[r] = 1;
		solve(l+1, r-1);
		return;
	}
	int mx = nx[r][str[l]-'a'];
	a[mx] = 1;
	solve(l+1,mx-1);
	solve(mx+1,r);
}

int main() {
	scanf("%s", str+1);
	int n = strlen(str+1);
	if (n & 1) return !printf("-1\n");
	stack<int> st;
	st.push(1);
	nx[1][str[1]-'a'] = 1;
	for (int i = 2; i <= n; i++) {
		if (!st.empty() && str[i] == str[st.top()])
			st.pop();
		else
			st.push(i);
		for (int j = 0; j < 26; j++)
			if (nx[i-1][str[i]-'a'])
				nx[i][j] = nx[nx[i-1][str[i]-'a']-1][j];
		nx[i][str[i]-'a'] = i;
	}
	if (!st.empty())
		return !printf("-1\n");
	solve(1, n);
	for (int i = 1; i <= n; i++)
		if (a[i])
			printf(")");
		else
			printf("(");
    return 0;
}

Compilation message

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

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct

Subtask #3
63.0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 504 KB Output is correct
5 Correct 2 ms 504 KB Output is correct
6 Correct 2 ms 504 KB Output is correct
7 Correct 2 ms 504 KB Output is correct
8 Correct 3 ms 1016 KB Output is correct
9 Correct 4 ms 1116 KB Output is correct
10 Correct 3 ms 1144 KB Output is correct
11 Correct 3 ms 1144 KB Output is correct
12 Correct 14 ms 6892 KB Output is correct
13 Correct 15 ms 7416 KB Output is correct
14 Correct 15 ms 8056 KB Output is correct
15 Correct 16 ms 8824 KB Output is correct
16 Correct 16 ms 8824 KB Output is correct
17 Correct 18 ms 9596 KB Output is correct
18 Correct 18 ms 9976 KB Output is correct
19 Correct 20 ms 10616 KB Output is correct
20 Correct 13 ms 6904 KB Output is correct
21 Correct 24 ms 11256 KB Output is correct