Submission #57716

# Submission time Handle Problem Language Result Execution time Memory
57716 2018-07-15T21:54:00 Z ksun48 Security Gate (JOI18_security_gate) C++14
12 / 100
5000 ms 768 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

const LL MOD = 1000000007;
const int MAXN = 150;
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--;
	}
	vector<int> endlists[2 * MAXN];
	vector<int> psumlists[2 * MAXN];
	for(int j = laste; j <= psums.size() - 1; j++){
		endlists[MAXN + psums[j]].push_back(j);
	}
	for(int j = 0; j <= psums.size() - 1; j++){
		psumlists[MAXN + 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[MAXN + 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 <=
		vector<int>& w = psumlists[MAXN + 2 * psums[j] + 1];
		int idx2 = lower_bound(w.begin(), w.end(), j) - w.begin();
		if(idx2 < w.size() && w[idx2] <= e){
			continue;
		}
		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:22: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() - 1; j++){
                 ~~^~~~~~~~~~~~~~~~~~~
securitygate.cpp:29:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < psums.size(); j++){
                 ~~^~~~~~~~~~~~~~
securitygate.cpp:34:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(idx >= z.size()) continue;
      ~~~~^~~~~~~~~~~
securitygate.cpp:39:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(idx2 < w.size() && w[idx2] <= e){
      ~~~~~^~~~~~~~~~
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);
     ~~~~^~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 3 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 3 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 5 ms 760 KB Output is correct
20 Correct 20 ms 760 KB Output is correct
21 Correct 39 ms 760 KB Output is correct
22 Correct 29 ms 764 KB Output is correct
23 Correct 7 ms 764 KB Output is correct
24 Correct 29 ms 764 KB Output is correct
25 Correct 4 ms 764 KB Output is correct
26 Correct 12 ms 764 KB Output is correct
27 Correct 37 ms 764 KB Output is correct
28 Correct 17 ms 764 KB Output is correct
29 Correct 10 ms 764 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 31 ms 764 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 3 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 5 ms 760 KB Output is correct
20 Correct 20 ms 760 KB Output is correct
21 Correct 39 ms 760 KB Output is correct
22 Correct 29 ms 764 KB Output is correct
23 Correct 7 ms 764 KB Output is correct
24 Correct 29 ms 764 KB Output is correct
25 Correct 4 ms 764 KB Output is correct
26 Correct 12 ms 764 KB Output is correct
27 Correct 37 ms 764 KB Output is correct
28 Correct 17 ms 764 KB Output is correct
29 Correct 10 ms 764 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 31 ms 764 KB Output is correct
32 Correct 259 ms 764 KB Output is correct
33 Correct 76 ms 764 KB Output is correct
34 Correct 4949 ms 768 KB Output is correct
35 Correct 199 ms 768 KB Output is correct
36 Correct 414 ms 768 KB Output is correct
37 Correct 1819 ms 768 KB Output is correct
38 Execution timed out 5021 ms 768 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 3 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 5 ms 760 KB Output is correct
20 Correct 20 ms 760 KB Output is correct
21 Correct 39 ms 760 KB Output is correct
22 Correct 29 ms 764 KB Output is correct
23 Correct 7 ms 764 KB Output is correct
24 Correct 29 ms 764 KB Output is correct
25 Correct 4 ms 764 KB Output is correct
26 Correct 12 ms 764 KB Output is correct
27 Correct 37 ms 764 KB Output is correct
28 Correct 17 ms 764 KB Output is correct
29 Correct 10 ms 764 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 31 ms 764 KB Output is correct
32 Correct 259 ms 764 KB Output is correct
33 Correct 76 ms 764 KB Output is correct
34 Correct 4949 ms 768 KB Output is correct
35 Correct 199 ms 768 KB Output is correct
36 Correct 414 ms 768 KB Output is correct
37 Correct 1819 ms 768 KB Output is correct
38 Execution timed out 5021 ms 768 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 3 ms 484 KB Output is correct
3 Correct 3 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 3 ms 496 KB Output is correct
6 Correct 2 ms 544 KB Output is correct
7 Correct 3 ms 668 KB Output is correct
8 Correct 3 ms 668 KB Output is correct
9 Correct 3 ms 668 KB Output is correct
10 Correct 3 ms 668 KB Output is correct
11 Correct 3 ms 668 KB Output is correct
12 Correct 2 ms 752 KB Output is correct
13 Correct 3 ms 760 KB Output is correct
14 Correct 3 ms 760 KB Output is correct
15 Correct 2 ms 760 KB Output is correct
16 Correct 2 ms 760 KB Output is correct
17 Correct 3 ms 760 KB Output is correct
18 Correct 4 ms 760 KB Output is correct
19 Correct 5 ms 760 KB Output is correct
20 Correct 20 ms 760 KB Output is correct
21 Correct 39 ms 760 KB Output is correct
22 Correct 29 ms 764 KB Output is correct
23 Correct 7 ms 764 KB Output is correct
24 Correct 29 ms 764 KB Output is correct
25 Correct 4 ms 764 KB Output is correct
26 Correct 12 ms 764 KB Output is correct
27 Correct 37 ms 764 KB Output is correct
28 Correct 17 ms 764 KB Output is correct
29 Correct 10 ms 764 KB Output is correct
30 Correct 5 ms 764 KB Output is correct
31 Correct 31 ms 764 KB Output is correct
32 Correct 259 ms 764 KB Output is correct
33 Correct 76 ms 764 KB Output is correct
34 Correct 4949 ms 768 KB Output is correct
35 Correct 199 ms 768 KB Output is correct
36 Correct 414 ms 768 KB Output is correct
37 Correct 1819 ms 768 KB Output is correct
38 Execution timed out 5021 ms 768 KB Time limit exceeded
39 Halted 0 ms 0 KB -