QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#578727 | #7894. Many Many Heads | Shunpower | AC ✓ | 43ms | 4008kb | C++14 | 2.2kb | 2024-09-20 21:01:45 | 2024-09-20 21:01:45 |
Judging History
answer
//Author:Leftist / Shunpower
//Rain Temperature & Cloud Moon
//May the force be with you and me.
#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb emplace_back
#define ll long long
#define ull unsigned long long
#define inf INT_MAX
#define uinf INT_MIN
#define pii pair<int,int>
#define pll pair<ll,ll>
#define fr1(i,a,b) for(int i=a;i<=b;i++)
#define fr2(i,a,b) for(int i=a;i>=b;i--)
#define fv(i,p) for(int i=0;i<p.size();i++)
#define ld long double
#define il inline
#define ptc putchar
//Quickly power: ll d=qpow(b,p>>1,k);
//Segment Tree: Memory Limit Excceed
//Segment Tree: Modify()->Pushdown()
//Mod: +M, %M, define int ll
//Mod: Don't use 998244353 instead of 1e9+7 and so on
//Don't solve a problem for too long time.
using namespace std;
const int N=1e5+10;
namespace Shun{
int lowbit(int x){
return x&-x;
}
template <typename T>
inline void read(T &x){
T s=0,w=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-'){
w=-1;
}
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
x=s*w;
}
template <typename T>
inline void write(T x){
if(x<0){
putchar('-');
x=-x;
}
if(x>9){
write(x/10);
}
putchar(x%10+'0');
}
}
using namespace Shun;
int tc;
string s;
int n;
/*
key observation: 四个挨在一起的括号就No
key observation: 两个挨在一起的非独立括号就No
如果只有这两个括号,那么非独立
如果往外两个括号
*/
int ind[N];
bool T(char c){
return c=='['||c==']';
}
void solve(){
cin>>s;
s='@'+s;
n=s.length()-1;
int cnt=0;
fr1(i,2,n){
if(T(s[i])==T(s[i-1])) cnt++;
// i++;
}
if(cnt<=2) cout<<"Yes\n";
else cout<<"No\n";
}
// #define SHUN cute
int main(){
#ifdef SHUN
freopen("sparrow.in","r",stdin);
freopen("sparrow.out","w",stdout);
#endif
ios::sync_with_stdio(false);
cin>>tc;
while(tc--) solve();
return 0;
}
//ETERNAL LOVE FOR LY and SHUN.
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
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: 3560kb
input:
2 (([([[([ ]]))])]])]
output:
Yes No
result:
ok 2 token(s): yes count is 1, no count is 1
Test #3:
score: 0
Accepted
time: 3ms
memory: 3624kb
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: 43ms
memory: 3832kb
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: 8ms
memory: 3600kb
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: 28ms
memory: 3488kb
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: 32ms
memory: 3600kb
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: 35ms
memory: 3600kb
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: 3608kb
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: 35ms
memory: 3488kb
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: 20ms
memory: 3552kb
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: 28ms
memory: 3828kb
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: 8ms
memory: 3616kb
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: 15ms
memory: 3612kb
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: 20ms
memory: 3616kb
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: 3600kb
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: 7ms
memory: 3824kb
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: 3600kb
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: 3564kb
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: 7ms
memory: 3752kb
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: 7ms
memory: 3556kb
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: 2ms
memory: 3684kb
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: 2ms
memory: 4008kb
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