답안 #57713 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
57713	2018-07-15T21:45:29 Z	ksun48	Security Gate (JOI18_security_gate)	C++14	12 / 100	5000 ms	1008 KB

securitygate

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

const LL MOD = 1000000007;

LL check(string s){
	vector<int> psums(1,0);
	for(int j = 0; j < s.size(); j++){
		if(s[j] == '('){
			psums.push_back(psums[psums.size() - 1] + 1);
		} else {
			psums.push_back(psums[psums.size() - 1] - 1);			
		}
	}
	int laste = psums.size() - 1;
	while(laste > 0 && psums[laste-1] >= psums[psums.size()-1]){
		laste--;
	}
	map<int,vector<int> > endlists;
	for(int j = laste; j <= psums.size() - 1; j++){
		endlists[psums[j]].push_back(j);
	}
	int a = psums[psums.size() - 1] / 2;
	for(int j = 0; j < psums.size(); j++){
		if(psums[j] < 0) break;
		int need = psums[j] + a;
		vector<int>& z = endlists[need];
		int idx = lower_bound(z.begin(), z.end(), j) - z.begin();
		if(idx >= z.size()) continue;
		int e = z[idx];
		// check if all elements in [j,e] are <= 
		int ok = 1;
		for(int i = j; i <= e; i++){
			if(psums[i] > 2 * psums[j]){
				ok = 0;
				break;
			}
		}
		if(ok){
			return 1;
		}
	}
	return 0;
}

LL cnt(string s, int idx){
	if(idx == s.size()) return check(s);
	if(s[idx] != 'x'){
		return cnt(s, idx + 1);
	}
	string s1 = s;
	string s2 = s;
	s1[idx] = '(';
	s2[idx] = ')';
	return (cnt(s1, idx + 1) + cnt(s2, idx + 1)) % MOD;
}
int main(){
	int n;
	string s;
	cin >> n >> s;
	if(n % 2 == 1){
		cout << 0 << '\n';
		return 0;
	}
	cout << cnt(s, 0) << '\n';
}

Compilation message

securitygate.cpp: In function 'LL check(std::__cxx11::string)':
securitygate.cpp:9:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < s.size(); j++){
                 ~~^~~~~~~~~~
securitygate.cpp:21:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = laste; j <= psums.size() - 1; j++){
                     ~~^~~~~~~~~~~~~~~~~~~
securitygate.cpp:25:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < psums.size(); j++){
                 ~~^~~~~~~~~~~~~~
securitygate.cpp:30:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(idx >= z.size()) continue;
      ~~~~^~~~~~~~~~~
securitygate.cpp: In function 'LL cnt(std::__cxx11::string, int)':
securitygate.cpp:48:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(idx == s.size()) return check(s);
     ~~~~^~~~~~~~~~~

Subtask #1
4.0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	436 KB	Output is correct
4	Correct	2 ms	436 KB	Output is correct
5	Correct	2 ms	436 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	484 KB	Output is correct
8	Correct	2 ms	524 KB	Output is correct
9	Correct	3 ms	528 KB	Output is correct
10	Correct	2 ms	588 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	708 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	2 ms	772 KB	Output is correct
16	Correct	3 ms	792 KB	Output is correct
17	Correct	3 ms	792 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	436 KB	Output is correct
4	Correct	2 ms	436 KB	Output is correct
5	Correct	2 ms	436 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	484 KB	Output is correct
8	Correct	2 ms	524 KB	Output is correct
9	Correct	3 ms	528 KB	Output is correct
10	Correct	2 ms	588 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	708 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	2 ms	772 KB	Output is correct
16	Correct	3 ms	792 KB	Output is correct
17	Correct	3 ms	792 KB	Output is correct
18	Correct	3 ms	792 KB	Output is correct
19	Correct	3 ms	792 KB	Output is correct
20	Correct	7 ms	792 KB	Output is correct
21	Correct	18 ms	812 KB	Output is correct
22	Correct	12 ms	820 KB	Output is correct
23	Correct	5 ms	820 KB	Output is correct
24	Correct	12 ms	952 KB	Output is correct
25	Correct	3 ms	952 KB	Output is correct
26	Correct	6 ms	952 KB	Output is correct
27	Correct	16 ms	952 KB	Output is correct
28	Correct	10 ms	952 KB	Output is correct
29	Correct	8 ms	952 KB	Output is correct
30	Correct	4 ms	952 KB	Output is correct
31	Correct	27 ms	952 KB	Output is correct

Subtask #3
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	436 KB	Output is correct
4	Correct	2 ms	436 KB	Output is correct
5	Correct	2 ms	436 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	484 KB	Output is correct
8	Correct	2 ms	524 KB	Output is correct
9	Correct	3 ms	528 KB	Output is correct
10	Correct	2 ms	588 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	708 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	2 ms	772 KB	Output is correct
16	Correct	3 ms	792 KB	Output is correct
17	Correct	3 ms	792 KB	Output is correct
18	Correct	3 ms	792 KB	Output is correct
19	Correct	3 ms	792 KB	Output is correct
20	Correct	7 ms	792 KB	Output is correct
21	Correct	18 ms	812 KB	Output is correct
22	Correct	12 ms	820 KB	Output is correct
23	Correct	5 ms	820 KB	Output is correct
24	Correct	12 ms	952 KB	Output is correct
25	Correct	3 ms	952 KB	Output is correct
26	Correct	6 ms	952 KB	Output is correct
27	Correct	16 ms	952 KB	Output is correct
28	Correct	10 ms	952 KB	Output is correct
29	Correct	8 ms	952 KB	Output is correct
30	Correct	4 ms	952 KB	Output is correct
31	Correct	27 ms	952 KB	Output is correct
32	Correct	103 ms	952 KB	Output is correct
33	Correct	37 ms	952 KB	Output is correct
34	Correct	2679 ms	952 KB	Output is correct
35	Correct	112 ms	952 KB	Output is correct
36	Correct	216 ms	952 KB	Output is correct
37	Correct	1168 ms	1008 KB	Output is correct
38	Correct	3455 ms	1008 KB	Output is correct
39	Correct	109 ms	1008 KB	Output is correct
40	Execution timed out	5009 ms	1008 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Subtask #4
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	436 KB	Output is correct
4	Correct	2 ms	436 KB	Output is correct
5	Correct	2 ms	436 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	484 KB	Output is correct
8	Correct	2 ms	524 KB	Output is correct
9	Correct	3 ms	528 KB	Output is correct
10	Correct	2 ms	588 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	708 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	2 ms	772 KB	Output is correct
16	Correct	3 ms	792 KB	Output is correct
17	Correct	3 ms	792 KB	Output is correct
18	Correct	3 ms	792 KB	Output is correct
19	Correct	3 ms	792 KB	Output is correct
20	Correct	7 ms	792 KB	Output is correct
21	Correct	18 ms	812 KB	Output is correct
22	Correct	12 ms	820 KB	Output is correct
23	Correct	5 ms	820 KB	Output is correct
24	Correct	12 ms	952 KB	Output is correct
25	Correct	3 ms	952 KB	Output is correct
26	Correct	6 ms	952 KB	Output is correct
27	Correct	16 ms	952 KB	Output is correct
28	Correct	10 ms	952 KB	Output is correct
29	Correct	8 ms	952 KB	Output is correct
30	Correct	4 ms	952 KB	Output is correct
31	Correct	27 ms	952 KB	Output is correct
32	Correct	103 ms	952 KB	Output is correct
33	Correct	37 ms	952 KB	Output is correct
34	Correct	2679 ms	952 KB	Output is correct
35	Correct	112 ms	952 KB	Output is correct
36	Correct	216 ms	952 KB	Output is correct
37	Correct	1168 ms	1008 KB	Output is correct
38	Correct	3455 ms	1008 KB	Output is correct
39	Correct	109 ms	1008 KB	Output is correct
40	Execution timed out	5009 ms	1008 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	3 ms	436 KB	Output is correct
4	Correct	2 ms	436 KB	Output is correct
5	Correct	2 ms	436 KB	Output is correct
6	Correct	2 ms	484 KB	Output is correct
7	Correct	3 ms	484 KB	Output is correct
8	Correct	2 ms	524 KB	Output is correct
9	Correct	3 ms	528 KB	Output is correct
10	Correct	2 ms	588 KB	Output is correct
11	Correct	2 ms	612 KB	Output is correct
12	Correct	2 ms	704 KB	Output is correct
13	Correct	2 ms	708 KB	Output is correct
14	Correct	3 ms	768 KB	Output is correct
15	Correct	2 ms	772 KB	Output is correct
16	Correct	3 ms	792 KB	Output is correct
17	Correct	3 ms	792 KB	Output is correct
18	Correct	3 ms	792 KB	Output is correct
19	Correct	3 ms	792 KB	Output is correct
20	Correct	7 ms	792 KB	Output is correct
21	Correct	18 ms	812 KB	Output is correct
22	Correct	12 ms	820 KB	Output is correct
23	Correct	5 ms	820 KB	Output is correct
24	Correct	12 ms	952 KB	Output is correct
25	Correct	3 ms	952 KB	Output is correct
26	Correct	6 ms	952 KB	Output is correct
27	Correct	16 ms	952 KB	Output is correct
28	Correct	10 ms	952 KB	Output is correct
29	Correct	8 ms	952 KB	Output is correct
30	Correct	4 ms	952 KB	Output is correct
31	Correct	27 ms	952 KB	Output is correct
32	Correct	103 ms	952 KB	Output is correct
33	Correct	37 ms	952 KB	Output is correct
34	Correct	2679 ms	952 KB	Output is correct
35	Correct	112 ms	952 KB	Output is correct
36	Correct	216 ms	952 KB	Output is correct
37	Correct	1168 ms	1008 KB	Output is correct
38	Correct	3455 ms	1008 KB	Output is correct
39	Correct	109 ms	1008 KB	Output is correct
40	Execution timed out	5009 ms	1008 KB	Time limit exceeded
41	Halted	0 ms	0 KB	-

답안 #57713

Compilation message

Subtask #1 4.0 / 4.0

Subtask #2 8.0 / 8.0

Subtask #3 0 / 18.0

Subtask #4 0 / 43.0

Subtask #5 0 / 27.0

Subtask #1
4.0 / 4.0

Subtask #2
8.0 / 8.0

Subtask #3
0 / 18.0

Subtask #4
0 / 43.0

Subtask #5
0 / 27.0