Submission #198205

#	Time	Username	Problem	Language	Result	Execution time	Memory
198205		ruler	Match (CEOI16_match)	C++14	37 / 100	2056 ms	504 KiB

match

// IOI 2021
#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ends ' '
#define die(x) return cout << x << endl, 0
#define all(v) v.begin(), v.end()
#define sz(x) (int)(x.size())
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) { cerr << ends << H; debug_out(T...); }
#define debug(...) cerr << "{" << #__VA_ARGS__ << "}:", debug_out(__VA_ARGS__)
typedef long long ll;
typedef pair<int, int> pii;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;

////////////////////////////////////////////////////////////////////

const int N = 1e4 + 5;

string S;
int n;

bool F(stack<char> st, int pos) {
	for (int i = pos; i < n; i++) {
		if (st.empty() || st.top() != S[i]) st.push(S[i]);
		else st.pop();
	}
	return st.empty();
}

int main() {

	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	
	cin >> S; n = sz(S);
	stack<char> st;
	string ans = "";
	for (int i = 0; i < n; i++) {
		st.push(S[i]);
		if (!F(st, i + 1)) {
			st.pop();
			if (st.empty() || st.top() != S[i]) die(-1);
			st.pop();
			ans += ')';
		} else ans += '(';
	}
	cout << ans << endl;

	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 27 / 27
• Subtask 3: 0 / 63