QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#70677	#5108. Prehistoric Programs	nvmdava	WA	13ms	4156kb	C++20	1.2kb	2023-01-07 14:26:00	2023-01-07 14:27:33

Judging History

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

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

[2023-01-07 14:27:33]
评测

测评结果：WA
用时：13ms
内存：4156kb

查看

[2023-01-07 14:26:00]
提交

answer

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

#define ll long long
#define ff first
#define ss second

vector<pair<pair<int, int>, int> > all;
string s;

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

    int n;
    cin>>n;

    for(int i = 1; i <= n; ++i) {
        cin>>s;
        int mn = 0;
        int end = 0;
        for(char c : s) {
            if(c == '(') ++end;
            else --end;
            mn = min(mn, end);
        }
        all.push_back({{-mn, end}, i});
    }

    sort(all.begin(), all.end(), [](const pair<pair<int, int>, int>& lhs, const pair<pair<int, int>, int>& rhs) {
        if(lhs.ff.ss > 0) {
            if(rhs.ff.ss <= 0) return true;
            return lhs.ff.ff < rhs.ff.ff;
        } else {
            if(rhs.ff.ss > 0) return false;
            return lhs.ff.ff > rhs.ff.ff;
        }
    });

    int cur = 0;
    for(auto& x : all){
        if(cur < x.ff.ff) {
            cout<<"impossible\n";
            return 0;
        }
        cur += x.ff.ss;
    }
    if(cur != 0) {
        cout<<"impossible\n";
        return 0;
    }
    for(auto& x : all){
        cout<<x.ss<<'\n';
    }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 13ms

memory: 4156kb

input:

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

output:

result:

ok good plan

Test #2:

score: 0

Accepted

time: 2ms

memory: 3448kb

input:

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

output:

result:

ok good plan

Test #3:

score: 0

Accepted

time: 2ms

memory: 3464kb

input:

2
()
()

output:

1
2

result:

ok good plan

Test #4:

score: 0

Accepted

time: 0ms

memory: 3456kb

input:

2
((
))

output:

1
2

result:

ok good plan

Test #5:

score: 0

Accepted

time: 2ms

memory: 3364kb

input:

2
)(
()

output:

impossible

result:

ok impossible

Test #6:

score: 0

Accepted

time: 1ms

memory: 3360kb

input:

3
()
(
)

output:

2
3
1

result:

ok good plan

Test #7:

score: 0

Accepted

time: 1ms

memory: 3384kb

input:

3
)(
(
)

output:

2
1
3

result:

ok good plan

Test #8:

score: 0

Accepted

time: 2ms

memory: 3460kb

input:

5
))(
(()
)(
(
)

output:

result:

ok good plan

Test #9:

score: 0

Accepted

time: 3ms

memory: 3364kb

input:

3
((
))())
(

output:

1
3
2

result:

ok good plan

Test #10:

score: 0

Accepted

time: 3ms

memory: 3364kb

input:

6
)
()
()()()
((
)
)

output:

impossible

result:

ok impossible

Test #11:

score: 0

Accepted

time: 1ms

memory: 3396kb

input:

500
(
)
)
(
)(
(
(
)
))(
(
(
(
(
)
)
(
(
)
(
(
)
(
()(()
(
)())
(
(
)
(
)()((
(
)
(
)
)
(
(
(
)
(
(
)
)
)(
(
(
)
)
(
)
(
(
(
)
(
(
())))
(
(
(
)
(
)
)
(
(
)
)
(
(
(
(
(
()
(
(
(
(
(
((
)
(
(
)
(
(
(
)
())
(
(
(
)
(
(
(
)
)
(
)
)
(
)
(
(
(
(
)
(
)
)
)
)
(
)
)))()(
(
)
)
(
)
)(
)
(
)
)
))
(
(
(
(
(
(
...

output:

result:

ok good plan

Test #12:

score: -100

Wrong Answer

time: 0ms

memory: 3464kb

input:

50
)
)
((((()())())))(())(())
()(((()))
(((()))(()
()(((
))
)
)()))(()(()())(((((()
(
)
)
)((
)()((
())()))
(())))()
(((
))))(()
()(())(()))())()
)
)
(
(
(
(
((())()())())))(((())
()(
(()(())()((()
()(((()())))())()(
)
)((()
(
)
((
)
()(
(
(
)
)))((())
)
()))()(((()(()
((
((()))(())(()())(()())())()...

output:

impossible

result:

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