oj.uz

답안 #208975

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
208975 2020-03-12T19:52:49 Z Segtree Security Gate (JOI18_security_gate) C++14
30 / 100
 971 ms 504 KB 
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_set>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
typedef unordered_set<ll> uset;
#define rep(i,n) for(int i=0;i<n;i++)
#define rrep(i,n) for(int i=0;i<=n;i++)
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define all(x) x.begin(),x.end()
#pragma gcc optimize("O3")
#pragma gcc optimize("unroll-loops")
#pragma gcc target("avx2,see4")
ll n;
bool solve2(string s){
	for(int L=0;L<n;L++)for(int R=L;R<n;R++){
		bool ok=1;
		ll rui=0;
		rep(i,n){
			rui+=((s[i]=='(')^(L<=i&&i<=R)?+1:-1);
			ok&=(rui>=0);
		}
		ok&=(rui==0);
		if(ok)return 1;
	}
	bool ok=1;
	ll rui=0;
	rep(i,n){
		rui+=((s[i]=='(')?+1:-1);
		ok&=(rui>=0);
	}
	ok&=(rui==0);
	return ok;
}
bool solve(string s){
	int rui;
	{//終わりが正になるようにreverse
		rui=0;
		rep(i,n)rui+=(s[i]=='('?+1:-1);
		if(rui<0){
			reverse(all(s));
			rep(i,n){
				if(s[i]=='(')s[i]=')';
				else s[i]='(';
			}
		}
	}
	int L=n,R=-1;//左右から見て、はじめて累積和が負になる点
	{//L,Rを求める
		rui=0;
		for(int i=n-1;i>=0;i--){
			rui+=(s[i]==')'?+1:-1);
			if(rui<0)chmax(R,i);
		}
		rui=0;
		rep(i,n){
			rui+=(s[i]=='('?+1:-1);
			if(rui<0)chmin(L,i);
		}
	}
	int d;
	{//終わりの値を求めてdに代入する
		rui=0;
		rep(i,n)rui+=(s[i]=='('?+1:-1);
		d=rui;
	}
	if(L==n&&R==-1){//どちらから見ても累積和が負にならない
		return 1;
	}
	if(L==n){//左から見ると累積和が負にならないケース
		int b=0,h=0;
		rui=0;
		for(int i=n-1;i>=0;i--){
			rui+=(s[i]==')'?+1:-1);
			if(R+1<=i)chmax(b,rui);
		}
		rui=0;
		for(int i=n-1;i>=0;i--){
			rui+=(s[i]==')'?+1:-1);
			if(rui==b-d/2)break;
			chmax(h,rui);
		}
		return (2*b>=h);
	}
	//どちらから見ても累積和が負になるケース
	int a=0,b=0,h=0;
	if(L==n)a=1e9;
	if(R==-1)b=1e9;
	rui=0;
	rep(i,n){
		rui+=(s[i]=='('?+1:-1);
		if(i<=L-1)chmax(a,rui);
		if(R<=i)chmax(b,rui-d);
		if(L-1<=i&&i<=R)chmax(h,rui-d);
	}
	bool ok=1;
	ok&=h<=2*b;
	ok&=h+d<=2*a;
	return ok;
}

int main(){
	string s;
	cin>>n>>s;
	if(n%2==1){cout<<0<<endl;return 0;}
	vector<ll> X;
	rep(i,n)if(s[i]=='x')X.push_back(i);
	if(X.size()>20)return 0;
	ll ans=0;
	rep(i,(1<<(ll)X.size())){
		rep(j,X.size())s[X[j]]=(i&(1<<j)?'(':')');
		bool res=solve(s);
		/*bool realres=solve2(s);
		if(res!=realres){
			cerr<<s<<" "<<res<<" "<<realres<<endl;
		}*/
		//cout<<s<<" "<<res<<endl;
		ans+=res;
	}	
	cout<<ans<<endl;
}

Compilation message

securitygate.cpp:16:0: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
 #pragma gcc optimize("O3")
 
securitygate.cpp:17:0: warning: ignoring #pragma gcc optimize [-Wunknown-pragmas]
 #pragma gcc optimize("unroll-loops")
 
securitygate.cpp:18:0: warning: ignoring #pragma gcc target [-Wunknown-pragmas]
 #pragma gcc target("avx2,see4")
 
securitygate.cpp: In function 'int main()':
securitygate.cpp:11:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define rep(i,n) for(int i=0;i<n;i++)
securitygate.cpp:116:7:
   rep(j,X.size())s[X[j]]=(i&(1<<j)?'(':')');
       ~~~~~~~~~~               
securitygate.cpp:116:3: note: in expansion of macro 'rep'
   rep(j,X.size())s[X[j]]=(i&(1<<j)?'(':')');
   ^~~

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 7 ms 256 KB Output is correct
22 Correct 8 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 8 ms 256 KB Output is correct
28 Correct 6 ms 256 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 8 ms 376 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 7 ms 256 KB Output is correct
22 Correct 8 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 8 ms 256 KB Output is correct
28 Correct 6 ms 256 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 23 ms 376 KB Output is correct
33 Correct 10 ms 376 KB Output is correct
34 Correct 459 ms 256 KB Output is correct
35 Correct 22 ms 256 KB Output is correct
36 Correct 65 ms 376 KB Output is correct
37 Correct 239 ms 256 KB Output is correct
38 Correct 965 ms 380 KB Output is correct
39 Correct 25 ms 376 KB Output is correct
40 Correct 932 ms 376 KB Output is correct
41 Correct 741 ms 504 KB Output is correct
42 Correct 971 ms 256 KB Output is correct
43 Correct 482 ms 256 KB Output is correct
44 Correct 57 ms 256 KB Output is correct
45 Correct 918 ms 364 KB Output is correct

Subtask #4
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 7 ms 256 KB Output is correct
22 Correct 8 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 8 ms 256 KB Output is correct
28 Correct 6 ms 256 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 23 ms 376 KB Output is correct
33 Correct 10 ms 376 KB Output is correct
34 Correct 459 ms 256 KB Output is correct
35 Correct 22 ms 256 KB Output is correct
36 Correct 65 ms 376 KB Output is correct
37 Correct 239 ms 256 KB Output is correct
38 Correct 965 ms 380 KB Output is correct
39 Correct 25 ms 376 KB Output is correct
40 Correct 932 ms 376 KB Output is correct
41 Correct 741 ms 504 KB Output is correct
42 Correct 971 ms 256 KB Output is correct
43 Correct 482 ms 256 KB Output is correct
44 Correct 57 ms 256 KB Output is correct
45 Correct 918 ms 364 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 4 ms 256 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Incorrect 5 ms 380 KB Output isn't correct
50 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Correct 5 ms 256 KB Output is correct
6 Correct 5 ms 256 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 256 KB Output is correct
10 Correct 5 ms 256 KB Output is correct
11 Correct 5 ms 256 KB Output is correct
12 Correct 5 ms 256 KB Output is correct
13 Correct 5 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Correct 5 ms 256 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Correct 6 ms 256 KB Output is correct
21 Correct 7 ms 256 KB Output is correct
22 Correct 8 ms 256 KB Output is correct
23 Correct 5 ms 256 KB Output is correct
24 Correct 9 ms 256 KB Output is correct
25 Correct 5 ms 256 KB Output is correct
26 Correct 5 ms 256 KB Output is correct
27 Correct 8 ms 256 KB Output is correct
28 Correct 6 ms 256 KB Output is correct
29 Correct 5 ms 376 KB Output is correct
30 Correct 5 ms 256 KB Output is correct
31 Correct 8 ms 376 KB Output is correct
32 Correct 23 ms 376 KB Output is correct
33 Correct 10 ms 376 KB Output is correct
34 Correct 459 ms 256 KB Output is correct
35 Correct 22 ms 256 KB Output is correct
36 Correct 65 ms 376 KB Output is correct
37 Correct 239 ms 256 KB Output is correct
38 Correct 965 ms 380 KB Output is correct
39 Correct 25 ms 376 KB Output is correct
40 Correct 932 ms 376 KB Output is correct
41 Correct 741 ms 504 KB Output is correct
42 Correct 971 ms 256 KB Output is correct
43 Correct 482 ms 256 KB Output is correct
44 Correct 57 ms 256 KB Output is correct
45 Correct 918 ms 364 KB Output is correct
46 Correct 5 ms 256 KB Output is correct
47 Correct 4 ms 256 KB Output is correct
48 Correct 5 ms 376 KB Output is correct
49 Incorrect 5 ms 380 KB Output isn't correct
50 Halted 0 ms 0 KB -