QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#310823 | #7894. Many Many Heads | KiharaTouma | AC ✓ | 9ms | 4124kb | C++14 | 5.9kb | 2024-01-21 18:34:33 | 2024-01-21 18:34:34 |
Judging History
answer
//qoj7894
#include <bits/stdc++.h>
using namespace std; typedef long long ll; namespace FastIO {
#if __cplusplus > 201700
#define INLINE_V inline
#else
#define INLINE_V
#endif
#if (defined(LOCAL) || defined(_WIN32)) && !defined(DISABLE_MMAP)
#define DISABLE_MMAP
#endif
#ifndef DISABLE_MMAP
#include <sys/mman.h>
#endif
INLINE_V constexpr int _READ_SIZE = 1 << 18; INLINE_V static char _read_buffer[_READ_SIZE], *_read_ptr = nullptr, *_read_ptr_end = nullptr;
inline char gc() { if (__builtin_expect(_read_ptr == _read_ptr_end, false)) { _read_ptr = _read_buffer; _read_ptr_end = _read_buffer + fread(_read_buffer, 1, _READ_SIZE, stdin); if (__builtin_expect(_read_ptr == _read_ptr_end, false)) return EOF;} return *_read_ptr++; }
INLINE_V constexpr int _WRITE_SIZE = 1 << 18; INLINE_V static char _write_buffer[_WRITE_SIZE], *_write_ptr = _write_buffer; inline void pc(char c) { *_write_ptr++ = c; if (__builtin_expect(_write_buffer + _WRITE_SIZE == _write_ptr, false)) { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); _write_ptr = _write_buffer; } }
INLINE_V struct _auto_flush { ~_auto_flush() { fwrite(_write_buffer, 1, _write_ptr - _write_buffer, stdout); } } _auto_flush; inline bool _isdigit(char c) { return (c & 16) && c != EOF; } inline bool _isgraph(char c) { return c > 32 && c != EOF; }
template <class T> INLINE_V constexpr bool _is_integer = numeric_limits<T>::is_integer; template <class T> INLINE_V constexpr bool _is_signed = numeric_limits<T>::is_signed; template <class T> INLINE_V constexpr bool _is_unsigned = _is_integer<T> && !_is_signed<T>;
template <> INLINE_V constexpr bool _is_integer<__int128> = true; template <> INLINE_V constexpr bool _is_integer<__uint128_t> = true; template <> INLINE_V constexpr bool _is_signed<__int128> = true; template <> INLINE_V constexpr bool _is_unsigned<__uint128_t> = true;
inline void read(char &c) { do c = gc(); while (!_isgraph(c)); } inline void read_cstr(char *s) { char c = gc(); while (!_isgraph(c)) c = gc(); while (_isgraph(c)) *s++ = c, c = gc(); *s = 0; } inline void read(string &s) { char c = gc(); s.clear(); while (!_isgraph(c)) c = gc(); while (_isgraph(c)) s.push_back(c), c = gc(); }
template <class T, enable_if_t<_is_signed<T>, int> = 0> inline void read(T &x) { char c = gc(); bool f = true; x = 0; while (!_isdigit(c)) { if (c == 45) f = false; c = gc(); }
if (f) while (_isdigit(c)) x = x * 10 + (c & 15), c = gc(); else while (_isdigit(c)) x = x * 10 - (c & 15), c = gc(); } template <class T, enable_if_t<_is_unsigned<T>, int> = 0> inline void read(T &x) { char c = gc(); while (!_isdigit(c)) c = gc(); x = 0; while (_isdigit(c)) x = x * 10 + (c & 15), c = gc(); }
inline void write(char c) { pc(c); } inline void write_cstr(const char *s) { while (*s) pc(*s++); } inline void write(const string &s) { for (char c : s) pc(c); } template <class T, enable_if_t<_is_signed<T>, int> = 0> inline void write(T x) { char buffer[numeric_limits<T>::digits10 + 1]; int digits = 0; if (x >= 0) do buffer[digits++] = (x % 10) | 48, x /= 10; while (x);
else { pc(45); do buffer[digits++] = -(x % 10) | 48, x /= 10; while (x); } while (digits) pc(buffer[--digits]); } template <class T, enable_if_t<_is_unsigned<T>, int> = 0> inline void write(T x) { char buffer[numeric_limits<T>::digits10 + 1]; int digits = 0; do buffer[digits++] = (x % 10) | 48, x /= 10; while (x); while (digits) pc(buffer[--digits]); }
template <int N> struct _tuple_io_helper { template <class... T> static inline void _read(tuple<T...> &x) { _tuple_io_helper<N - 1>::_read(x), read(get<N - 1>(x)); } template <class... T> static inline void _write(const tuple<T...> &x) { _tuple_io_helper<N - 1>::_write(x), pc(32), write(get<N - 1>(x)); } };
template <> struct _tuple_io_helper<1> { template <class... T> static inline void _read(tuple<T...> &x) { read(get<0>(x)); } template <class... T> static inline void _write(const tuple<T...> &x) { write(get<0>(x)); } };
template <class... T> inline void read(tuple<T...> &x) { _tuple_io_helper<sizeof...(T)>::_read(x); } template <class... T> inline void write(const tuple<T...> &x) { _tuple_io_helper<sizeof...(T)>::_write(x); }
template <class T1, class T2> inline void read(pair<T1, T2> &x) { read(x.first), read(x.second); } template <class T1, class T2> inline void write(const pair<T1, T2> &x) { write(x.first), pc(32), write(x.second); }
template <class T1, class... T2> inline void read(T1 &x, T2 &...y) { read(x), read(y...); } template <class... T> inline void read_cstr(char *x, T *...y) { read_cstr(x), read_cstr(y...); }
template <class T1, class... T2> inline void write(const T1 &x, const T2 &...y) { write(x), write(y...); } template <class... T> inline void write_cstr(const char *x, const T *...y) { write_cstr(x), write_cstr(y...); }
template <class T> inline void print(const T &x) { write(x); } inline void print_cstr(const char *x) { write_cstr(x); } template <class T1, class... T2> inline void print(const T1 &x, const T2 &...y) { print(x), pc(32), print(y...); }
template <class... T> inline void print_cstr(const char *x, const T *...y) { print_cstr(x), pc(32), print_cstr(y...); } inline void println() { pc(10); } inline void println_cstr() { pc(10); }
template <class... T> inline void println(const T &...x) { print(x...), pc(10); } template <class... T> inline void printk(const T &...x) { print(x...), pc(32); } template <class... T> inline void println_cstr(const T *...x) { print_cstr(x...), pc(10); } } using namespace FastIO; void solve();int main(){ solve(); return 0; }
const int N = 1e5 + 10;
int T;
string s;
void solve(){
read(T);
while(T--){
read(s);
int n = s.size();
#define cg(x) (x=='['||x==']'?1:0)
bool flg = 1;
for(int i = 0; i + 2 < n; ++ i){
if(cg(s[i]) == cg(s[i+1]) && cg(s[i+1]) == cg(s[i+2])){
flg = 0;
break;
}
}
int cnt = 0;
for(int i = 0; i + 1 < n; ++ i){
if(cg(s[i]) == cg(s[i+1])){
++ cnt;
}
}
if(cnt > 2){
flg = 0;
}
println_cstr((flg ? "Yes" : "No"));
}
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
6 )) ((() [()] ()[()]() ([()]) ([])([])
output:
Yes No Yes No Yes No
result:
ok 6 token(s): yes count is 3, no count is 3
Test #2:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 (([([[([ ]]))])]])]
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #3:
score: 0
Accepted
time: 2ms
memory: 3916kb
input:
15134 ][ )( )([[ [)([ )][) ]])( ([]([] ]]))][ [([](] ()[))] ][(]]( ([()[) ()[](( [)([)( ]]([[)]] )[()])]] ))[](([] ](([((]] ))[)][)[ [)])([(] [()[]))[ )][(]()] [[((]()] ((]])[[) ])(](]]) )]]()[]( ([)[])]) [[)[()]( ([[)[[() [[)([])) [)[[)[() ))[(([)( ()][)[](]] [()]([[([[ )[]))][)][ )]([]([(][ [])])(...
output:
Yes Yes Yes Yes Yes Yes Yes No Yes Yes Yes Yes No Yes No Yes No No Yes Yes No Yes No No Yes No Yes Yes No No Yes No No No No Yes No No No No No No Yes No No Yes Yes No No No Yes No No No No Yes No No No Yes Yes No No Yes No No No No No No Yes No No No No No No No No No No Yes No No No No No No No No...
result:
ok 15134 token(s): yes count is 132, no count is 15002
Test #4:
score: 0
Accepted
time: 2ms
memory: 4068kb
input:
100000 ][[][[ ())))( )()))) ]]][[[ )[]))( ()[[)( )()))) [[[][] [][][] ))[]]] ]]]][[ ][]]][ (][))) ((([]( ][[]]] )([)([ ))()(( [)[[)[ ((())) )(][[] ][[[[[ ()(((( ][][]] ][)()( ]]]]][ (()(() )([((] [][[]] ]][]][ )((()) ][[[[[ [)[[([ (([[)( (((()) )((()( ))()() ()(((( [[][][ ))[])( (((()( ]]][[] ()[[]]...
output:
No No No No No No No No No No No No No No No Yes No Yes No No No No No No No No Yes No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No Yes Yes No No No Yes No No Yes No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No Yes No No No...
result:
ok 100000 token(s): yes count is 12468, no count is 87532
Test #5:
score: 0
Accepted
time: 7ms
memory: 4124kb
input:
100000 ))()()() ][]][][[ [[]]]][] ()(()((( ]][[]]]] ][[[]]]] [[][[][] )((()(() )()]]))( ]]][][[[ [))]]])) (][(())) ]([[)])) (())()(( [[]]]]]] ())((((( ))(((()( ]]]][]]] [](][))) ((()())) [[][[]][ ((]))])) [[]]]][] ))([((]) )([][[][ [][[[][] []][)][) )()(())( )((()()( ]]))((]] )())(()( [[[][[[] (()([...
output:
No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes No No No Yes No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 100000 token(s): yes count is 3122, no count is 96878
Test #6:
score: 0
Accepted
time: 9ms
memory: 4044kb
input:
100000 (())((()() ))])((((([ [[((]()))[ ]](][][[[( [[][][]][] ()([[()))( ()))()))() ][[[[]][[] ]][[[][][[ [])((()))) ][[[[]]][] [][[[]]]]] ][]][[[][] (])][][([( ())()()))) []]][[[[][ ]](][([])( [][[[[[]]] ([)((([[]( )]()](][)) []])[[([() ([()]([][[ ]]][]][[]] [)()(((()[ ([]]][][]) ()())(()(( [][]][[...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No Yes No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No...
result:
ok 100000 token(s): yes count is 1153, no count is 98847
Test #7:
score: 0
Accepted
time: 8ms
memory: 4056kb
input:
83333 ][]]])(()((] [[[])]]([))[ [][]]][[))]] [(()[))[(](( ))((([[)))(( ([)))]]]])[) ][][]][][[[[ ]]][[((][[][ ([[([[([][[( [[))))(]))]( )[))()]()(][ [([[][[])[[] ]())([)[((]) ()(())[[()(( ]))(]](][][] ]()()[)(][[[ ]][][[][[[(( (((()([))()[ )([]([])((]] ][]]]][]][[] ]))[]][]([[( ][[[]]]][]]] ()[)(())...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 83333 token(s): yes count is 248, no count is 83085
Test #8:
score: 0
Accepted
time: 6ms
memory: 4020kb
input:
71428 ))][[[[]][]]][ [)][[][][](][] []))(((]])()(( ]][[)]])])[]([ ([]((([[[][[[[ [[)][))[[[]][) ][[[)[][[)]]][ ([[))([(]])[(( ])[[)[[]][][(( ()))()(((()))( [][[]][]()][[] [(())((][))))[ )(()))))(())() )()(()()))())( ))((((((()))() )()())())))((( [[[)]))])[[]][ )]]))([)([)((( ][][[[[[[[]]]] [[[[[]]]]...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 71428 token(s): yes count is 71, no count is 71357
Test #9:
score: 0
Accepted
time: 5ms
memory: 4036kb
input:
62500 )]((][))()((()[) ][][][[[[][[]][[ )(())((((((()()( (][([))[[()]]))] )(()()))))()((() ][]](([[[][[]])) ((()())()]])[((] (][(][]]]]]))[(( (())())()))((([[ (])(()()()]()([] ][))])()(()()]() [[[([[)]][[]][][ ][]][]]][[[][]]] ([(]]()))))(()[( ))()(()[)))[](]) ()[]()())(((((() ()]()[)(]())([]] (())]...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 62500 token(s): yes count is 14, no count is 62486
Test #10:
score: 0
Accepted
time: 4ms
memory: 4032kb
input:
55555 ))(][([)[](([](]]] ](][[]]][][[(][[[] ((())())()(((()))( )((((((())((()))]] [[]]]][][]]]]][][[ ]]]][][]]]](]()[)[ [][([]([[[[[)(]()[ )])(()()(())]()))) (())))()))(())()() )][())(()])()([()) ][]]][]]](]][]][)] ))(()(()[)(()[()() ]]]]]][[[[][[[]][] )]())[[][)(())][[( ][)()]]([[](([)()) )](][([()...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 55555 token(s): yes count is 3, no count is 55552
Test #11:
score: 0
Accepted
time: 2ms
memory: 4012kb
input:
50000 [[[[[]]]((())][([][[ ((()())())))()())))( )([)(]()(](())))[(() )(](][)))](()(((([[( )((]((((]))([))[(()) ))()()))())(([[))()( ()(()[)((((((((([)(( ]]([[[[)([[]]([)][)[ [)()])([[)[[[[)])()] ](]])[][)][((][([])) ]][[[[]]]][][]]]][[] ()((()())([]())))()( )]]][(][[[[][]]]][]] )(]]]]][)))(]][]]]]] ...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 50000 token(s): yes count is 0, no count is 50000
Test #12:
score: 0
Accepted
time: 5ms
memory: 3984kb
input:
45454 ))[))]((())())([))[]]) ][[]]][)([)]([()]())[) ]][][]][][][]]]][[][[] ]][[]]]]][[[][[[[[[]][ (())())((())())(())))( ][[])[[)[[[]]]][][]][] ]][[]][[][[]][][]]]][[ [(]([()][))[)](([[[[(] ])[]][][([][]([][[[[(] ][[]][][[][]][][[]][[[ )))))(()()()))()))))() (]()[))()(())][((())(( ])([[)[][[[[()[[[[...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 45454 token(s): yes count is 0, no count is 45454
Test #13:
score: 0
Accepted
time: 5ms
memory: 3928kb
input:
41666 [)(()])()))(())))())((() ][][[][]]]]][[]][[])]])] (()))])[[][)(())[()[])][ ]][[][]]]][]][][]][][][] [](](]]][[[][([[][[([[[] ])(][)[](][[])))]])))][] [[][[[][][]]][[[[[[[[][] ]((())))))(())(([[())(([ ())[)()(((())()(()()[)() ][[][]][]][[]]]]]]][][[[ ]]][(][][[[[[[[[))[][]]( [(][[[](]])[]([]]]]...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 41666 token(s): yes count is 0, no count is 41666
Test #14:
score: 0
Accepted
time: 4ms
memory: 4040kb
input:
38461 ]]]]]][[[][[[[[][[[[[[]]]] )]))())([)((])))))[)(]()([ ])())))[((([))()()()]))()( (](()())())(])][((]((()))] [[](][[][][[][([[[[[[][[[[ ([)]([[]](()(][)(([)[]()]( [[]]]]]]]][[]][[][]][[[][[ []](]))))[[)[]]))[([(((][] )[[([((())((()())()((()((] []]][]]]][[][[[[[[[]]]][[[ []][][[][]][)][[])[][[[]...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 38461 token(s): yes count is 0, no count is 38461
Test #15:
score: 0
Accepted
time: 4ms
memory: 3976kb
input:
35714 ]]]])([]]][))][)()[[))(([[)] ]](]][[][[)[]()[][[)[[[(]]() ](]][[]]()(]][]]]][][])((([] [())])([([(((([(]]([)(()([[( []][]][](()[[[]][][[][[][[[) ))))())(()()(()())(()))()()( ]](]())[]]][)]])[(][[]()[[[( (][[[[[[]][[]][[[([][[)[]([[ ))[))[[(())]())(]]((][](([)) [)]()[)((()](]())([])(])(()( ]]][...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 35714 token(s): yes count is 0, no count is 35714
Test #16:
score: 0
Accepted
time: 4ms
memory: 4032kb
input:
33333 [()(()()[)()[])(((([)]((()[)(] )()()())(((((()))(((())()())(( ]][][)(]()]]])]](]])([]]][](([ ()(((()((((())((()(())))()())( ))))((((())[))[()((]()])(])(]) ([[]][]]][][]][]][][])[][[]][] [[][[][][][[][[]]]][]][][][[]] )])[])[[()[]]]([))[[[)[[][])[[ []]][[]]]])(][[][)(][[]][][[[] ]]]]][]([[[](][...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 33333 token(s): yes count is 0, no count is 33333
Test #17:
score: 0
Accepted
time: 4ms
memory: 3944kb
input:
31250 ])[[[[[]](([][(]]][]))[]([]))][) [][][()))[)][[[(](][))]((()])[][ ](]([[[][)(]))[))]())[([]]]]]))] )))(]((()()())())]))))))()))))(( ())()))))[)))(()((())()))([((()( ()()(()))(((((((()))()))())())() [[]][]]]]][[]]][][[][[[]]][[][[[ [[[]][][]]][]][][[]][]][]]][][[] ())(]()[()((](((([)(())()())()...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 31250 token(s): yes count is 0, no count is 31250
Test #18:
score: 0
Accepted
time: 4ms
memory: 4008kb
input:
29411 ]]][[]][][])[](]][[[[[][)()[](])(] ]((]][][[[)[](([[[][[)(]]((([])]]) [[[][[[[[][[]][]][]]]][[][[[[]][]] ))([[[[([)([)())))])((]][]([()))() (()))))())()))))(((()(((()()(()()( [[[)(]][)(((]))])]([[][)()]]]]](][ ))))][([)]]][)(]][])[[][[][((]]][( [)()))(()[()())()((())([()))]())(( ())([)())][(()...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 29411 token(s): yes count is 0, no count is 29411
Test #19:
score: 0
Accepted
time: 4ms
memory: 3928kb
input:
20833 ))(()])))()[])())((([()(([))(([)(())(((]()))[)() ))()()()(((()())))(((()((((()(()(()(())()((((()( ((((()()(])())((()([((](()))()(((())(()))(]()(() ]])(]]))([(()))()(())())([(])(]()(()()())(((]([) ())(()))(())()))(()()())((((((()())()((())(()(() ]][[]][[[][[]]][]][]]]][[][[][]]]]][]][[][[[][[[ ...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 20833 token(s): yes count is 0, no count is 20833
Test #20:
score: 0
Accepted
time: 2ms
memory: 3980kb
input:
16129 )()((())())(())))())(())(())))(()))())())))))((()()(()))(((()) [[))()([((())]]]()][[][()()[[)(](([))[]())(())])()((((())([))[ [[[[][]]]][][][][[[][[[][]]([[([]][[[)][(][[)][)])][)])]])[[[] []](][]([[][[[[([[[]][[[[][])([[[[)[]]][[]][[]][[[[[([[][()[)[ )(())((])))(()()]))()](())((((((((())())))...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 16129 token(s): yes count is 0, no count is 16129
Test #21:
score: 0
Accepted
time: 3ms
memory: 3880kb
input:
10000 ]([][[[][[[][])[[]][]][][]]])[][[(][[[[]]]][]]]][]]][[[][[]][[][][][[][[][]][]][]][]]][[[][]][[[[[][ ])][][([[()))[]]][)[[[][])(])]]]][[(()]([[(]][(]])[][))[][[([[][)[[[](][][[][)])(]]])][]]])](][)](][ ()[((()()))()))()(((]))(()))()))((()()))((()())((][)(()()(((()()()()()([))()())(())(((([))()...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 10000 token(s): yes count is 0, no count is 10000
Test #22:
score: 0
Accepted
time: 4ms
memory: 3936kb
input:
199 (([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[(([[...
output:
No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No No ...
result:
ok 199 token(s): yes count is 0, no count is 199
Test #23:
score: 0
Accepted
time: 4ms
memory: 3956kb
input:
199 [([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([([(...
output:
Yes Yes Yes No No No Yes No Yes Yes No Yes No Yes Yes Yes No No No No No Yes Yes No Yes No No No No No No No No Yes Yes No No Yes Yes No Yes Yes Yes No No No Yes No No Yes Yes No Yes Yes No Yes No No Yes Yes Yes Yes Yes No Yes Yes No No Yes Yes No Yes Yes No Yes No No Yes Yes Yes Yes Yes No Yes Yes ...
result:
ok 199 token(s): yes count is 104, no count is 95
Extra Test:
score: 0
Extra Test Passed