oj.uz

답안 #124661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124661 2019-07-03T16:45:31 Z eriksuenderhauf 괄호 문자열 (CEOI16_match) C++11
10 / 100
 4 ms 760 KB 
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a,v) memset((a), (v), sizeof (a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pil pair<int, long long>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vil vector<pil>
#define vll vector<pll>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> oset;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e5 + 5;
const double eps = 1e-9;
char str[MAXN];
int a[MAXN], nx[MAXN][26], sz[MAXN][2][26];

void solve(int l, int r) {
	if (l > r) return;
	if (str[l] == str[r]) {
		a[l] = 0;
		a[r] = 1;
		solve(l+1, r-1);
		return;
	}
	//stack<int> st;
	//st.push(l);
	int mx = nx[r][str[l]-'a'];
	/*for (int i = l+1; i <= r; i++) {
		if (!st.empty() && str[i] == str[st.top()])
			st.pop();
		else
			st.push(i);
		if (st.empty() && str[i] == str[l])
			mx = i;
	}
	assert(st.empty());*/
	assert(l <= mx);
	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);
	a[1] = 0;
	//sz[0][1][str[0]-'a'] = 1;
	for (int i = 2; i <= n; i++) {
		int a = (int)st.size();
		if (!st.empty() && str[i] == str[st.top()])
			st.pop();
		else
			st.push(i);
		int d = ((int)st.size()-a+1) / 2;
		//cerr << a << " " << d << " " << i << "\n";
		for (int j = 0; j < 26; j++)
			nx[i][j] = sz[a+2*d-1][d^1][j]-1;
		sz[a][d][str[i-1]-'a'] = i;
	}
	if (!st.empty())
		return !printf("-1\n");
	/*cerr << "\n";
	for (int i = 1; i <= n; i++)
		for (int j = 0; j < 3; j++)
			cerr << i << " " << j << " " << nx[i][j] << "\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:67: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

# 결과 실행 시간 메모리 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
0 / 27.0

# 결과 실행 시간 메모리 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 Runtime error 4 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# 결과 실행 시간 메모리 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 Runtime error 4 ms 760 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -