Submission #1347711


Source Code Expand

//problem-C
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <iostream>
#include <vector>
#include<string>
#include<queue>
#include<map>

using namespace std;

int main() {
	int N;
	string S;
	cin >> N >> S;
	
	int putFirst = 0;
	int putLast = 0;
	int nowCount = 0;
	for (int i = 0; i < N; i++)
	{
		if (S[i] == '(') {
			nowCount++;
		}
		else {
			nowCount--;
			if (nowCount == -1) {
				nowCount = 0;
				putFirst++;
			}
		}
	}
	putLast = nowCount;

	for (int i = 0; i < putFirst; i++)
	{
		cout << '(';
	}
	cout << S;
	for (int i = 0; i < putLast; i++)
	{
		cout << ')';
	}
	cout << endl;

	return 0;
}

Submission Info

Submission Time
Task D - Insertion
User chokudai
Language C++14 (GCC 5.4.1)
Score 400
Code Size 691 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 12
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 AC 1 ms 256 KB
in5.txt AC 1 ms 256 KB
in6.txt AC 1 ms 256 KB
in7.txt AC 1 ms 256 KB
in8.txt AC 1 ms 256 KB
in9.txt AC 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