Submission #63913622

---

Source Code Expand

#include <bits/stdc++.h>
#define x first
#define y second
#define pb push_back
#define eb emplace_back
#define pf push_front
#define desktop "C:\\Users\\MPC\\Desktop\\"
#define IOS ios :: sync_with_stdio (false),cin.tie (0),cout.tie (0)
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair <int,int> PII;
const int dx[] = {1,0,-1,0},dy[] = {0,-1,0,1};
template <typename T1,typename T2> bool tomax (T1 &x,T2 y) {
	if (y > x) return x = y,true;
	return false;
}
template <typename T1,typename T2> bool tomin (T1 &x,T2 y) {
	if (y < x) return x = y,true;
	return false;
}
LL power (LL a,LL b,LL p) {
	LL ans = 1;
	while (b) {
		if (b & 1) ans = ans * a % p;
		a = a * a % p;
		b >>= 1;
	}
	return ans;
}
int fastio = (IOS,0);
#define endl '\n'
#define puts(s) cout << (s) << endl
const int N = 400010;
int n;
PII a[N];
int b[N];
int stk[N],top;
bool tmp;
char ans[N];
void mian () {
	cin >> n;
	for (int i = 1;i <= n * 2;i++) cin >> a[i].x,a[i].y = i;
	sort (a + 1,a + n * 2 + 1,greater <PII> ());
	for (int i = 1;i <= n;i++) b[a[i].y] = 1;
	for (int i = 1;i <= 2 * n;i++) {
		if (!top) {
			tmp = b[i];
			stk[++top] = i;
			continue;
		}
		if (b[i] == tmp) stk[++top] = i;
		else {
			ans[stk[top]] = '(',ans[i] = ')';
			top--;
		}
	}
	for (int i = 1;i <= 2 * n;i++) cout << ans[i];
	cout << endl;
}
int main () {
	int T = 1;
	// cin >> T;
	while (T--) mian ();
	return 0;
}

Submission Info

Judge Result