oj.uz

Submission #67344

# Submission time Handle Problem Language Result Execution time Memory
67344 2018-08-14T03:47:22 Z MatheusLealV Match (CEOI16_match) C++17
100 / 100
 1878 ms 2604 KB 
#include <bits/stdc++.h>
#define N 100050
#define f first
#define s second
using namespace std;
int n, v[N];

string s;

char resp[N], open[N];

bool solve(int l, int r)
{
	if(r < l) return 1;

	if(r - l == 1)
	{
		resp[l] = '(', resp[r] = ')';

		return (v[l] == v[r]);
	}

	if(l == r) return 0;

	int id = 0;

	for(int j = r; j > l; j--)
	{
		if(id)
		{
			int t = open[id];

			if(t == v[j]) id--;

			else
			{
				id++;

				open[id] = v[j];
			}
		}

		else
		{
			if(v[l] == v[j])
			{
				resp[l] = '(', resp[j] = ')';

				bool A = solve(l + 1, j - 1);

				if(A) return solve(j + 1, r);

				else return 0;
			}

			++id;

			open[id] = (v[j]);
		}
	}

	return 0;
}

int main()
{
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>s;

	n = s.size();

	for(int i = 1; i <= n; i++) v[i] = s[i - 1] - 'a';

	if(solve(1, n))
	{
		for(int i = 1; i<= n; i++) cout<<resp[i];

		cout<<"\n";
	}

	else cout<<"-1\n";
}

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 488 KB Output is correct
3 Correct 2 ms 496 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 488 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 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 488 KB Output is correct
3 Correct 2 ms 496 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 576 KB Output is correct
7 Correct 2 ms 576 KB Output is correct
8 Correct 4 ms 592 KB Output is correct
9 Correct 12 ms 764 KB Output is correct
10 Correct 5 ms 764 KB Output is correct
11 Correct 4 ms 780 KB Output is correct
12 Correct 71 ms 1564 KB Output is correct
13 Correct 34 ms 1692 KB Output is correct
14 Correct 512 ms 2144 KB Output is correct
15 Correct 7 ms 2332 KB Output is correct
16 Correct 10 ms 2332 KB Output is correct
17 Correct 72 ms 2432 KB Output is correct
18 Correct 13 ms 2432 KB Output is correct
19 Correct 862 ms 2432 KB Output is correct
20 Correct 337 ms 2432 KB Output is correct
21 Correct 1878 ms 2604 KB Output is correct