QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#89853	#5108. Prehistoric Programs	_skb_^#	WA	14ms	6208kb	C++14	1.6kb	2023-03-21 16:55:30	2023-03-21 16:55:32

Judging History

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

[2023-08-10 23:21:45]
System Update: QOJ starts to keep a history of the judgings of all the submissions.

[2023-03-21 16:55:32]
评测

测评结果：WA
用时：14ms
内存：6208kb

查看

[2023-03-21 16:55:30]
提交

answer

#include <bits/stdc++.h>

using namespace std;

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

    int n; cin >> n;
    vector <string> a(n);
    vector <pair <pair <int, int>, int>> aa(n);
    auto get_p = [&](string &s) {
        stack <char> st;
        for (int i = 0; i < (int) s.size(); ++i) {
            if (st.empty()) st.push(s[i]);
            else if (st.top() == '(' and s[i] == ')') st.pop();
            else st.push(s[i]);
        }
        int o = 0, c = 0;
        while (!st.empty()) {
            if (st.top() == '(') o++;
            else c++;
            st.pop();
        }    
        return make_pair(o, c);
    };
    vector <pair <pair <int, int>, int>> ax, ay, axyp, axyn;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        aa[i] = {get_p(a[i]), i};
        if (aa[i].first.second == 0) ax.push_back(aa[i]);
        else if (aa[i].first.first == 0) ay.push_back(aa[i]);
        else if (aa[i].first.first - aa[i].first.second <= 0) axyn.push_back(aa[i]);
        else if (aa[i].first.first - aa[i].first.second > 0) axyp.push_back(aa[i]);
    }
    sort(ax.begin(), ax.end());
    sort(ay.begin(), ay.end());
    sort(axyn.begin(), axyn.end(), [&](auto a, auto b) {
        return a.first.second > b.first.second;
    });
    sort(axyp.begin(), axyp.end(), [&](auto a, auto b) {
        return a.first.second < b.first.second;
    });

    for (auto [p, id] : ax) cout << id + 1 << '\n';
    for (auto [p, id] : ay) cout << id + 1 << '\n';
    for (auto [p, id] : axyn) cout << id + 1 << '\n';
    for (auto [p, id] : axyp) cout << id + 1 << '\n';

}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 14ms

memory: 6208kb

input:

50000
(
(
))))()))()(()))()()()))()(((((()(((()))()(((()))((()(())))))(()(
)
(
)
(((
(
(
(
(
(
()
(
)
(
)((())()((
)))))(
(
)
))
)()
(
)
)
)()(
(
(
()
(
)
(
)()((((())()))())(
(
(
)(
(
(
(()())())
)
)
(
(
(
)((())))((())))))))))((((()()))()))))))))((()())()))
)
)()
)
)
)
)
)
())(())))))()(()((()(())...

output:

result:

ok good plan

Test #2:

score: 0

Accepted

time: 4ms

memory: 3508kb

input:

1000
(
))(()))
((((())())))((())(()))(
)(
)
)))
))((()(((((((())()(())()())))(()(())()())))))))((()((()())()())(())))()((()())
)((()()()(())(()))()(())()))(()))))())))))))))))))()))(()()(())(()))())()()))))(())()()()((())(()))(())))))))(()()())()))()())))()()))))))(
)))(((
(
)))()()())))
(
(((())(((...

output:

result:

ok good plan

Test #3:

score: 0

Accepted

time: 2ms

memory: 3496kb

input:

2
()
()

output:

1
2

result:

ok good plan

Test #4:

score: 0

Accepted

time: 0ms

memory: 3344kb

input:

2
((
))

output:

1
2

result:

ok good plan

Test #5:

score: -100

Wrong Answer

time: 0ms

memory: 3472kb

input:

2
)(
()

output:

2
1

result:

wrong answer wrong plan (expected impossible)