oj.uz

답안 #62353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
62353 2018-07-28T08:13:48 Z kingpig9 괄호 문자열 (CEOI16_match) C++11
100 / 100
 25 ms 12732 KB 
//This is so hard to understand why it even works...
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 1e5 + 10;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define fillchar(a, s) memset((a), (s), sizeof(a))

int N;
char S[MAXN];
char ans[MAXN];
int prv[MAXN][26];

void rec (int lt, int rt) {
	if (lt > rt) {
		return;
	}

	int match = prv[rt][S[lt] - 'a'];	//which index you match with?
	if (match <= lt) {
		//then cannot match
		puts("-1");
		exit(0);
	}
	ans[lt] = '(';
	ans[match] = ')';
	rec(lt + 1, match - 1);
	rec(match + 1, rt);
}

int main() {
	if (fopen("match.in", "r")) {
		freopen("match.in", "r", stdin);
		freopen("match.out", "w", stdout);
	}
	scanf("%s", S);
	N = strlen(S);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < 26; j++) {
			prv[i][j] = -1;
			if (j == S[i] - 'a') {
				prv[i][j] = i;
			} else if (i) {
				if (prv[i - 1][S[i] - 'a'] > 0) {
					prv[i][j] = prv[prv[i - 1][S[i] - 'a'] - 1][j];
				}
			}
		}
	}
	rec(0, N - 1);
	puts(ans);
}

Compilation message

match.cpp: In function 'int main()':
match.cpp:41:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen("match.in", "r", stdin);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
match.cpp:42:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen("match.out", "w", stdout);
   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
match.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%s", S);
  ~~~~~^~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 684 KB Output is correct
5 Correct 3 ms 684 KB Output is correct
6 Correct 3 ms 804 KB Output is correct
7 Correct 3 ms 828 KB Output is correct

Subtask #3
63.0 / 63.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 504 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 3 ms 504 KB Output is correct
4 Correct 4 ms 684 KB Output is correct
5 Correct 3 ms 684 KB Output is correct
6 Correct 3 ms 804 KB Output is correct
7 Correct 3 ms 828 KB Output is correct
8 Correct 3 ms 1272 KB Output is correct
9 Correct 5 ms 1408 KB Output is correct
10 Correct 4 ms 1432 KB Output is correct
11 Correct 5 ms 1584 KB Output is correct
12 Correct 17 ms 7548 KB Output is correct
13 Correct 16 ms 8152 KB Output is correct
14 Correct 22 ms 8912 KB Output is correct
15 Correct 18 ms 10308 KB Output is correct
16 Correct 17 ms 10340 KB Output is correct
17 Correct 25 ms 11064 KB Output is correct
18 Correct 19 ms 11064 KB Output is correct
19 Correct 22 ms 11872 KB Output is correct
20 Correct 15 ms 11872 KB Output is correct
21 Correct 24 ms 12732 KB Output is correct