QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#68814	#5108. Prehistoric Programs	chenshi^#	WA	9ms	3984kb	C++14	676b	2022-12-21 08:46:50	2022-12-21 08:46:52

Judging History

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

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

[2022-12-21 08:46:52]
评测

测评结果：WA
用时：9ms
内存：3984kb

查看

[2022-12-21 08:46:50]
提交

answer

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int o=1e6+10;
int n,a[o],b[o],p[o],len,sm;char s[o*10];
inline bool cmp(int A,int B){
	if((a[A]>0)^(a[B]>0)) return a[A]>0;
	if(a[A]>0) return b[A]>b[B];
	return b[A]<b[B];
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;p[i]=i,++i){
		scanf("%s",s+1);len=strlen(s+1);
		for(int j=1;j<=len;b[i]=min(b[i],a[i]),++j)
			if(s[j]=='(') ++a[i];
			else --a[i];
	}
	sort(p+1,p+n+1,cmp);
	for(int i=1;i<=n;++i)
		if(sm+b[p[i]]<0){printf("impossible");return 0;}
		else sm+=a[p[i]];
	if(sm) printf("impossible");
	else for(int i=1;i<=n;++i) printf("%d\n",p[i]); 
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 9ms

memory: 3984kb

input:

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

output:

result:

ok good plan

Test #2:

score: 0

Accepted

time: 1ms

memory: 3580kb

input:

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

output:

result:

ok good plan

Test #3:

score: 0

Accepted

time: 1ms

memory: 1596kb

input:

2
()
()

output:

1
2

result:

ok good plan

Test #4:

score: 0

Accepted

time: 1ms

memory: 1692kb

input:

2
((
))

output:

1
2

result:

ok good plan

Test #5:

score: 0

Accepted

time: 1ms

memory: 1540kb

input:

2
)(
()

output:

impossible

result:

ok impossible

Test #6:

score: 0

Accepted

time: 1ms

memory: 1600kb

input:

3
()
(
)

output:

2
3
1

result:

ok good plan

Test #7:

score: 0

Accepted

time: 1ms

memory: 1648kb

input:

3
)(
(
)

output:

2
1
3

result:

ok good plan

Test #8:

score: 0

Accepted

time: 1ms

memory: 1660kb

input:

5
))(
(()
)(
(
)

output:

result:

ok good plan

Test #9:

score: 0

Accepted

time: 1ms

memory: 1692kb

input:

3
((
))())
(

output:

1
3
2

result:

ok good plan

Test #10:

score: 0

Accepted

time: 1ms

memory: 1720kb

input:

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

output:

impossible

result:

ok impossible

Test #11:

score: 0

Accepted

time: 1ms

memory: 1728kb

input:

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

output:

result:

ok good plan

Test #12:

score: -100

Wrong Answer

time: 0ms

memory: 1724kb

input:

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

output:

impossible

result:

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