oj.uz

답안 #52822

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
52822 2018-06-27T01:29:20 Z ainta 괄호 문자열 (CEOI16_match) C++17
100 / 100
 39 ms 19900 KB 
#include<cstdio>
#include<algorithm>
#define N_ 101000
using namespace std;
char p[N_], r[N_];
int n, D[N_][27], w[N_], Bef[N_][20];
int cur[N_], st[N_], top;
bool OK(int b, int e) {
	if (b > e)return false;
	for (int i = 19; i >= 0; i--) {
		if (Bef[e][i] >= b)e = Bef[e][i];
	}
	return b == e;
}
int main() {
	//freopen("input.txt", "r", stdin);
	int i, j;
	scanf("%s", p + 1);
	for (i = 1; p[i]; i++);
	n = i - 1;
	for (i = 1; i <= n; i++) {
		w[i] = p[i] - 'a' + 1;
	}

	for (i = 0; i <= n; i++) {
		Bef[i][0] = -1;
		for (j = 0; j <= 26; j++)D[i][j] = -1;
		D[i][w[i]] = 0;
		if (!i)continue;
		if (D[i - 1][w[i]] != -1) {
			int L = D[i - 1][w[i]] + 2;
			Bef[i][0] = i - L;
			if(w[i-L]!=w[i])D[i][w[i - L]] = L;
			for (j = 0; j <= 26; j++) {
				if (D[i - L][j] != -1) {
					if (D[i][j] == -1 || D[i][j] > D[i - L][j] + L)D[i][j] = D[i - L][j] + L;
				}
			}
		}
	}
	for (i = 0; i < 19; i++) {
		for (j = 1; j <= n; j++) {
			if (Bef[j][i] == -1)Bef[j][i + 1] = -1;
			else Bef[j][i + 1] = Bef[Bef[j][i]][i];
		}
	}

	for (i = 1; i <= n; i++) {
		if (top && st[top] == w[i])top--;
		else st[++top] = w[i];
	}
	if (top) {
		puts("-1");
		return 0;
	}
	cur[0] = n;
	for (i = 1; i <= n; i++) {
		r[i] = '(';
		st[++top] = w[i];
		int t = D[cur[top-1]][w[i]];
		if (t == -1) {
			top -= 2;
			r[i] = ')';
			continue;
		}
		cur[top] = cur[top - 1] - t - 1;
		if (!OK(i, cur[top])) {
			top -= 2;
			r[i] = ')';
			continue;
		}
	}
	printf("%s\n", r + 1);
}

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 796 KB Output is correct
7 Correct 2 ms 1128 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 576 KB Output is correct
5 Correct 2 ms 608 KB Output is correct
6 Correct 2 ms 796 KB Output is correct
7 Correct 2 ms 1128 KB Output is correct
8 Correct 4 ms 1772 KB Output is correct
9 Correct 4 ms 1900 KB Output is correct
10 Correct 4 ms 1916 KB Output is correct
11 Correct 4 ms 1972 KB Output is correct
12 Correct 21 ms 12140 KB Output is correct
13 Correct 23 ms 13196 KB Output is correct
14 Correct 27 ms 14108 KB Output is correct
15 Correct 33 ms 16156 KB Output is correct
16 Correct 32 ms 16256 KB Output is correct
17 Correct 31 ms 17076 KB Output is correct
18 Correct 37 ms 17820 KB Output is correct
19 Correct 36 ms 18844 KB Output is correct
20 Correct 22 ms 18844 KB Output is correct
21 Correct 39 ms 19900 KB Output is correct