Submission #1347691


Source Code Expand

#include<iostream>
#include<algorithm>
#include <string>
#include<cstdio>
#include<vector>
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
using namespace std;
typedef long long ll;

int main()
{
	string moji="";
	int n; cin >> n;
	vector<int>a(10000);
	REP(i, 1000) { a[i] = 1; }
	REP(i, n) {
		char gomi;
		cin >> gomi; moji += gomi;
		if (gomi == '(') {
			a[i] = 1;
		}
		else {
			a[i] = 0;
		}
	}
	int sii = moji.size();
	while (1) {
		int c = 0;
		REP(i, n - 1) {

			if (a[i] == 1 && a[i + 1] == 0) {
				a.erase(a.begin() + i, a.begin() + i + 1);
				sii -= 2;
				c++;
			}
		}
		if (c == 0) {
			REP(i, sii) {
				int aa = a[i];
				if (aa) {
					moji = moji + ')';
				}
				else {
					moji = '(' + moji;
				}
			}
			break;
		}
	}
	cout << moji << endl;
	return 0;
}

Submission Info

Submission Time
Task D - Insertion
User keidaroo
Language C++14 (GCC 5.4.1)
Score 0
Code Size 861 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 3
AC × 6
WA × 6
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
in1.txt AC 1 ms 256 KB
in2.txt AC 1 ms 256 KB
in3.txt AC 1 ms 256 KB
in4.txt WA 1 ms 256 KB
in5.txt WA 1 ms 256 KB
in6.txt WA 1 ms 256 KB
in7.txt WA 1 ms 256 KB
in8.txt WA 1 ms 256 KB
in9.txt WA 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB