#include<bits/stdc++.h>
using namespace std;
//无脑dp
#define ll long long
#define A 2222222
const ll mod=1e9+7;
//设f[x][5][2]为当前是第x个格子,当前填什么 0前面填1后面填
ll f[A][5][2];
//0表示0雷,1表示一个雷 2表示两个雷 3*
ll n,ans=0;
char ch[A];
void debuger(){for(ll i=1;i<=n;i++,puts(""))for(ll j=0;j<=3;j++){if(j==1){printf("f[%lld][1][0]=%lld f[%lld][1][1]=%lld ",
i,f[i][1][0],i,f[i][1][1]);}else printf("f[%lld][%lld]=%lld ",i,j,f[i][j][0]);}
}
int main(){scanf("%s",ch+1);n=strlen(ch+1);if(ch[1]=='*'){f[0][1][1]=1;}else if(ch[1]=='?'){f[0][1][1]=1;f[0][0][0]=1;}else if(ch[1]=='1'){f[0][0][0]=1;}else if(ch[1]=='0'){f[0][0][0]=1;}for(ll x=1;x<=n;x++){if(ch[x]=='?'){f[x][3][0]=(f[x-1][1][1]+f[x-1][2][0]+f[x-1][3][0])%mod;f[x][0][0]=(f[x-1][1][0]+f[x-1][0][0])%mod;f[x][2][0]=(f[x-1][3][0])%mod;f[x][1][0]=(f[x-1][3][0])%mod;f[x][1][1]=(f[x-1][1][0]+f[x-1][0][0])%mod;}else if(ch[x]=='*'){f[x][3][0]=(f[x-1][1][1]+f[x-1][2][0]+f[x-1][3][0])%mod;//若当前格子是雷,前面格子可以是1且雷在后,两个雷标记,雷
        }else if(ch[x]=='0'){f[x][0][0]=(f[x-1][1][0]+f[x-1][0][0])%mod;//若当前格子是0雷标记,前面格子可以是0雷标记或1雷但雷在前
        }else if(ch[x]=='2'){f[x][2][0]=(f[x-1][3][0])%mod;//若当前格子是2雷标记,前面格子必须是雷
        }else if(ch[x]=='1'){f[x][1][0]=f[x-1][3][0];//若雷在前,前面格子必须是雷f[x][1][1]=(f[x-1][1][0]+f[x-1][0][0])%mod;//若雷在后,前面格子可以是1雷标记但雷在前,或是无雷标记
        }}
//    debuger();ans=(ans+f[n][1][0]+f[n][0][0])%mod;ans=(ans+f[n][3][0])%mod;printf("%lld\n",ans);
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define A 510
ll h[A][A],a[A][A];
bool vis[A][A];
struct node{ll x,y,high;friend bool operator < (const node &a,const node &b){return a.high>b.high;}
};priority_queue<node> q;
ll n,m;
const ll nowx[5]={0,1,-1,0,0};
const ll nowy[5]={0,0,0,1,-1};
bool pan(ll x,ll y){if(x<1||x>n||y<1||y>m||vis[x][y]) return 0;return 1;
}
void dfs(ll x,ll y,ll v){vis[x][y]=1;if(a[x][y]>v){node o;o.x=x,o.y=y,o.high=a[x][y];q.push(o);return ;}h[x][y]+=v-a[x][y];for(ll i=1;i<=4;i++){ll xnow=x+nowx[i],ynow=y+nowy[i];if(pan(xnow,ynow))dfs(xnow,ynow,v);}
}
int main(){scanf("%lld%lld",&n,&m);for(ll i=1;i<=n;i++)for(ll j=1;j<=m;j++){scanf("%lld",&a[i][j]);if(a[i][j]<0){h[i][j]=0-a[i][j];a[i][j]=0;}if(i==1||j==1||i==n||j==m){node b;b.x=i,b.y=j,b.high=a[i][j];q.push(b);vis[i][j]=1;}}while(!q.empty()){node o=q.top();q.pop();ll x=o.x,y=o.y,high=o.high;for(ll i=1;i<=4;i++){ll xnow=x+nowx[i],ynow=y+nowy[i];if(pan(xnow,ynow))dfs(xnow,ynow,high);}}for(ll i=1;i<=n;i++,puts(""))for(ll j=1;j<=m;j++){printf("%lld ",h[i][j]);}
}

#include<bits/stdc++.h>
using namespace std;
#define ll int
#define A 1001010
ll vis[A],mu[A],prime[A];
long long g[A],s[A],su[A];
ll get_[A];
long long  ans,cnt=0;
void get__mu(ll n){mu[1]=1;for(ll i=2;i<=500000;i++){if(!vis[i]){prime[++cnt]=i,mu[i]=-1;}for(ll j=1;j<=cnt&&prime[j]*1ll*i<=500000;j++){vis[prime[j]*1ll*i]=1;if(i%prime[j]==0) break;else mu[i*1ll*prime[j]]=-mu[i];}}
}
ll n,m;
void work(ll x,ll d){
//    printf("x=%lld\n",x);for(ll i=1;i<=sqrt(x);i++)if(!(x%i)){s[i]+=d;
//        printf("x=%lld i=%lld \n",x,i);if(i*1ll*i!=x)s[x/i]+=d;ans-=mu[i]*1ll*g[i];if(i*1ll*i!=x)ans-=mu[x/i]*1ll*g[x/i];g[i]=s[i]*1ll*(s[i]-1)/2;if(i*1ll*i!=x)g[x/i]=s[x/i]*1ll*(s[x/i]-1)/2;ans+=mu[i]*1ll*g[i];if(i*1ll*i!=x)ans+=mu[x/i]*1ll*g[x/i];}
//    for(ll i=2;i<=x;i++){
//        printf("s[%lld]=%lld\n",i,s[i]);
//    }    printf("%lld\n",ans);
}
int main(){scanf("%d%d",&n,&m);get__mu(510000);
//    printf("mu=%lld\n",prime[3]);for(ll i=1;i<=n;i++)scanf("%d",&su[i]);for(ll i=1,a;i<=m;i++){scanf("%d",&a);ll x=su[a];if(get_[a]==0)work(x,1),get_[a]=1;else work(x,-1),get_[a]=0;}
}

View Code