QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#298258#7894. Many Many Headsucup-team987#AC ✓10ms4052kbC++234.8kb2024-01-05 21:41:502024-01-05 21:41:50

Judging History

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

  • [2024-01-05 21:41:50]
  • 评测
  • 测评结果:AC
  • 用时:10ms
  • 内存:4052kb
  • [2024-01-05 21:41:50]
  • 提交

answer

#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

namespace {

void solve() {
  std::string s;
  scan(s);
  const int n = len(s);
  int c = 0;
  for (const int i : rep(n)) {
    const bool f = s[i] == '(' || s[i] == ')';
    const bool g = s[(i + 1) % n] == '(' || s[(i + 1) % n] == ')';
    c += f == g;
  }
  print(c == 2 ? "Yes" : "No");
}

}  // namespace

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t;
  scan(t);
  while (t--) {
    solve();
  }
}

#else  // __INCLUDE_LEVEL__

#include <bits/stdc++.h>

template <class T, class U = T>
bool chmin(T& x, U&& y) {
  return y < x && (x = std::forward<U>(y), true);
}

template <class T, class U = T>
bool chmax(T& x, U&& y) {
  return x < y && (x = std::forward<U>(y), true);
}

template <class T>
concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;

template <class T>
concept TupleLike = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) {
    is >> e;
  }
  return is;
}

istream& operator>>(istream& is, TupleLike auto&& t) {
  return apply([&](auto&... xs) -> istream& { return (is >> ... >> xs); }, t);
}

ostream& operator<<(ostream& os, Range auto&& r) {
  string_view sep = "";
  for (auto&& e : r) {
    os << exchange(sep, " ") << e;
  }
  return os;
}

ostream& operator<<(ostream& os, TupleLike auto&& t) {
  const auto f = [&](auto&... xs) -> ostream& {
    [[maybe_unused]] string_view sep = "";
    ((os << exchange(sep, " ") << xs), ...);
    return os;
  };
  return apply(f, t);
}

#define DEF_INC_OR_DEC(op) \
  auto& operator op(Range auto&& r) { \
    for (auto&& e : r) { \
      op e; \
    } \
    return r; \
  } \
  auto& operator op(TupleLike auto&& t) { \
    apply([](auto&... xs) { (op xs, ...); }, t); \
    return t; \
  }

DEF_INC_OR_DEC(++)
DEF_INC_OR_DEC(--)

#undef DEF_INC_OR_DEC

}  // namespace std

void scan(auto&&... xs) { std::cin >> std::tie(xs...); }
void print(auto&&... xs) { std::cout << std::tie(xs...) << '\n'; }

#define FWD(...) static_cast<decltype(__VA_ARGS__)&&>(__VA_ARGS__)

template <class F>
class fix {
 public:
  explicit fix(F f) : f_(std::move(f)) {}

  decltype(auto) operator()(auto&&... xs) const { return f_(std::ref(*this), FWD(xs)...); }

 private:
  F f_;
};

template <class T>
concept LambdaExpr = std::is_placeholder_v<std::remove_cvref_t<T>> != 0 ||
                     std::is_bind_expression_v<std::remove_cvref_t<T>>;

auto operator++(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)++; }, FWD(x));
}

auto operator--(LambdaExpr auto&& x, int) {
  return std::bind([](auto&& x) -> decltype(auto) { return FWD(x)--; }, FWD(x));
}

#define DEF_UNARY_OP(op) \
  auto operator op(LambdaExpr auto&& x) { \
    return std::bind([](auto&& x) -> decltype(auto) { return op FWD(x); }, FWD(x)); \
  }

DEF_UNARY_OP(++)
DEF_UNARY_OP(--)
DEF_UNARY_OP(+)
DEF_UNARY_OP(-)
DEF_UNARY_OP(~)
DEF_UNARY_OP(!)
DEF_UNARY_OP(*)
DEF_UNARY_OP(&)

#undef DEF_UNARY_OP

#define DEF_BINARY_OP(op) \
  template <class T1, class T2> \
    requires LambdaExpr<T1> || LambdaExpr<T2> \
  auto operator op(T1&& x, T2&& y) { \
    return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x) op FWD(y); }, \
                     FWD(x), FWD(y)); \
  }

DEF_BINARY_OP(+=)
DEF_BINARY_OP(-=)
DEF_BINARY_OP(*=)
DEF_BINARY_OP(/=)
DEF_BINARY_OP(%=)
DEF_BINARY_OP(^=)
DEF_BINARY_OP(&=)
DEF_BINARY_OP(|=)
DEF_BINARY_OP(<<=)
DEF_BINARY_OP(>>=)
DEF_BINARY_OP(+)
DEF_BINARY_OP(-)
DEF_BINARY_OP(*)
DEF_BINARY_OP(/)
DEF_BINARY_OP(%)
DEF_BINARY_OP(^)
DEF_BINARY_OP(&)
DEF_BINARY_OP(|)
DEF_BINARY_OP(<<)
DEF_BINARY_OP(>>)
DEF_BINARY_OP(==)
DEF_BINARY_OP(!=)
DEF_BINARY_OP(<)
DEF_BINARY_OP(>)
DEF_BINARY_OP(<=)
DEF_BINARY_OP(>=)
DEF_BINARY_OP(&&)
DEF_BINARY_OP(||)

#undef DEF_BINARY_OP

template <class T1, class T2>
  requires LambdaExpr<T1> || LambdaExpr<T2>
auto at(T1&& x, T2&& y) {
  return std::bind([](auto&& x, auto&& y) -> decltype(auto) { return FWD(x)[FWD(y)]; }, FWD(x),
                   FWD(y));
}

template <int I>
auto get(LambdaExpr auto&& x) {
  return std::bind([](auto&& x) -> decltype(auto) { return std::get<I>(FWD(x)); }, FWD(x));
}

inline auto rep(int l, int r) { return std::views::iota(std::min(l, r), r); }
inline auto rep(int n) { return rep(0, n); }
inline auto rep1(int l, int r) { return rep(l, r + 1); }
inline auto rep1(int n) { return rep(1, n + 1); }

#define len(...) static_cast<int>(ranges::distance(__VA_ARGS__))

using namespace std::literals;
using namespace std::placeholders;

namespace ranges = std::ranges;
namespace views = std::views;

using i64 = std::int64_t;

#endif  // __INCLUDE_LEVEL__

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3796kb

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

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

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: 8ms
memory: 3604kb

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: 4ms
memory: 3548kb

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: 10ms
memory: 3552kb

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: 4ms
memory: 3576kb

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: 7ms
memory: 3516kb

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

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: 7ms
memory: 3592kb

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: 7ms
memory: 3520kb

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: 6ms
memory: 3500kb

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: 6ms
memory: 3612kb

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: 6ms
memory: 3752kb

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: 6ms
memory: 3520kb

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: 6ms
memory: 3524kb

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: 5ms
memory: 3592kb

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: 5ms
memory: 3580kb

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: 5ms
memory: 3496kb

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: 4ms
memory: 3808kb

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: 4ms
memory: 3752kb

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: 3ms
memory: 4052kb

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: 3ms
memory: 4016kb

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