oj.uz

답안 #124459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
124459 2019-07-03T11:12:55 Z eriksuenderhauf 괄호 문자열 (CEOI16_match) C++11
10 / 100
 3 ms 632 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], sz[MAXN][2];

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 = l;
	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());*/
	for (int i = r-1; i >= l; i--) {
		if (str[i] == str[l] && sz[l][0] == sz[i][1] && sz[l][1] == sz[i][0]) {
			a[l] = 0; 
			a[i] = 1;
			solve(l+1,i-1);
			solve(i+1,r);
			return;
		}
	}
	assert(1!=1);
	//int u = l;
	//while (nx[u] <= r && nx[u] != -1 && u != nx[u]) {
	//	u = nx[u];
	//}
	//cerr << u << " " << mx << "\n";
	//int mx = u;
	/*a[mx] = 1;
	solve(l+1,mx-1);
	solve(mx+1,r);*/
}

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

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Runtime error 3 ms 632 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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Runtime error 3 ms 632 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -