oj.uz

답안 #65176

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65176 2018-08-06T23:59:34 Z spencercompton parentrises (BOI18_parentrises) C++14
100 / 100
 778 ms 11408 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1000000007LL;
ll dp[2][403][403];
ll cur;
ll f(int lbal, int rbal){
	if(lbal<0){
		return 0LL;
	}
	lbal = min(lbal,201);
	lbal = max(lbal,-201);
	rbal = min(rbal,201);
	rbal = max(rbal,-201);
	return dp[1-cur][lbal+201][rbal+201];
}
ll go(int rem, int lbal, int rbal){
	if(lbal<0){
		return 0LL;
	}
	if(rem==0){
		ll ret = 1LL;
		if(lbal<0 || rbal<0){
			return 0LL;
		}
		dp[cur][lbal+201][rbal+201] = ret;
		return ret;
	}
	ll ret = 0LL;
	//(
	ret += f(lbal+2,min(rbal-1,-1));
	ll a = f(lbal+2,min(rbal-1,-1));
	//)
	ret += f(lbal-1,rbal+2);
	ll b = f(lbal-1,rbal+2);
	ret %= mod;
	dp[cur][lbal+201][rbal+201] = ret;
	return ret;
}
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int p, cases;
	cin >> p >> cases;
	if(p==1){
		for(int z = 1; z<=cases; z++){
			string s;
			cin >> s;
			bool pos = true;
			int open = 0;
			int close = 0;
			for(int i = 0; i<s.length(); i++){
				if(s[i]=='('){
					open++;
				}
				else{
					close++;
				}
				if(close>2*open){
					pos = false;
				}
			}
			open = 0;
			close = 0;
			for(int i = s.length()-1; i>=0; i--){
				if(s[i]=='('){
					open++;
				}
				else{
					close++;
				}
				if(open > 2*close){
					pos = false;
				}
			}
			int n = (int)s.length();
			int color[n];
			//G = 0, B = 1, R = 2
			for(int i = 0; i<n; i++){
				color[i] = 0;
			}
			open = 0;
			close = 0;
			vector<int> op;
			vector<int> cl;
			bool ok = true;
			vector<int> op2;
			vector<int> cl2;
			int point = 0;
			for(int i = 0; i<n; i++){
				if(s[i]=='('){
					op.push_back(i);
					open++;
				}
				else{
					cl.push_back(i);
					close++;
					if(close>open){
						if(point+2 > cl.size()){
							ok = false;
							break;
						}
						cl2.push_back(cl[point++]);
						cl2.push_back(cl[point++]);
						close--;
					}
				}
			}
			int dif = open-close;
			if(!ok || 2*dif>open){
				assert(!pos);
				cout << "impossible" << endl;
				continue;
			}
			for(int i = 0; i<2*dif; i++){
				op2.push_back(op.back());
				op.pop_back();
			}
			assert(op2.size()%2==0 && cl2.size()%2==0);
			for(int i = 0; i<op2.size(); i+=2){
				color[op2[i]] = 1;
				color[op2[i+1]] = 2;
			}
			for(int i = 0; i<cl2.size(); i+=2){
				color[cl2[i]] = 1;
				color[cl2[i+1]] = 2;
			}
			int bal1 = 0;
			int bal2 = 0;
			for(int i = 0; i<n; i++){
				if(color[i]==0 || color[i]==1){
					if(s[i]=='('){
						bal1++;
					}
					else{
						bal1--;
					}
				}
				if(color[i]==0 || color[i]==2){
					if(s[i]=='('){
						bal2++;
					}
					else{
						bal2--;
					}
				}
				if(bal1<0 || bal2<0){
					ok = false;
				}
			}
			ok &= bal1==0 && bal2==0;
			if(!ok){
				assert(!pos);
				cout << "impossible" << endl;
				continue;
			}
			assert(ok);
			for(int i = 0; i<n; i++){
				if(color[i]==0){
					cout << "G";
				}
				else if(color[i]==1){
					cout << "B";
				}
				else{
					cout << "R";
				}
			}
			cout << endl;
		}
	}
	else{
		ll ans[301];
		cur = 0;
		for(int i = 0; i<=300; i++){
			cur = 1-cur;
			for(int j = -201; j<=201; j++){
				for(int k = -201; k<=201; k++){
					go(i,j,k);
				}
			}
			ans[i] = go(i,0,0);
		}
		for(int i = 0; i<cases; i++){
			int x;
			cin >> x;
			cout << ans[x] << endl;
		}
	}
}

Compilation message

parentrises.cpp: In function 'll go(int, int, int)':
parentrises.cpp:32:5: warning: unused variable 'a' [-Wunused-variable]
  ll a = f(lbal+2,min(rbal-1,-1));
     ^
parentrises.cpp:35:5: warning: unused variable 'b' [-Wunused-variable]
  ll b = f(lbal-1,rbal+2);
     ^
parentrises.cpp: In function 'int main()':
parentrises.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i<s.length(); i++){
                   ~^~~~~~~~~~~
parentrises.cpp:99:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       if(point+2 > cl.size()){
          ~~~~~~~~^~~~~~~~~~~
parentrises.cpp:120:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i<op2.size(); i+=2){
                   ~^~~~~~~~~~~
parentrises.cpp:124:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i<cl2.size(); i+=2){
                   ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 488 KB Output is correct
3 Correct 3 ms 488 KB Output is correct
4 Correct 2 ms 488 KB Output is correct
5 Correct 2 ms 488 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct

Subtask #4
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 596 KB Output is correct
2 Correct 3 ms 596 KB Output is correct
3 Correct 3 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 2 ms 596 KB Output is correct
6 Correct 2 ms 616 KB Output is correct
7 Correct 3 ms 616 KB Output is correct
8 Correct 2 ms 616 KB Output is correct
9 Correct 3 ms 744 KB Output is correct
10 Correct 2 ms 744 KB Output is correct
11 Correct 5 ms 744 KB Output is correct
12 Correct 3 ms 748 KB Output is correct
13 Correct 3 ms 748 KB Output is correct
14 Correct 3 ms 748 KB Output is correct
15 Correct 4 ms 796 KB Output is correct
16 Correct 24 ms 796 KB Output is correct
17 Correct 10 ms 1836 KB Output is correct
18 Correct 7 ms 1836 KB Output is correct
19 Correct 10 ms 1836 KB Output is correct
20 Correct 13 ms 1912 KB Output is correct
21 Correct 215 ms 1912 KB Output is correct
22 Correct 83 ms 11408 KB Output is correct
23 Correct 74 ms 11408 KB Output is correct
24 Correct 59 ms 11408 KB Output is correct
25 Correct 72 ms 11408 KB Output is correct

Subtask #5
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 752 ms 11408 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 752 ms 11408 KB Output is correct
2 Correct 732 ms 11408 KB Output is correct

Subtask #7
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 752 ms 11408 KB Output is correct
2 Correct 732 ms 11408 KB Output is correct
3 Correct 778 ms 11408 KB Output is correct