#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=55;
const int mod=1e9+7;
ll n,m;
char c[maxn][maxn];
ll dp[maxn][maxn];
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>c[i][j];
}
}
dp[1][1]=1;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
if(c[i][j]=='R') dp[i][j+1]=(dp[i][j+1]+dp[i][j])%mod; //dp[i][j+1]好多种情况到这个位置 也就是到这个位置有几种方法
if(c[i][j]=='D') dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
if(c[i][j]=='B'){
dp[i][j+1]=(dp[i][j+1]+dp[i][j])%mod;
dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
}
}
}
cout<<dp[n][m]<<endl;
return 0;
}
模拟队列
#include <iostream>
using namespace std;
const long mod = 1e9 + 7;
const int maxn = 2507;
int book[55][55];
long long num[55][55];
int n, m, stx, sty, endx, endy;
int head, tail, x, y;//x,y全局用
char map[55][55];
struct node{
int x, y;
}que[maxn];
void bfs(int nx, int ny){
if(nx < 1 || ny < 1 || nx > n || ny > m)
return;
num[nx][ny] = (num[x][y] % mod + num[nx][ny] % mod) %mod;
if(book[nx][ny] == 0){
book[nx][ny] = 1;
que[tail].x = nx; //push({nx.ny})
que[tail].y = ny;
tail++;
}
}
int main(){
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
cin >> map[i][j];
stx = 1, sty = 1, endx = n, endy = m;
num[1][1] = 1;
book[1][1] = 1;
que[0].x = stx;
que[0].y = sty;
head = 0, tail = 1;
while(head < tail){ //!q.empty()
x = que[head].x;
y = que[head].y;
head++; //相当于删除头pop()
if(map[x][y] == 'R')
bfs(x, y + 1);
else if(map[x][y] == 'D')
bfs(x + 1, y);
else if(map[x][y] == 'B'){
bfs(x, y + 1);
bfs(x + 1, y);
}
}
cout << num[endx][endy] % mod << endl;
}
queue q; {}
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=2505;
const int mod=1e9+7;
#define mp make_pair
#define fi first
#define se second
int n,m,sx,sy,ex,ey,x,y;
char c[maxn][maxn];
ll dp[maxn][maxn],vis[maxn][maxn];
struct node{
int x,y;
}p[maxn];
queue<node> q;
bool judge(int x,int y){
if(x<1 || x>n || y<1 || y>m) return 0;
return 1;
}
void bfs(int nx,int ny){
if(!judge(nx,ny))
return;
dp[nx][ny]=(dp[nx][ny]+dp[x][y])%mod;//可以访问多次 多种到达方法
if(vis[nx][ny]==0){
vis[nx][ny]=1;
q.push({nx,ny});
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++)
cin>>c[i][j];
}
sx=1,sy=1;ex=n,ey=m;
vis[1][1]=1;dp[1][1]=1;
q.push({sx,sy});
while(!q.empty()){
x=q.front().x,y=q.front().y;
q.pop();
if(c[x][y]=='R')
bfs(x,y+1);
if(c[x][y]=='D')
bfs(x+1,y);
if(c[x][y]=='B'){
bfs(x,y+1);
bfs(x+1,y);
}
}
cout<<dp[n][m]<<endl;
return 0;
}
pair 二维数组输入n行字符串
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=55;
const int mod=1e9+7;
#define mp make_pair
#define fi first
#define se second
ll n,m,vis[55][55],dp[55][55],sx,sy,ex,ey,x,y;
char c[55][55];
queue<pair<ll,ll> > q;
bool judge(ll x,ll y){
if(x<1 || x>n || y<1 || y>m)
return false;
return true;
}
void bfs(ll nx,ll ny){
if(!judge(nx,ny))
return;
dp[nx][ny]=(dp[nx][ny]+dp[x][y])%mod; //可以访问多次 从左上方某些点可以到nx,ny 即到该点路径方案数
if(!vis[nx][ny]){ //从未压进去过
vis[nx][ny]=1;
q.push(mp(nx,ny));
}
}
int main(){
cin>>n>>m;
for(int i=1;i<=n;i++){
scanf("%s",c[i]+1);
}
sx=1,sy=1;ex=n,ey=m;
dp[sx][sy]=1;vis[sx][sy]=1;//直接访问起点 因为起点不可能由其左上方的点转移多次
q.push(mp(sx,sy));
while(!q.empty()){
x=q.front().fi,y=q.front().se;
q.pop();
if(c[x][y]=='R'){
bfs(x,y+1);
}
if(c[x][y]=='D'){
bfs(x+1,y);
}
if(c[x][y]=='B'){
bfs(x,y+1);
bfs(x+1,y);
}
}
cout<<dp[n][m]<<endl;
return 0;
}
I 1=<n<=60
O(2^n) 超时
#include<bits/stdc++.h>
using namespace std;
int k,n,cnt1,cnt2,cnt3,cnt4,cnt5,cnt6;
void mov(int n,char a,char c,char b){ //路径
if(n==0) return ;
mov(n-1,a,b,c);
if(a=='A' && c=='B')
cnt1++;
if(a=='A' && c=='C')
cnt2++;
if(a=='B' && c=='A')
cnt3++;
if(a=='B' && c=='C')
cnt4++;
if(a=='C' && c=='A')
cnt5++;
if(a=='C' && c=='B')
cnt6++;
mov(n-1,b,c,a);
}
int h[110]; //次数
int hnt(int n){
h[1]=1;
h[2]=3;
for(int i=3;i<=n;++i) h[i]=2*h[i-1]+1;
return h[n];
}
int main()
{
cin>>n;
mov(n,'A','C','B');
printf("A->B:%d\n",cnt1);
printf("A->C:%d\n",cnt2);
printf("B->A:%d\n",cnt3);
printf("B->C:%d\n",cnt4);
printf("C->A:%d\n",cnt5);
printf("C->B:%d\n",cnt6);
printf("SUM:%d\n",hnt(n));
return 0;
}
打表找规律
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const ll mod=1e9+7;
#define pb push_back
typedef long long ll;
ll k,n,num=1;
struct node{
ll cnt1,cnt2,cnt3,cnt4,cnt5,cnt6;
}a[65];
ll ksm(ll a,ll b){
ll res=1;
while(b){
if(b&1)
res=res*a;
a=a*a;
b>>=1;
}
return res;
}
int main(){
cin>>n;
a[1].cnt1=0;a[1].cnt2=1;a[1].cnt3=0;a[1].cnt4=0;a[1].cnt5=0;a[1].cnt6=0;
a[2].cnt1=1;a[2].cnt2=1;a[2].cnt3=0;a[2].cnt4=1;a[2].cnt5=0;a[2].cnt6=0;
if(n==1){
printf("A->B:%lld\n",a[1].cnt1);
printf("A->C:%lld\n",a[1].cnt2);
printf("B->A:%lld\n",a[1].cnt3);
printf("B->C:%lld\n",a[1].cnt4);
printf("C->A:%lld\n",a[1].cnt5);
printf("C->B:%lld\n",a[1].cnt6);
printf("SUM:%lld\n",ksm(2,n)-1);
}
else if(n==2){
printf("A->B:%lld\n",a[2].cnt1);
printf("A->C:%lld\n",a[2].cnt2);
printf("B->A:%lld\n",a[2].cnt3);
printf("B->C:%lld\n",a[2].cnt4);
printf("C->A:%lld\n",a[2].cnt5);
printf("C->B:%lld\n",a[2].cnt6);
printf("SUM:%lld\n",ksm(2,n)-1);
}
else{
ll maxx=1,minn=0;
for(int i=3;i<=60;i++){
if(i&1){
a[i].cnt1=a[i-1].cnt1;a[i].cnt4=a[i-1].cnt4;a[i].cnt5=a[i-1].cnt5;
a[i].cnt2=a[i-1].cnt2+maxx*2;a[i].cnt3=a[i-1].cnt3+maxx*2-1;a[i].cnt6=a[i-1].cnt6+maxx*2-1;
minn=maxx*2-1;maxx=maxx*2;
}
else{
a[i].cnt2=a[i-1].cnt2;a[i].cnt3=a[i-1].cnt3;a[i].cnt6=a[i-1].cnt6;
a[i].cnt1=a[i-1].cnt1+minn*2+1;a[i].cnt4=a[i-1].cnt4+minn*2+1;a[i].cnt5=a[i-1].cnt5+minn*2;
maxx=minn*2+1;minn=minn*2;
}
}
printf("A->B:%lld\n",a[n].cnt1);
printf("A->C:%lld\n",a[n].cnt2);
printf("B->A:%lld\n",a[n].cnt3);
printf("B->C:%lld\n",a[n].cnt4);
printf("C->A:%lld\n",a[n].cnt5);
printf("C->B:%lld\n",a[n].cnt6);
printf("SUM:%lld\n",ksm(2,n)-1);
}
return 0;
}
685
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
