Submission #2834910

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
 
#define P(p) cout<<(p)<<endl
#define rep(i,m,n) for(int i = (m); i < (int)(n); i++)
#define rrep(i,m,n) for(int i=(int)(m); i>=(int)(n); i--)
#define vsort(v) sort(v.begin(), v.end());
#define rvsort(v) sort(v.begin(), v.end(),greater<int>());
#define YES cout<<"YES"<< endl
#define NO cout<<"NO"<<endl
#define Yes cout<<"Yes"<<endl
#define No cout<<"No"<<endl  
#define yes cout<<"yes"<<endl
#define no cout<<"no"<<endl
#define ret return
#define lb(v,n) lower_bound(v.begin(),v.end(),n)
#define ub(v,n) upper_bound(v.begin(),v.end(),n)
#define mae(v) max_element(v.begin(),v.end())
#define mie(v) min_element(v.begin(),v.end())
#define INF 0x7FFFFFFF
#define mod 1000000007
typedef long long ll;
////////////////////////////////////////////////////////////

int main(){
	int n;
	cin >> n;
	string s;
	cin >> s;
	cin >> s;
	
	if( n == 1 ){
		cout << 3 << endl;
		ret 0;
	}

	stack<char> st;
	vector<short> v;

	rep(i,0,n){
		if( st.size() == 0 ) st.push(s[i]);
		else{
			if( s[i] == st.top() ){
				v.push_back(2);
				st.pop();
			}
			else{
				v.push_back(1);
				st.pop();
				st.push(s[i]);
			}
		}
	}

	if( st.size() > 0 ) v.push_back(1);
	
	//rep(i,0,v.size()) cout << v[i];
	//cout << endl;

	ll ans;
	if( v[0] == 1 ) ans = 3;
	else ans = 6;
	
	short bef = v[0];

	rep(i,1,v.size()){
		if( bef == 1 ) ans *= 2;
		else{
			if( v[i] == 2 ) ans *= 3;
		}
		bef = v[i];
		ans %= mod;
	}
	
	cout << ans << endl;
	ret 0;
}

Submission Info

Judge Result