답안 #57719 :: oj.uz

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

securitygate

#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;
		vector<int>& z = endlists[MAXN + need];
		int idx = ecuridx[MAXN + need];
		if(idx < z.size()){
			int e = z[idx];
			// check if all elements in [j,e] are <=
			vector<int>& w = psumlists[MAXN + 2 * psums[j] + 1];
			int idx2 = pcuridx[MAXN + 2 * psums[j] + 1];
			if(idx2 < w.size() && w[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] = ')';
	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: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:38:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(idx < z.size()){
      ~~~~^~~~~~~~~~
securitygate.cpp:43:12: 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:57: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	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	3 ms	508 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	668 KB	Output is correct
8	Correct	2 ms	668 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	3 ms	668 KB	Output is correct
12	Correct	3 ms	668 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	2 ms	688 KB	Output is correct
16	Correct	3 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	3 ms	508 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	668 KB	Output is correct
8	Correct	2 ms	668 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	3 ms	668 KB	Output is correct
12	Correct	3 ms	668 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	2 ms	688 KB	Output is correct
16	Correct	3 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	3 ms	688 KB	Output is correct
19	Correct	6 ms	688 KB	Output is correct
20	Correct	21 ms	688 KB	Output is correct
21	Correct	41 ms	688 KB	Output is correct
22	Correct	48 ms	688 KB	Output is correct
23	Correct	10 ms	708 KB	Output is correct
24	Correct	29 ms	708 KB	Output is correct
25	Correct	5 ms	708 KB	Output is correct
26	Correct	9 ms	708 KB	Output is correct
27	Correct	30 ms	708 KB	Output is correct
28	Correct	18 ms	708 KB	Output is correct
29	Correct	12 ms	760 KB	Output is correct
30	Correct	4 ms	760 KB	Output is correct
31	Correct	33 ms	760 KB	Output is correct

Subtask #3
0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	3 ms	508 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	668 KB	Output is correct
8	Correct	2 ms	668 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	3 ms	668 KB	Output is correct
12	Correct	3 ms	668 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	2 ms	688 KB	Output is correct
16	Correct	3 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	3 ms	688 KB	Output is correct
19	Correct	6 ms	688 KB	Output is correct
20	Correct	21 ms	688 KB	Output is correct
21	Correct	41 ms	688 KB	Output is correct
22	Correct	48 ms	688 KB	Output is correct
23	Correct	10 ms	708 KB	Output is correct
24	Correct	29 ms	708 KB	Output is correct
25	Correct	5 ms	708 KB	Output is correct
26	Correct	9 ms	708 KB	Output is correct
27	Correct	30 ms	708 KB	Output is correct
28	Correct	18 ms	708 KB	Output is correct
29	Correct	12 ms	760 KB	Output is correct
30	Correct	4 ms	760 KB	Output is correct
31	Correct	33 ms	760 KB	Output is correct
32	Correct	261 ms	760 KB	Output is correct
33	Correct	48 ms	760 KB	Output is correct
34	Correct	4582 ms	760 KB	Output is correct
35	Correct	217 ms	760 KB	Output is correct
36	Correct	424 ms	764 KB	Output is correct
37	Correct	2000 ms	892 KB	Output is correct
38	Execution timed out	5092 ms	892 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #4
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	3 ms	508 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	668 KB	Output is correct
8	Correct	2 ms	668 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	3 ms	668 KB	Output is correct
12	Correct	3 ms	668 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	2 ms	688 KB	Output is correct
16	Correct	3 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	3 ms	688 KB	Output is correct
19	Correct	6 ms	688 KB	Output is correct
20	Correct	21 ms	688 KB	Output is correct
21	Correct	41 ms	688 KB	Output is correct
22	Correct	48 ms	688 KB	Output is correct
23	Correct	10 ms	708 KB	Output is correct
24	Correct	29 ms	708 KB	Output is correct
25	Correct	5 ms	708 KB	Output is correct
26	Correct	9 ms	708 KB	Output is correct
27	Correct	30 ms	708 KB	Output is correct
28	Correct	18 ms	708 KB	Output is correct
29	Correct	12 ms	760 KB	Output is correct
30	Correct	4 ms	760 KB	Output is correct
31	Correct	33 ms	760 KB	Output is correct
32	Correct	261 ms	760 KB	Output is correct
33	Correct	48 ms	760 KB	Output is correct
34	Correct	4582 ms	760 KB	Output is correct
35	Correct	217 ms	760 KB	Output is correct
36	Correct	424 ms	764 KB	Output is correct
37	Correct	2000 ms	892 KB	Output is correct
38	Execution timed out	5092 ms	892 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

Subtask #5
0 / 27.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	248 KB	Output is correct
2	Correct	2 ms	356 KB	Output is correct
3	Correct	2 ms	432 KB	Output is correct
4	Correct	2 ms	508 KB	Output is correct
5	Correct	3 ms	508 KB	Output is correct
6	Correct	3 ms	508 KB	Output is correct
7	Correct	3 ms	668 KB	Output is correct
8	Correct	2 ms	668 KB	Output is correct
9	Correct	2 ms	668 KB	Output is correct
10	Correct	2 ms	668 KB	Output is correct
11	Correct	3 ms	668 KB	Output is correct
12	Correct	3 ms	668 KB	Output is correct
13	Correct	3 ms	688 KB	Output is correct
14	Correct	2 ms	688 KB	Output is correct
15	Correct	2 ms	688 KB	Output is correct
16	Correct	3 ms	688 KB	Output is correct
17	Correct	2 ms	688 KB	Output is correct
18	Correct	3 ms	688 KB	Output is correct
19	Correct	6 ms	688 KB	Output is correct
20	Correct	21 ms	688 KB	Output is correct
21	Correct	41 ms	688 KB	Output is correct
22	Correct	48 ms	688 KB	Output is correct
23	Correct	10 ms	708 KB	Output is correct
24	Correct	29 ms	708 KB	Output is correct
25	Correct	5 ms	708 KB	Output is correct
26	Correct	9 ms	708 KB	Output is correct
27	Correct	30 ms	708 KB	Output is correct
28	Correct	18 ms	708 KB	Output is correct
29	Correct	12 ms	760 KB	Output is correct
30	Correct	4 ms	760 KB	Output is correct
31	Correct	33 ms	760 KB	Output is correct
32	Correct	261 ms	760 KB	Output is correct
33	Correct	48 ms	760 KB	Output is correct
34	Correct	4582 ms	760 KB	Output is correct
35	Correct	217 ms	760 KB	Output is correct
36	Correct	424 ms	764 KB	Output is correct
37	Correct	2000 ms	892 KB	Output is correct
38	Execution timed out	5092 ms	892 KB	Time limit exceeded
39	Halted	0 ms	0 KB	-

답안 #57719

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