QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#643616	#7894. Many Many Heads	tkt0506	TL	582ms	3856kb	C++14	1.6kb	2024-10-15 22:21:32	2024-10-15 22:21:33

Judging History

你现在查看的是最新测评结果

[2024-10-15 22:21:33]
评测

测评结果：TL
用时：582ms
内存：3856kb

查看

[2024-10-15 22:21:32]
提交

answer

#include <bits/stdc++.h>
using namespace std;

string s, t;
int ans = 0, n, tot1, tot2;

void dfs(int pos, int cnt1, int cnt2, int sum1, int sum2, string t2){
    if(pos == n){
        if(sum1==0 && sum2==0){
            ans++;
            return ;
        }
    }

    if(ans > 1 || sum1 < 0 || sum2 < 0 || cnt1 > tot1/2 || cnt2 > tot2/2)return ;
    if(s[pos] == '('){
        t.push_back('(');
        t2.push_back('(');
        dfs(pos+1, cnt1+1, cnt2, sum1+1, sum2,t2);
        t.pop_back();
        t2.pop_back();
        if(t2.size() && t2.back() == '('){
            t.push_back(')');
            t2.pop_back();
            dfs(pos+1,cnt1,cnt2,sum1-1,sum2,t2);
            t.pop_back();
            t2.push_back('(');
        }
    }else{
        t.push_back('[');
        t2.push_back('[');
        dfs(pos+1, cnt1, cnt2+1, sum1, sum2+1,t2);
        t.pop_back();
        t2.pop_back();
        if(t2.size() && t2.back() == '['){
            t.push_back(']');
            t2.pop_back();
            dfs(pos+1,cnt1,cnt2,sum1,sum2-1,t2);
            t.pop_back();
            t2.push_back('[');
        }
    }
}

void solve(){
    cin >> s;
    n = s.length();
    ans = tot1 = tot2 = 0;
    for(int i=0; i<n; i++){
        if(s[i]==')')s[i] = '(';
        if(s[i]==']')s[i] = '[';
        if(s[i]=='(')tot1++;
        if(s[i]=='[')tot2++;
    }
    if(n > 30){
        cout << "No\n";
        return ;
    }
    dfs(0,0,0,0,0,"");
    if(ans > 1)cout << "No\n";
    else cout << "Yes\n";
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    int t;
    cin >> t;
    while(t--)solve();
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3660kb

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: 3588kb

input:

2
(([([[([
]]))])]])]

output:

Yes
No

result:

ok 2 token(s): yes count is 1, no count is 1

Test #3:

score: 0

Accepted

time: 35ms

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: 32ms

memory: 3856kb

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: 45ms

memory: 3796kb

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: 57ms

memory: 3564kb

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: 61ms

memory: 3596kb

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: 68ms

memory: 3828kb

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: 76ms

memory: 3564kb

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: 92ms

memory: 3640kb

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: 121ms

memory: 3692kb

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: 180ms

memory: 3564kb

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: 298ms

memory: 3632kb

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: 582ms

memory: 3512kb

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: -100

Time Limit Exceeded

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
...