| Task: | Bracket sequence |
| Sender: | aalto26iw_003 |
| Submission time: | 2026-11-04 17:27:39 +0200 |
| Language: | C++ (C++23) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.00 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.00 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.00 s | details |
| #14 | ACCEPTED | 0.00 s | details |
| #15 | ACCEPTED | 0.00 s | details |
| #16 | ACCEPTED | 0.00 s | details |
| #17 | ACCEPTED | 0.00 s | details |
| #18 | ACCEPTED | 0.00 s | details |
| #19 | ACCEPTED | 0.00 s | details |
| #20 | ACCEPTED | 0.00 s | details |
| #21 | ACCEPTED | 0.00 s | details |
| #22 | ACCEPTED | 0.00 s | details |
| #23 | ACCEPTED | 0.00 s | details |
| #24 | ACCEPTED | 0.00 s | details |
| #25 | ACCEPTED | 0.00 s | details |
| #26 | ACCEPTED | 0.00 s | details |
| #27 | ACCEPTED | 0.00 s | details |
| #28 | ACCEPTED | 0.00 s | details |
| #29 | ACCEPTED | 0.00 s | details |
| #30 | ACCEPTED | 0.00 s | details |
| #31 | ACCEPTED | 0.00 s | details |
| #32 | ACCEPTED | 0.00 s | details |
| #33 | ACCEPTED | 0.00 s | details |
| #34 | ACCEPTED | 0.00 s | details |
| #35 | ACCEPTED | 0.00 s | details |
| #36 | ACCEPTED | 0.00 s | details |
| #37 | ACCEPTED | 0.00 s | details |
| #38 | ACCEPTED | 0.00 s | details |
| #39 | ACCEPTED | 0.00 s | details |
| #40 | ACCEPTED | 0.00 s | details |
| #41 | ACCEPTED | 0.00 s | details |
| #42 | ACCEPTED | 0.00 s | details |
| #43 | ACCEPTED | 0.00 s | details |
| #44 | ACCEPTED | 0.00 s | details |
| #45 | ACCEPTED | 0.00 s | details |
| #46 | ACCEPTED | 0.00 s | details |
| #47 | ACCEPTED | 0.00 s | details |
| #48 | ACCEPTED | 0.00 s | details |
| #49 | ACCEPTED | 0.00 s | details |
| #50 | ACCEPTED | 0.00 s | details |
| #51 | ACCEPTED | 0.00 s | details |
| #52 | ACCEPTED | 0.00 s | details |
| #53 | ACCEPTED | 0.00 s | details |
| #54 | ACCEPTED | 0.00 s | details |
| #55 | ACCEPTED | 0.00 s | details |
| #56 | ACCEPTED | 0.16 s | details |
| #57 | ACCEPTED | 0.24 s | details |
| #58 | ACCEPTED | 0.26 s | details |
| #59 | ACCEPTED | 0.15 s | details |
| #60 | ACCEPTED | 0.01 s | details |
| #61 | ACCEPTED | 0.25 s | details |
| #62 | ACCEPTED | 0.19 s | details |
| #63 | ACCEPTED | 0.24 s | details |
| #64 | ACCEPTED | 0.18 s | details |
| #65 | ACCEPTED | 0.25 s | details |
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:501:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
501 | for (int i = 0; i < s.size()-1; i++){
| ~~^~~~~~~~~~~~
input/code.cpp:510:25: warning: comparison of integer expressions of different signedness: 'std::tuple_element<1, std::tuple<int, int> >::type' {aka 'int'} and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
510 | if (i != 0 && j != s.size()-1){
| ~~^~~~~~~~~~~~~
input/code.cpp:527:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::tuple<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
527 | for (int i = 1; i < rangesStuck.size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~
input/code.cpp:542:44: warning:...Code
#include <iostream>
#include <vector>
#include <functional>
#include <set>
#include <algorithm>
#include <stack>
#include <unordered_map>
#include <map>
#include <iomanip>
#include <limits>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
typedef long long LL;
typedef std::tuple<LL> TUP1LL;
typedef std::tuple<LL,LL> TUP2LL;
typedef std::tuple<LL,LL,LL> TUP3LL;
typedef std::tuple<LL,LL,LL,LL> TUP4LL;
std::tuple<LL> readLL1(){
LL a;
std::cin >> a;
return {a};
}
std::tuple<LL,LL> readLL2(){
LL a, b;
std::cin >> a >> b;
return {a,b};
}
std::tuple<LL,LL,LL> readLL3(){
LL a, b, c;
std::cin >> a >> b >> c;
return {a,b,c};
}
std::tuple<LL,LL,LL,LL> readLL4(){
LL a, b, c, d;
std::cin >> a >> b >> c >> d;
return {a,b,c,d};
}
std::vector<LL> readVecLL(LL n){
std::vector<LL> arr(n);
for (LL i = 0; i < n; i++){
LL a;
std::cin >> a;
arr[i] = a;
}
return arr;
}
std::string readStr(){
std::string a;
std::cin >> a;
return a;
}
std::vector<std::string> readVecStr(LL n){
std::vector<std::string> arr(n);
for (LL i = 0; i < n; i++){
std::string a;
std::cin >> a;
arr[i] = a;
}
return arr;
}
std::vector<std::tuple<LL,LL>> readVecTup2(LL n){
std::vector<std::tuple<LL,LL>> arr(n);
for (LL i = 0; i < n; i++){
arr[i] = readLL2();
}
return arr;
}
std::vector<std::tuple<LL,LL,LL>> readVecTup3(LL n){
std::vector<std::tuple<LL,LL,LL>> arr(n);
for (LL i = 0; i < n; i++){
arr[i] = readLL3();
}
return arr;
}
std::vector<std::tuple<double,double,double>> readVecTup3Dup(LL n){
std::vector<std::tuple<double,double,double>> arr(n);
for (LL i = 0; i < n; i++){
double a, b, c;
std::cin >> a;
std::cin >> b;
std::cin >> c;
arr[i] = {a,b,c};
}
return arr;
}
std::vector<std::tuple<LL,LL,LL,LL>> readVecTup4(LL n){
std::vector<std::tuple<LL,LL,LL,LL>> arr(n);
for (LL i = 0; i < n; i++){
arr[i] = readLL4();
}
return arr;
}
void printNewLine(){std::cout << "\n";}
template<typename T, typename... Ts>
std::tuple<Ts...> tail(std::tuple<T,Ts...> as){
return std::apply([](T &a, Ts... b){return std::make_tuple(b...);},as);
}
template<typename T>
void print(T a){std::cout << std::setprecision(19) << a;}
template<typename... T>
void println(T... a);
template<typename T, typename Ts>
void print(std::tuple<T,Ts> a){
print(std::get<0>(a));
print(" ");
print(std::get<1>(a));
}
template<typename T, typename... Ts>
void print(std::tuple<T,Ts...> a){
print(std::get<0>(a));
print(" ");
print(tail(a));
}
template<typename T>
void print(const std::vector<T> &arr, LL width = -1){
if (width == -1) width = arr.size();
for (LL i = 0; i < (LL)arr.size(); i++){
print(arr[i]);
if (i+1 == (LL)arr.size()) continue;
if ((i%width) == width-1) printNewLine();
if ((i%width) != width-1) print(" ");
}
}
template<typename... T>
void println(T... a){print(a...);printNewLine();}
template<typename T>
void sorted(std::vector<T> &arr){
std::sort(arr.begin(),arr.end(),[](const T &a, const T &b){ return a < b; });
}
template<typename T>
std::set<T> toSet(const std::vector<T> &vec){
std::set<T> c;
for (T a : vec){ c.emplace(a);}
return c;
}
template<typename T, typename N>
std::vector<N> map(const std::vector<T> &a, const std::function<N(T)> &transform){
std::vector<N> b(a.size());
LL i = 0;
for (T x : a){
b[i] = transform(x);
i++;
}
return b;
}
template<typename N, typename M, typename R>
std::vector<R> zip(const std::vector<N> &a, const std::vector<M> &b, const std::function<R(N,M)> &transform){
LL n = std::min(a.size(),b.size());
std::vector<R> res(n);
for (LL i = 0; i < n; i++){
res[i] = transform(a[i],b[i]);
}
return res;
}
template<typename T, typename N>
std::vector<N> convertVec(const std::vector<T> &a){
std::vector<N> b(a.size());
LL i = 0;
for (T x : a){
b[i] = x;
i++;
}
return b;
}
template<typename T>
std::vector<T> reverse(const std::vector<T> &a){
std::vector<T> b(a.size());
LL i = 0;
for (T x : a){
b[a.size()-1-i] = x;
i++;
}
return b;
}
template<typename T, typename R>
R reduce(const std::vector<T> &arr, R init, const std::function<R(const R,const T)> &transform){
R current = init;
for (LL idx = 0; idx < (LL)arr.size(); idx++){
current = transform(current,arr[idx]);
};
return current;
}
template<typename T>
T max(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::max<T>)));}
template<typename T>
T min(const std::vector<T> &arr){return reduce(arr, arr[0], static_cast<std::function<T(const T,const T)>>(static_cast<const T& (*)(const T&, const T&)>(std::min<T>)));}
template<typename T>
std::function<T(const T,const T)> add(){return [](T a,T b){return a+b;};}
template<typename T>
std::function<T(const T,const T)> modAdd(T mod){return [mod](T a,T b){return (((a+b)%mod)+mod)%mod;};}
template<typename T, typename R>
std::function<R(const R,const T)> mulAdd(R mul){return [mul](R a,T b){return a+b*mul;};}
template<typename T>
T sum(const std::vector<T> &arr){return reduce(arr, 0, add<T>());}
template<typename T>
T avg(const std::vector<T> &arr){return reduce(arr, 0.0, mulAdd<double,T>(1.0/arr.size()));}
template<typename T>
T binarySearch(T min, T max, const std::function<bool(T)> &leq){
if (min == max) return max;
T guess = (min+max)/2;
if (leq(guess)){
return binarySearch(min,guess,leq);
}else{
return binarySearch(guess+1,max,leq);
}
}
template<typename T>
T binarySearchDecending(T min, T max, const std::function<bool(T)> &leq){
std::function<bool(T)> gt = [leq](T x){
return !leq(x);
};
return binarySearch(min,max+1, gt)-1;
}
template<typename T>
std::vector<T> cloneVec(std::vector<T> a){return a;}
template<typename T>
std::vector<T> padding(const std::vector<T> &initial, T num, LL start, LL end){
std::vector<T> arr(start+initial.size()+end);
for (LL i = 0; i < start; i++){
arr[i] = num;
}
for (LL i = 0; i < (LL)initial.size(); i++){
arr[start+i] = initial[i];
}
for (LL i = 0; i < end; i++){
arr[start+initial.size()+i] = num;
}
return arr;
}
template<typename T>
LL findMax(LL start, LL end, const std::function<T(LL)> &maxHeuristic){
T initialGuess = maxHeuristic(start);
LL index = start;
for (LL i = start; i <= end; i++){
if (initialGuess < maxHeuristic(i)){
initialGuess = maxHeuristic(i);
index = i;
}
}
return index;
}
template<typename T>
void operateOnMax(LL start, LL end, const std::function<T(LL)> &maxHeuristic, const std::function<void(LL)> &found){
found(findMax(start,end,maxHeuristic));
}
template<typename T>
void stackOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
std::stack<T> stack;
for (auto x : init){
stack.push(x);
}
while (!stack.empty()){
T next = stack.top();
stack.pop();
std::vector<T> nextSteps = operate(next);
for (T a : nextSteps){
stack.push(a);
}
}
}
template<typename T>
void queueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
std::queue<T> que;
for (auto x : init){
que.push(x);
}
while (!que.empty()){
T next = que.front();
que.pop();
std::vector<T> nextSteps = operate(next);
for (T a : nextSteps){
que.push(a);
}
}
}
template<typename T>
void priorityQueueOperate(std::vector<T> init, const std::function<std::vector<T>(T)> operate){
std::priority_queue<T> que;
for (auto x : init){
que.push(x);
}
while (!que.empty()){
T next = que.top();
que.pop();
std::vector<T> nextSteps = operate(next);
for (T a : nextSteps){
que.push(a);
}
}
}
template<typename T>
void recursiveVectorSplit(LL start, LL end, LL distl, LL distr, const std::function<T(LL)> &maxHeuristic, const std::function<void(LL)> &found){
if (start == end){
return found(start);
}else if (end < start){
return;
}
std::tuple<LL,LL> range = {start,end};
std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> splitter = [distl, distr,&maxHeuristic,&found](std::tuple<LL,LL> range){
auto [start,end] = range;
LL idx = findMax(start, end, maxHeuristic);
found(idx);
std::vector<std::tuple<LL,LL>> next;
if (idx+distl+1 <= end){
next.push_back({idx+distl+1,end});
}
if (start <= idx-distr-1){
next.push_back({start, idx-distr-1});
}
return next;
};
stackOperate({range},splitter);
}
template<typename T>
std::vector<T> dynamicallyComputableList(LL n, std::function<T(std::vector<T>&,LL)> next){
std::vector<T> arr(n);
for (LL i = 0; i < n; i++){
arr[i] = next(arr,i);
}
return arr;
}
template<typename T>
LL indexOfBinarySearch(const std::vector<T> &arr, const T &find){
return binarySearch((LL)0,(LL)arr.size()-1,(std::function<bool(LL)>)[&arr, &find](LL guess){return find <= arr[guess];});
}
template<typename T>
std::unordered_map<T, LL> indexCompress(const std::vector<T> &arr){
std::unordered_map<T, LL> compressed;
LL i = 0;
for (T x : arr){
if (compressed.find(x) != compressed.end()) compressed[x] = i++;
}
return compressed;
}
template<typename... Ts>
std::tuple<std::vector<std::tuple<LL,Ts...>>, std::vector<LL>> edgeIndexing(int n, std::vector<std::tuple<LL,Ts...>> edges){
sorted(edges);
std::vector<LL> edgeIndex(n+1);
{
LL j = 0;
for (LL i = 0; i < (LL)edges.size(); i++) {
auto a = std::get<0>(edges[i]);
while (j <= a){
edgeIndex[j++] = i;
}
}
while (j < n){
edgeIndex[j++] = edges.size();
}
edgeIndex[n] = edges.size();
}
return {edges,edgeIndex};
}
template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPathDirected(const LL n, std::vector<std::tuple<LL, LL, T>> edgesInit, LL start){
//assumes all paths are between 0 <= c < n
//assumes 0 indexing
std::vector<LL> path(n);
std::vector<bool> edgeUpdated(n);
std::vector<T> distance(n);
for (LL i = 0; i < n; i++) path[i] = i;
for (LL i = 0; i < n; i++) edgeUpdated[i] = true;
edgeUpdated[start] = false;
for (LL i = 0; i < n; i++) distance[i] = std::numeric_limits<T>::max()/4;
distance[start] = 0;
auto [edges,edgeIndex] = edgeIndexing(n,edgesInit);
std::function<std::vector<std::tuple<LL,LL>>(std::tuple<LL,LL>)> func = [&distance,&edgeIndex,&edges,&path,&edgeUpdated](std::tuple<LL,LL> propagateW){
auto& [weight,propagate] = propagateW;
std::vector<std::tuple<LL,LL>> next;
if (distance[propagate] != -weight) return next;
if (edgeUpdated[propagate]) return next;
for (LL i = edgeIndex[propagate]; i < edgeIndex[propagate+1]; i++){
auto& [a, b, w] = edges[i];
if (distance[a]+w < distance[b]){
//if (std::min(distance[a],w) > distance[b]){
next.push_back({-(distance[a]+w),b});
//next.push_back({std::min(distance[a],w),b});
distance[b] = std::min(distance[a],w);
path[b] = a;
edgeUpdated[b] = false;
}
}
edgeUpdated[propagate] = true;
return next;
};
priorityQueueOperate((std::vector<std::tuple<LL,LL>>){{0,start}},func);
//for (LL i = 0; i < n; i++) {
// bool changed = false;
// for (auto& e : edges) {
// auto& [a, b, w] = e;
// if (!changed) {changed = (distance[b] != std::min(distance[b], distance[a]+w));}
// if (distance[a]+w < distance[b]){
// distance[b] = distance[a]+w;
// path[b] = a;
// }
// }
// if (!changed) break;
// if (changed && i == n){
// return std::tuple((std::vector<T>){},(std::vector<LL>){});
// }
//}
return std::tuple(distance,path);
}
std::vector<LL> pathFromPathMap(std::vector<LL> &map, LL goal){
std::stack<LL> fullPath;
fullPath.push(goal);
while (map[fullPath.top()] != fullPath.top()){
fullPath.push(map[fullPath.top()]);
}
std::vector<LL> p;
while (!fullPath.empty()){
p.push_back(fullPath.top());
fullPath.pop();
}
return p;
}
template<typename T>
std::tuple<std::vector<T>, std::vector<LL>> shortestPath(const LL n, std::vector<std::tuple<LL, LL, T>> &edgesMessy, LL start){
std::vector<std::tuple<LL, LL, T>> edges;
for (auto e : edgesMessy){
auto [a,b,t] = e;
edges.push_back({a,b,t});
edges.push_back({b,a,t});
}
return shortestPathDirected(n, edges, start);
}
template<typename T>
std::vector<T> range(const std::vector<T> &a, LL from, LL to){
std::vector<T> b;
for (LL i = from; i < to; i++){
b.push_back(a[i]);
}
return b;
}
template<typename T>
bool forall(const std::vector<T> &a, std::function<bool(T)> &test){
bool res = true;
for (auto v : a){
res = res & test(v);
}
return res;
}
bool checkValid(std::string s, int i, int j){
return (s[i] == '(') && (s[j] == ')');
}
int main() {
auto s = readStr();
std::vector<bool> reg(s.size());
std::stack<std::tuple<int,int>> ranges;
std::vector<std::tuple<int,int>> rangesStuck;
for (int i = 0; i < s.size()-1; i++){
if ((s[i] == '(') && (s[i+1] == ')')){
ranges.push({i,i+1});
}
}
start:
while (!ranges.empty()){
auto [i,j] = ranges.top();
ranges.pop();
if (i != 0 && j != s.size()-1){
if (checkValid(s,i-1,j+1)){
ranges.push({i-1,j+1});
}else {
rangesStuck.push_back({i,j});
}
}else {
rangesStuck.push_back({i,j});
}
}
sorted(rangesStuck);
std::vector<std::tuple<int,int>> newRanges;
if (rangesStuck.empty()){
println("-1");
exit(0);
}
newRanges.push_back(rangesStuck[0]);
for (int i = 1; i < rangesStuck.size(); i++){
auto& [a,b] = newRanges[newRanges.size()-1];
auto [c,d] = rangesStuck[i];
if (b+1 == c){
newRanges[newRanges.size()-1] = {a,d};
} else {
newRanges.push_back({c,d});
}
}
//println(newRanges);
if (newRanges.size() != rangesStuck.size()){
int a = 0;
std::vector<std::tuple<int,int>> modified;
for (auto i : newRanges) {
while (rangesStuck[a] < i && a < rangesStuck.size()) a++;
if (rangesStuck[a] == i){
modified.push_back(i);
}else {
ranges.push(i);
}
}
rangesStuck = modified;
goto start;
}
//for (int i = 0; i < rangesStuck.size()-1; i++){
// auto [a,b] = rangesStuck[i];
// auto [c,d] = rangesStuck[i+1];
// if (b+1 == c){
// ranges.push({a,d});
// }
//}
//if (!ranges.empty()){
//}
std::string maximum = "-1";
for (auto r : rangesStuck){
auto [a,b] = r;
if (maximum.size() <= b-a+1){
maximum = s.substr(a,b-a+1);
}
}
println(maximum);
return 0;
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| ( |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| )) |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| (( |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| () |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 5
Verdict: ACCEPTED
| input |
|---|
| (() |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 6
Verdict: ACCEPTED
| input |
|---|
| ()() |
| correct output |
|---|
| ()() |
| user output |
|---|
| ()() |
Test 7
Verdict: ACCEPTED
| input |
|---|
| )))) |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 8
Verdict: ACCEPTED
| input |
|---|
| ())( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 9
Verdict: ACCEPTED
| input |
|---|
| (()( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 10
Verdict: ACCEPTED
| input |
|---|
| ))))) |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 11
Verdict: ACCEPTED
| input |
|---|
| ())(() |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 12
Verdict: ACCEPTED
| input |
|---|
| ))(()( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 13
Verdict: ACCEPTED
| input |
|---|
| ()(()) |
| correct output |
|---|
| ()(()) |
| user output |
|---|
| ()(()) |
Test 14
Verdict: ACCEPTED
| input |
|---|
| ()(()) |
| correct output |
|---|
| ()(()) |
| user output |
|---|
| ()(()) |
Test 15
Verdict: ACCEPTED
| input |
|---|
| ()(((( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 16
Verdict: ACCEPTED
| input |
|---|
| (())(())(( |
| correct output |
|---|
| (())(()) |
| user output |
|---|
| (())(()) |
Test 17
Verdict: ACCEPTED
| input |
|---|
| )))((()((( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 18
Verdict: ACCEPTED
| input |
|---|
| (()))((((( |
| correct output |
|---|
| (()) |
| user output |
|---|
| (()) |
Test 19
Verdict: ACCEPTED
| input |
|---|
| ())(()())( |
| correct output |
|---|
| (()()) |
| user output |
|---|
| (()()) |
Test 20
Verdict: ACCEPTED
| input |
|---|
| )))))))))) |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 21
Verdict: ACCEPTED
| input |
|---|
| ())(())(() |
| correct output |
|---|
| (()) |
| user output |
|---|
| (()) |
Test 22
Verdict: ACCEPTED
| input |
|---|
| )((())(()( |
| correct output |
|---|
| (()) |
| user output |
|---|
| (()) |
Test 23
Verdict: ACCEPTED
| input |
|---|
| ()(())()() |
| correct output |
|---|
| ()(())()() |
| user output |
|---|
| ()(())()() |
Test 24
Verdict: ACCEPTED
| input |
|---|
| ()(())((() |
| correct output |
|---|
| ()(()) |
| user output |
|---|
| ()(()) |
Test 25
Verdict: ACCEPTED
| input |
|---|
| ()(((((((( |
| correct output |
|---|
| () |
| user output |
|---|
| () |
Test 26
Verdict: ACCEPTED
| input |
|---|
| ((((((())))))))(((((((((()))))... |
| correct output |
|---|
| (((((())))))(((((((((()))))(((... |
| user output |
|---|
| (((((())))))(((((((((()))))(((... |
Test 27
Verdict: ACCEPTED
| input |
|---|
| )))((()((((((()()))(())(()(())... |
| correct output |
|---|
| ((()((((((()()))(())(()(()))((... |
| user output |
|---|
| ((()((((((()()))(())(()(()))((... |
Test 28
Verdict: ACCEPTED
| input |
|---|
| (()))((((((())(((()))))(())())... |
| correct output |
|---|
| (((())((()()(((((())()))())))(... |
| user output |
|---|
| (((())((()()(((((())()))())))(... |
Test 29
Verdict: ACCEPTED
| input |
|---|
| ())))))))(((((((((())))(()))))... |
| correct output |
|---|
| (((((((((())))(())))))((((((()... |
| user output |
|---|
| (((((((((())))(())))))((((((()... |
Test 30
Verdict: ACCEPTED
| input |
|---|
| ))))))))))))))))))))))))))))))... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 31
Verdict: ACCEPTED
| input |
|---|
| ())(())(()()()(()()()))((())((... |
| correct output |
|---|
| (())(()()()(()()()))((())(((((... |
| user output |
|---|
| (())(()()()(()()()))((())(((((... |
Test 32
Verdict: ACCEPTED
| input |
|---|
| (((((((((()))))))))((((((((())... |
| correct output |
|---|
| ((((((((())))))))) |
| user output |
|---|
| ((((((((())))))))) |
Test 33
Verdict: ACCEPTED
| input |
|---|
| ()(())()()()(((((())))(((()())... |
| correct output |
|---|
| ((((())))(((()()))((())(())())... |
| user output |
|---|
| ((((())))(((()()))((())(())())... |
Test 34
Verdict: ACCEPTED
| input |
|---|
| ()(())((()))(((())))((((()))))... |
| correct output |
|---|
| ()(())((()))(((())))((((()))))... |
| user output |
|---|
| ()(())((()))(((())))((((()))))... |
Test 35
Verdict: ACCEPTED
| input |
|---|
| ()(((((((()(((((((((()())())))... |
| correct output |
|---|
| ()(((((((()(((((((((()())())))... |
| user output |
|---|
| ()(((((((()(((((((((()())())))... |
Test 36
Verdict: ACCEPTED
| input |
|---|
| ((((((((((((())))))))))))))))(... |
| correct output |
|---|
| ((((((((((((((()))))))))))))((... |
| user output |
|---|
| ((((((((((((((()))))))))))))((... |
Test 37
Verdict: ACCEPTED
| input |
|---|
| )))((()((((((()()))(())(()(())... |
| correct output |
|---|
| ((()((((()(()((()(())()((()())... |
| user output |
|---|
| ((()((((()(()((()(())()((()())... |
Test 38
Verdict: ACCEPTED
| input |
|---|
| (()))((((((())(((()))))(())())... |
| correct output |
|---|
| ((((((())(((()))))(())())())((... |
| user output |
|---|
| ((((((())(((()))))(())())())((... |
Test 39
Verdict: ACCEPTED
| input |
|---|
| (()))))))))))))))(((((((((((((... |
| correct output |
|---|
| (((((((((((((((((()))))))((())... |
| user output |
|---|
| (((((((((((((((((()))))))((())... |
Test 40
Verdict: ACCEPTED
| input |
|---|
| ))))))))))))))))))))))))))))))... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 41
Verdict: ACCEPTED
| input |
|---|
| ())(())(()()()(()()()))((())((... |
| correct output |
|---|
| (())(()()()(()()()))((())(((((... |
| user output |
|---|
| (())(()()()(()()()))((())(((((... |
Test 42
Verdict: ACCEPTED
| input |
|---|
| ))))(((((((((((((())))))))))))... |
| correct output |
|---|
| ((((((((((((())))))))))))) |
| user output |
|---|
| ((((((((((((())))))))))))) |
Test 43
Verdict: ACCEPTED
| input |
|---|
| ()(())()()()(((((())))(((()())... |
| correct output |
|---|
| ()()(((()())(()(((()(()(()(()(... |
| user output |
|---|
| ()()(((()())(()(((()(()(()(()(... |
Test 44
Verdict: ACCEPTED
| input |
|---|
| ()(())((()))(((())))((((()))))... |
| correct output |
|---|
| ()(())((()))(((())))((((()))))... |
| user output |
|---|
| ()(())((()))(((())))((((()))))... |
Test 45
Verdict: ACCEPTED
| input |
|---|
| ()(((((((()(((((((((()())())))... |
| correct output |
|---|
| ()(((((((()(((((((((()())())))... |
| user output |
|---|
| ()(((((((()(((((((((()())())))... |
Test 46
Verdict: ACCEPTED
| input |
|---|
| ((((((((((((((((((((((((((((((... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 47
Verdict: ACCEPTED
| input |
|---|
| )))((()((((((()()))(())(()(())... |
| correct output |
|---|
| (((())()((()))()())((((((()(()... |
| user output |
|---|
| (((())()((()))()())((((((()(()... |
Test 48
Verdict: ACCEPTED
| input |
|---|
| (()))((((((())(((()))))(())())... |
| correct output |
|---|
| ((()))(()()((()()((((()()()(()... |
| user output |
|---|
| ((()))(()()((()()((((()()()(()... |
Test 49
Verdict: ACCEPTED
| input |
|---|
| (((((((())))))))))))))))))))))... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 50
Verdict: ACCEPTED
| input |
|---|
| ))))))))))))))))))))))))))))))... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 51
Verdict: ACCEPTED
| input |
|---|
| ())(())(()()()(()()()))((())((... |
| correct output |
|---|
| (((()((((((()(((((()(((()(((()... |
| user output |
|---|
| (((()((((((()(((((()(((()(((()... |
Test 52
Verdict: ACCEPTED
| input |
|---|
| (((((((())))))))))))))))))))))... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 53
Verdict: ACCEPTED
| input |
|---|
| ()(())()()()(((((())))(((()())... |
| correct output |
|---|
| ()(())()()()(((((())))(((()())... |
| user output |
|---|
| ()(())()()()(((((())))(((()())... |
Test 54
Verdict: ACCEPTED
| input |
|---|
| ()(())((()))(((())))((((()))))... |
| correct output |
|---|
| ()(())((()))(((())))((((()))))... |
| user output |
|---|
| ()(())((()))(((())))((((()))))... |
Test 55
Verdict: ACCEPTED
| input |
|---|
| ()(((((((()(((((((((()())())))... |
| correct output |
|---|
| (((())((())(())(((()(()()(()()... |
| user output |
|---|
| (((())((())(())(((()(()()(()()... |
Test 56
Verdict: ACCEPTED
| input |
|---|
| ((((((((((((((((((((((((((((((... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 57
Verdict: ACCEPTED
| input |
|---|
| )))((()((((((()()))(())(()(())... |
| correct output |
|---|
| (((()))(())(())(((((()())()(()... |
| user output |
|---|
| (((()))(())(())(((((()())()(()... |
Test 58
Verdict: ACCEPTED
| input |
|---|
| (()))((((((())(((()))))(())())... |
| correct output |
|---|
| (()()(()((()(((()(((()()()()((... |
| user output |
|---|
| (()()(()((()(((()(((()()()()((... |
Test 59
Verdict: ACCEPTED
| input |
|---|
| ((((((((((((((((((((((((((((((... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 60
Verdict: ACCEPTED
| input |
|---|
| ))))))))))))))))))))))))))))))... |
| correct output |
|---|
| -1 |
| user output |
|---|
| -1 |
Test 61
Verdict: ACCEPTED
| input |
|---|
| ())(())(()()()(()()()))((())((... |
| correct output |
|---|
| (()(()()()(()())(())((((((()((... |
| user output |
|---|
| (()(()()()(()())(())((((((()((... |
Test 62
Verdict: ACCEPTED
| input |
|---|
| ))))))))))))))))))))))))))))))... |
| correct output |
|---|
| ((((((((((((((((((((((((((((((... |
| user output |
|---|
| ((((((((((((((((((((((((((((((... |
Test 63
Verdict: ACCEPTED
| input |
|---|
| ()(())()()()(((((())))(((()())... |
| correct output |
|---|
| (()()((((())()()())())))((())(... |
| user output |
|---|
| (()()((((())()()())())))((())(... |
Test 64
Verdict: ACCEPTED
| input |
|---|
| ()(())((()))(((())))((((()))))... |
| correct output |
|---|
| ()(())((()))(((())))((((()))))... |
| user output |
|---|
| ()(())((()))(((())))((((()))))... |
Test 65
Verdict: ACCEPTED
| input |
|---|
| ()(((((((()(((((((((()())())))... |
| correct output |
|---|
| ()(((((()()))()))()(())(((()((... |
| user output |
|---|
| ()(((((()()))()))()(())(((()((... |
