QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#214947	#5108. Prehistoric Programs	dereto	WA	15ms	4028kb	C++14	900b	2023-10-15 01:41:06	2023-10-15 01:41:06

Judging History

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

[2023-10-15 01:41:06]
评测

测评结果：WA
用时：15ms
内存：4028kb

查看

[2023-10-15 01:41:06]
提交

answer

#include<iostream>
#include<string>
#include<vector>
#include<tuple>
#include<algorithm>

using namespace std;

int main(){
	int n;
	cin >> n;
	string str;
	vector<tuple<int, int, int>> arr(n, tuple<int, int, int>(0, 0, 0));
	for(int i=0;i<n;i++){
		cin >> str;
		get<2>(arr[i]) = i + 1;
		for(int j=0;j<str.length();j++){
			if(str[j]=='('){
				get<1>(arr[i]) += 1;
			}else{
				get<1>(arr[i]) -= 1;
			}
			get<0>(arr[i]) = std::min(get<0>(arr[i]), get<1>(arr[i]));
		}
		get<1>(arr[i]) -= get<0>(arr[i]);
	}
	sort(arr.begin(), arr.end(), greater<tuple<int, int, int>>());
	int sum = 0;
	int min = 0;
	for(int i=0;i<n;i++){
		min = std::min(min, sum - get<0>(arr[i]));
		sum += get<1>(arr[i]) + get<0>(arr[i]);
	}
	if(sum != 0 || min < 0) {
		cout << "impossible";
		return 0;
	}
	for(int i=0;i<n;i++){
		cout << get<2>(arr[i]) << '\n';
	}
	
	return 0;
}

源文件, 语言: C++14

詳細信息

Test #1:

score: 100

Accepted

time: 15ms

memory: 4028kb

input:

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

output:

result:

ok good plan

Test #2:

score: 0

Accepted

time: 2ms

memory: 3860kb

input:

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

output:

result:

ok good plan

Test #3:

score: 0

Accepted

time: 0ms

memory: 3796kb

input:

2
()
()

output:

2
1

result:

ok good plan

Test #4:

score: 0

Accepted

time: 0ms

memory: 3684kb

input:

2
((
))

output:

1
2

result:

ok good plan

Test #5:

score: -100

Wrong Answer

time: 0ms

memory: 3576kb

input:

2
)(
()

output:

2
1

result:

wrong answer wrong plan (expected impossible)