zoukankan      html  css  js  c++  java
  • Coloring Dominoes

    问题 E: Coloring Dominoes

    时间限制: 1 Sec  内存限制: 128 MB
    提交: 279  解决: 95
    [提交] [状态] [讨论版] [命题人:]

    题目描述

    We have a board with a 2×N grid. Snuke covered the board with N dominoes without overlaps. Here, a domino can cover a 1×2 or 2×1 square.
    Then, Snuke decided to paint these dominoes using three colors: red, cyan and green. Two dominoes that are adjacent by side should be painted by different colors. Here, it is not always necessary to use all three colors.
    Find the number of such ways to paint the dominoes, modulo 1000000007.
    The arrangement of the dominoes is given to you as two strings S1 and S2 in the following manner:
    Each domino is represented by a different English letter (lowercase or uppercase).
    The j-th character in Si represents the domino that occupies the square at the i-th row from the top and j-th column from the left.

    Constraints
    1≤N≤52
    |S1|=|S2|=N
    S1 and S2 consist of lowercase and uppercase English letters.
    S1 and S2 represent a valid arrangement of dominoes.

    输入

    Input is given from Standard Input in the following format:
    N
    S1
    S2

    输出

    Print the number of such ways to paint the dominoes, modulo 1000000007.


    样例输入

    3
    aab
    ccb
    

    样例输出

    6
    

    提示

    There are six ways as shown below:


    分析:这题。。找规律。。

    #include <iostream>
    #include <string>
    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <algorithm>
    #include <vector>
    #include <queue>
    #include <deque>
    #include <map>
    #define range(i,a,b) for(auto i=a;i<=b;++i)
    #define LL long long
    #define itrange(i,a,b) for(auto i=a;i!=b;++i)
    #define rerange(i,a,b) for(auto i=a;i>=b;--i)
    #define fill(arr,tmp) memset(arr,tmp,sizeof(arr))
    using namespace std;
    const int dev=1000000007;
    int n;
    string s1,s2;
    bool flag;
    LL ans;
    void init(){
        cin>>n>>s1>>s2;
        ans=s1[0]==s2[0]?3:6;
        flag=s1[0]!=s2[0];
    }
    void solve(){
        range(i,flag?2:1,n-1){
            if(s1[i]==s2[i]){
                if(!flag)ans=(ans<<1)%dev;
                flag=false;
            }
            else{
                if(flag)ans=ans*3%dev;
                else ans=(ans<<1)%dev;
                ++i;flag=true;
            }
        }
        cout<<ans<<endl;
    }
    int main() {
        init();
        solve();
        return 0;
    }
    View Code

  • 相关阅读:
    大数据学习之路(持续更新中...)
    数据挖掘之初级
    用户画像
    机器挖掘之经典算法
    算法时间复杂度
    01-IOS-越狱指南
    gradle 内容学习参考
    python 获取文件路径相关
    第一行代码阅读笔记
    使用同步锁防止多进程的并发操作
  • 原文地址:https://www.cnblogs.com/Rhythm-/p/9377291.html
Copyright © 2011-2022 走看看