Submission #57722

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

const LL MOD = 1000000007;
const int MAXN = 110;
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];
	int ecuridx[2 * MAXN];
	int pcuridx[2 * MAXN];
	for(int j = laste; j <= psums.size() - 1; j++){
		endlists[MAXN + psums[j]].push_back(j);
		ecuridx[MAXN + psums[j]] = 0;
	}
	for(int j = 0; j <= psums.size() - 1; j++){
		psumlists[MAXN + psums[j]].push_back(j);
		pcuridx[MAXN + psums[j]] = 0;
	}
	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;
		int idx = ecuridx[MAXN + need];
		if(idx < endlists[MAXN + need].size()){
			int e = endlists[MAXN + need][idx];
			// check if all elements in [j,e] are <=
			int idx2 = pcuridx[MAXN + 2 * psums[j] + 1];
			if(idx2 < psumlists[MAXN + 2 * psums[j] + 1].size() && psumlists[MAXN + 2 * psums[j] + 1][idx2] <= e){
			} else {
				return 1;
			}
		}
		if(j >= laste){
			ecuridx[MAXN + psums[j]]++;
		}
		pcuridx[MAXN + psums[j]]++;
	}
	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] = ')';
	for(int z = idx + 1; z <= s.size(); z++){
		if(z == s.size() || s[z] == 'x'){
			return (cnt(s1, z) + cnt(s2, z)) % 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:24:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = laste; j <= psums.size() - 1; j++){
                     ~~^~~~~~~~~~~~~~~~~~~
securitygate.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j <= psums.size() - 1; j++){
                 ~~^~~~~~~~~~~~~~~~~~~
securitygate.cpp:33:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int j = 0; j < psums.size(); j++){
                 ~~^~~~~~~~~~~~~~
securitygate.cpp:37:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(idx < endlists[MAXN + need].size()){
      ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
securitygate.cpp:41:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(idx2 < psumlists[MAXN + 2 * psums[j] + 1].size() && psumlists[MAXN + 2 * psums[j] + 1][idx2] <= e){
       ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
securitygate.cpp: In function 'LL cnt(std::__cxx11::string, int)':
securitygate.cpp:55:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(idx == s.size()) return check(s);
     ~~~~^~~~~~~~~~~
securitygate.cpp:63:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int z = idx + 1; z <= s.size(); z++){
                       ~~^~~~~~~~~~~
securitygate.cpp:64:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(z == s.size() || s[z] == 'x'){
      ~~^~~~~~~~~~~
securitygate.cpp:68:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 3 ms 612 KB Output is correct
17 Correct 2 ms 612 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 3 ms 612 KB Output is correct
17 Correct 2 ms 612 KB Output is correct
18 Correct 2 ms 612 KB Output is correct
19 Correct 3 ms 612 KB Output is correct
20 Correct 15 ms 620 KB Output is correct
21 Correct 29 ms 624 KB Output is correct
22 Correct 23 ms 624 KB Output is correct
23 Correct 5 ms 748 KB Output is correct
24 Correct 23 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 31 ms 748 KB Output is correct
28 Correct 15 ms 748 KB Output is correct
29 Correct 6 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 27 ms 748 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 3 ms 612 KB Output is correct
17 Correct 2 ms 612 KB Output is correct
18 Correct 2 ms 612 KB Output is correct
19 Correct 3 ms 612 KB Output is correct
20 Correct 15 ms 620 KB Output is correct
21 Correct 29 ms 624 KB Output is correct
22 Correct 23 ms 624 KB Output is correct
23 Correct 5 ms 748 KB Output is correct
24 Correct 23 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 31 ms 748 KB Output is correct
28 Correct 15 ms 748 KB Output is correct
29 Correct 6 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 27 ms 748 KB Output is correct
32 Correct 231 ms 748 KB Output is correct
33 Correct 53 ms 748 KB Output is correct
34 Correct 4680 ms 748 KB Output is correct
35 Correct 324 ms 748 KB Output is correct
36 Correct 587 ms 764 KB Output is correct
37 Correct 1896 ms 764 KB Output is correct
38 Execution timed out 5088 ms 764 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 3 ms 612 KB Output is correct
17 Correct 2 ms 612 KB Output is correct
18 Correct 2 ms 612 KB Output is correct
19 Correct 3 ms 612 KB Output is correct
20 Correct 15 ms 620 KB Output is correct
21 Correct 29 ms 624 KB Output is correct
22 Correct 23 ms 624 KB Output is correct
23 Correct 5 ms 748 KB Output is correct
24 Correct 23 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 31 ms 748 KB Output is correct
28 Correct 15 ms 748 KB Output is correct
29 Correct 6 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 27 ms 748 KB Output is correct
32 Correct 231 ms 748 KB Output is correct
33 Correct 53 ms 748 KB Output is correct
34 Correct 4680 ms 748 KB Output is correct
35 Correct 324 ms 748 KB Output is correct
36 Correct 587 ms 764 KB Output is correct
37 Correct 1896 ms 764 KB Output is correct
38 Execution timed out 5088 ms 764 KB Time limit exceeded
39 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 3 ms 516 KB Output is correct
3 Correct 2 ms 516 KB Output is correct
4 Correct 2 ms 516 KB Output is correct
5 Correct 2 ms 516 KB Output is correct
6 Correct 2 ms 516 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 580 KB Output is correct
9 Correct 2 ms 612 KB Output is correct
10 Correct 2 ms 612 KB Output is correct
11 Correct 2 ms 612 KB Output is correct
12 Correct 2 ms 612 KB Output is correct
13 Correct 2 ms 612 KB Output is correct
14 Correct 2 ms 612 KB Output is correct
15 Correct 2 ms 612 KB Output is correct
16 Correct 3 ms 612 KB Output is correct
17 Correct 2 ms 612 KB Output is correct
18 Correct 2 ms 612 KB Output is correct
19 Correct 3 ms 612 KB Output is correct
20 Correct 15 ms 620 KB Output is correct
21 Correct 29 ms 624 KB Output is correct
22 Correct 23 ms 624 KB Output is correct
23 Correct 5 ms 748 KB Output is correct
24 Correct 23 ms 748 KB Output is correct
25 Correct 4 ms 748 KB Output is correct
26 Correct 7 ms 748 KB Output is correct
27 Correct 31 ms 748 KB Output is correct
28 Correct 15 ms 748 KB Output is correct
29 Correct 6 ms 748 KB Output is correct
30 Correct 3 ms 748 KB Output is correct
31 Correct 27 ms 748 KB Output is correct
32 Correct 231 ms 748 KB Output is correct
33 Correct 53 ms 748 KB Output is correct
34 Correct 4680 ms 748 KB Output is correct
35 Correct 324 ms 748 KB Output is correct
36 Correct 587 ms 764 KB Output is correct
37 Correct 1896 ms 764 KB Output is correct
38 Execution timed out 5088 ms 764 KB Time limit exceeded
39 Halted 0 ms 0 KB -