oj.uz

Submission #124703

# Submission time Handle Problem Language Result Execution time Memory
124703 2019-07-03T17:52:13 Z eriksuenderhauf Match (CEOI16_match) C++11
100 / 100
 21 ms 11256 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<ll,int,hash<ll>> 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 MOD2 = 1e9 + 9;
const int INF = 1e9 + 7;
const int MAXN = 1e5 + 5;
const double eps = 1e-9;
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[l] = 0;
		a[r] = 1;
		solve(l+1, r-1);
		return;
	}
	int mx = nx[r][str[l]-'a'];
	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);
	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:57: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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 508 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 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 508 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 1144 KB Output is correct
10 Correct 4 ms 1016 KB Output is correct
11 Correct 3 ms 1016 KB Output is correct
12 Correct 14 ms 6776 KB Output is correct
13 Correct 16 ms 7416 KB Output is correct
14 Correct 15 ms 7928 KB Output is correct
15 Correct 17 ms 8952 KB Output is correct
16 Correct 16 ms 8952 KB Output is correct
17 Correct 17 ms 9464 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 21 ms 11256 KB Output is correct