QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#314008 | #7894. Many Many Heads | ExplodingKonjac | AC ✓ | 21ms | 3988kb | C++14 | 5.1kb | 2024-01-25 11:12:22 | 2024-01-25 11:12:22 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define OPENIOBUF
namespace FastIO
{
class FastIOBase
{
protected:
#ifdef OPENIOBUF
static const int BUFSIZE=1<<16;
char buf[BUFSIZE+1];
int buf_p=0;
#endif
FILE *target;
FastIOBase(FILE *f): target(f){}
~FastIOBase()=default;
public:
#ifdef OPENIOBUF
virtual void flush()=0;
#endif
};
class FastOutput final: public FastIOBase
{
public:
FastOutput(FILE *f=stdout): FastIOBase(f) {}
#ifdef OPENIOBUF
~FastOutput() { flush(); }
void flush() { fwrite(buf,1,buf_p,target),buf_p=0; }
#endif
void put(char x)
{
#ifdef OPENIOBUF
if(buf[buf_p++]=x,buf_p==BUFSIZE) flush();
#else
putc(x,target);
#endif
}
FastOutput &operator <<(char x)
{ return put(x),*this; }
FastOutput &operator <<(const char *s)
{ for(;*s;put(*(s++)));return *this; }
FastOutput &operator <<(const std::string &s)
{ return (*this)<<s.c_str(); }
template<typename T>
std::enable_if_t<std::is_integral<T>::value,FastOutput&> operator <<(T x)
{
if(x<0) return put('-'),(*this)<<(-x);
char stk[std::numeric_limits<T>::digits10+1],*top=stk;
do *(top++)=x%10+'0',x/=10; while(x);
while(top!=stk) put(*(--top));
return *this;
}
template<typename ...T>
void writesp(T &&...x)
{ std::initializer_list<int>{((*this)<<(x),put(' '),0)...}; }
template<typename ...T>
void writeln(T &&...x)
{ std::initializer_list<int>{((*this)<<(x),put('\n'),0)...}; }
template<typename Iter>
std::enable_if_t<std::is_base_of<
std::forward_iterator_tag,
typename std::iterator_traits<Iter>::iterator_category>
::value> writesp(Iter begin,Iter end)
{ while(begin!=end) (*this)<<*(begin++)<<' '; }
template<typename Iter>
std::enable_if_t<std::is_base_of<
std::forward_iterator_tag,
typename std::iterator_traits<Iter>::iterator_category>
::value> writeln(Iter begin,Iter end)
{ while(begin!=end) (*this)<<*(begin++)<<'\n'; }
}qout;
class FastInput final: public FastIOBase
{
private:
bool __eof;
public:
FastInput(FILE *f=stdin): FastIOBase(f),__eof(false)
#ifdef OPENIOBUF
{ buf_p=BUFSIZE; }
void flush() { buf[fread(buf,1,BUFSIZE,target)]=EOF,buf_p=0; }
bool eof()const { return buf[buf_p]==EOF; }
#else
{}
bool eof()const { return feof(target); }
#endif
char get()
{
if(__eof) return EOF;
#ifdef OPENIOBUF
if(buf_p==BUFSIZE) flush();
char ch=buf[buf_p++];
#else
char ch=getc(target);
#endif
return ~ch?ch:(__eof=true,EOF);
}
void unget(char c)
{
__eof=false;
#ifdef OPENIOBUF
buf[--buf_p]=c;
#else
ungetc(c,target);
#endif
}
explicit operator bool()const { return !__eof; }
FastInput &operator >>(char &x)
{ while(isspace(x=get()));return *this; }
template<typename T>
std::enable_if_t<std::is_integral<T>::value,FastInput&> operator >>(T &x)
{
char ch,sym=0;x=0;
while(isspace(ch=get()));
if(__eof) return *this;
if(ch=='-') sym=1,ch=get();
for(;isdigit(ch);x=(x<<1)+(x<<3)+(ch^48),ch=get());
return unget(ch),sym?x=-x:x,*this;
}
FastInput &operator >>(char *s)
{
while(isspace(*s=get()));
if(__eof) return *this;
for(;!isspace(*s) && !__eof;*(++s)=get());
return unget(*s),*s='\0',*this;
}
FastInput &operator >>(std::string &s)
{
char str_buf[(1<<8)+1]={0},*p=str_buf;
char *const buf_end=str_buf+(1<<8);
while(isspace(*p=get()));
if(__eof) return *this;
for(s.clear(),p++;;p=str_buf)
{
for(;p!=buf_end && !isspace(*p=get()) && !__eof;p++);
if(p!=buf_end) break;
s.append(str_buf);
}
unget(*p),*p='\0',s.append(str_buf);
return *this;
}
template<typename ...T>
void read(T &&...x)
{ std::initializer_list<int>{((*this)>>(x),0)...}; }
template<typename Iter>
std::enable_if_t<std::is_base_of<
std::forward_iterator_tag,
typename std::iterator_traits<Iter>::iterator_category>
::value> read(Iter begin,Iter end)
{ while(begin!=end) (*this)>>*(begin++); }
}qin;
} // namespace FastIO
using FastIO::qin,FastIO::qout;
using LL=long long;
using LD=long double;
using UI=unsigned int;
using ULL=unsigned long long;
#ifndef DADALZY
#define FILEIO(file) freopen(file".in","r",stdin),freopen(file".out","w",stdout)
#define LOG(...) [](auto...){}(__VA_ARGS__)
#else
#define FILEIO(file)
#define LOG(...) fprintf(stderr,__VA_ARGS__)
#endif
int T,n;
string s1,s2,s3;
inline int getType(char ch)
{ return ch=='(' || ch==')'; }
int main()
{
qin>>T;
while(T--)
{
qin>>s1,n=s1.size();
stack<char> stk;
for(auto &ch: s1)
{
int t=getType(ch);
if(stk.empty() || t!=getType(stk.top()))
stk.push(ch),s2+="[("[t];
else stk.pop(),s2+="])"[t];
}
int len=0;
for(int i=1;i<n;i++)
if(getType(s2[i])==getType(s2[i-1]))
{ len=i;break; }
int t=getType(s2[0]);
for(int i=0;i<len;i++)
s3.push_back("[("[t^(i&1)]);
for(int i=len-1;i>=0;i--)
s3.push_back("])"[t^(i&1)]);
for(int i=0;i<n/2-len;i++)
s3.push_back("(["[t^(i&1)]);
for(int i=n/2-len-1;i>=0;i--)
s3.push_back(")]"[t^(i&1)]);
qout<<(s2==s3?"Yes":"No")<<'\n';
// cleaning
s1.clear(),s2.clear(),s3.clear();
}
return 0;
}
/*
1
(([([[([
*/
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3552kb
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: 3484kb
input:
2 (([([[([ ]]))])]])]
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #3:
score: 0
Accepted
time: 4ms
memory: 3844kb
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: 14ms
memory: 3916kb
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: 14ms
memory: 3640kb
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: 21ms
memory: 3908kb
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: 17ms
memory: 3868kb
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: 16ms
memory: 3704kb
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: 12ms
memory: 3716kb
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: 9ms
memory: 3904kb
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: 12ms
memory: 3596kb
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: 12ms
memory: 3700kb
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: 7ms
memory: 3864kb
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: 12ms
memory: 3648kb
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: 11ms
memory: 3676kb
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: 11ms
memory: 3636kb
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: 12ms
memory: 3924kb
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: 12ms
memory: 3712kb
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: 7ms
memory: 3696kb
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: 10ms
memory: 3644kb
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: 10ms
memory: 3664kb
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: 10ms
memory: 3780kb
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: 9ms
memory: 3988kb
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