QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#265700	#7683. Hard Brackets Problem	fishfishfriedfish^#	WA	39ms	3528kb	C++14	1.6kb	2023-11-25 20:28:37	2023-11-25 20:28:37

Judging History

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

[2023-11-25 20:28:37]
评测

测评结果：WA
用时：39ms
内存：3528kb

查看

[2023-11-25 20:28:37]
提交

answer

#include <bits/stdc++.h>

#define LL long long
#define ull unsigned long long
#define F(i, j, k) for (int i = j; i <= k; ++i)
#define DF(i, j, k) for (int i = j; i >= k; --i)

using namespace std;

template <typename T> inline void read(T &n) {
    T w = 1;
    n = 0;
    char ch = getchar();
    while (!isdigit(ch) && ch != EOF) {
        if (ch == '-') w = -1;
        ch = getchar();
    }
    while (isdigit(ch) && ch != EOF) {
        n = (n << 3) + (n << 1) + (ch & 15);
        ch = getchar();
    }
    n *= w;
}

template <typename T> inline void write(T x) {
    T l = 0;
    ull y = 0;
    if (!x) { putchar(48); return; }
    if (x < 0) { x = -x; putchar('-'); }
    while (x) { y = y * 10 + x % 10; x /= 10; ++l; }
    while (l) { putchar(y % 10 + 48); y /= 10; --l; }
}

template <typename T> inline void writes(T x) {
    write(x);
    putchar(' ');
}

template <typename T> inline void writeln(T x) {
    write(x);
    puts("");
}

template <typename T> inline void checkmax(T &a, T b) { a = a > b ? a : b; }

template <typename T> inline void checkmin(T &a, T b) { a = a < b ? a : b; }

inline void solve() {
    string st, ans = ""; cin >> st;
    int sum = 0;
    for (int i = 0; i < st.size(); i ++) {
        if (st[i] == '(') ++sum, ans += '(';
        else {
            if (sum > 0) --sum;
            else ans += ')';
        }
    }
    if (sum > 0) puts("impossible");
    else cout << ans << '\n';
}

int main() {
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    int t; cin >> t;
    while (t--) solve();
    return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3528kb

input:

3
((()))
(
)))()

output:

(((
impossible
)))(

result:

ok 3 cases (3 test cases)

Test #2:

score: -100

Wrong Answer

time: 39ms

memory: 3508kb

input:

100000
())(()()()
()())()))
)()()()()
())()(())(
((())()))
)(())()))(
)()))())))
)))))(((()
()))((()((
()((()()))
(()())())
())(()))()
(())(())))
))))(()(()
()))(())((
()((())())
()))()))()
()((())())
()()))((()
()))(()))
(()(())))
())((()))
())()((())
(()(())))
()(((()())
))))())))(
((((()()()
(()(...

output:

impossible
(()())
)((((
impossible
(((()
impossible
)())()))
impossible
impossible
(((((
(((()
()(()(
(((())
impossible
impossible
(((((
())())(
(((((
impossible
())(()
(((()
()(((
impossible
(((()
impossible
impossible
impossible
impossible
impossible
()(()(
impossible
impossible
impossible
)))(()(...

result:

wrong answer the result string is incorrect (test case 2)