QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#582490	#5108. Prehistoric Programs	deepthought	WA	5ms	6944kb	C++23	1.2kb	2024-09-22 16:38:48	2024-09-22 16:38:48

Judging History

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

[2024-09-22 16:38:48]
评测

测评结果：WA
用时：5ms
内存：6944kb

查看

[2024-09-22 16:38:48]
提交

answer

#include <bits/stdc++.h>
using namespace std;
pair<int, int> look(const string& s) {
    int fin = 0;
    int minima = 0;
    for(int i = 0; i < s.length(); i++) {
        if(s[i] == '(') fin++;
        else fin--;
        minima = min(fin, minima);
    }
    return {fin, minima};
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n;
    cin >> n;
    vector <string> a(n + 1);
    vector <pair <int, int>> v1;
    vector <pair <int, int>> v2;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        auto ax = look(a[i]);
        int minima = ax.second;
        if(ax.first > 0) {
            v1.push_back({minima, i});
        }
        else {
            v2.push_back({- minima, i});
        }
    }
    vector <int> ans;
    string s = "";
    for(auto x: v1) {
        int idx = x.second;
        s += a[idx];
        ans.push_back(idx);
    }
    for(auto x: v2) {
        int idx = x.second;
        s += a[idx];
        ans.push_back(idx);
    }
    auto bx = look(s);
    if(bx.second >= 0 && bx.first == 0) {
        for(auto x: ans)
            cout << x << '\n';
    }
    else cout << "impossible" << '\n';

}

源文件, 语言: C++23

详细

Test #1:

score: 100

Accepted

time: 5ms

memory: 6944kb

input:

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

output:

result:

ok good plan

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3868kb

input:

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

output:

impossible

result:

wrong answer you didn't find a solution but jury did