Submission #1757084


Source Code Expand

#include<bits/stdc++.h>
//#define int long long
#define loop(i, a, b) for(int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define all(a) (a).begin(),(a).end()
using namespace std;
const int MOD = 1e9 + 7, INF = 1e9;
using vi = vector <int>;
using vvi = vector <vi>;
//g++ -std==c++14

int main(){
    int n;  string s;
    cin >> n >> s;
    int num_left = 0, num_right = 0;
    bool first = false;
    rep(i, n){
        if(s[i] == '(')first = true;
        (s[i] == '(' ? num_left : num_right) += first;
    }
    if(num_left > num_right){
        rep(i, num_left - num_right)
            s += ')';
    }

    num_left = 0;
    num_right = 0;
    first = false;
    for(int i = n - 1; i >= 0; i--){
        if(s[i] == ')')first = true;
        (s[i] == '(' ? num_left : num_right) += first;
    }
    if(num_right > num_left)
        rep(i, num_right - num_left)
            cout << '(';
    cout << s << endl;
}

Submission Info

Submission Time
Task D - Insertion
User Masumi
Language C++14 (GCC 5.4.1)
Score 0
Code Size 957 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 × 8
WA × 4
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 AC 1 ms 256 KB
in7.txt WA 1 ms 256 KB
in8.txt AC 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