棋盘问题
#include<cstdio>
#include<cstring>
int vis[10];
char mp[10][10];
int n,k,sum,cnt;
void dfs(int s){
if(cnt==k){
sum++;
return;
}
if(s>=n)
return;
for(int i=0;i<n;i++){
if(!vis[i]&&mp[s][i]=='#'){
vis[i]=1;
cnt++;
dfs(s+1);
cnt--;
vis[i]=0;
}
}
dfs(s+1);
}
int main(){
while(~scanf("%d%d",&n,&k)&&n!=-1&&k!=-1){
for(int i=0;i<n;i++)
scanf("%s",mp[i]);
memset(vis,0,sizeof(vis));
sum=cnt=0;
dfs(0);
printf("%d\n",sum);
}
}
Dungeon Master
#include<cstdio>
#include<queue>
#include<cstring>
#include<algorithm>
using namespace std;
char s[35][35][35];
int vis[35][45][45];
int dir[7][4]={{1,0,0},{-1,0,0},{0,1,0},{0,-1,0},{0,0,1},{0,0,-1}};
int sx,sy,sz,ex,ey,ez;
int l,r,c;
struct node{
int x,y,z,step;
friend bool operator<(node a,node b){
return a.step>b.step;
}
};
priority_queue<node>q;
void bfs(){
node q1;
q1.x=sx,q1.y=sy,q1.z=sz,q1.step=0;
q.push(q1);
vis[sz][sx][sy]=1;
while(!q.empty()){
node a=q.top();
q.pop();
if(a.z==ez&&a.x==ex&&a.y==ey){
printf("Escaped in %d minute(s).\n",a.step);
return;
}
for(int i=0;i<6;i++){
int zz=a.z+dir[i][0];
int yy=a.y+dir[i][1];
int xx=a.x+dir[i][2];
if(s[zz][xx][yy]!='#'&&zz>=0&&zz<l&&yy>=0&&yy<c&&xx>=0&&xx<r&&!vis[zz][xx][yy]){
vis[zz][xx][yy]=1;
node b;
b.x=xx;
b.y=yy;
b.z=zz;
b.step=a.step+1;
q.push(b);
}
}
}
printf("Trapped!\n");
}
int main(){
while(~scanf("%d%d%d",&l,&r,&c)&&l+r+c){
for(int i=0;i<l;i++){
for(int j=0;j<r;j++){
scanf("%s",s[i][j]);
for(int k=0;k<c;k++){
if(s[i][j][k]=='S'){
sz=i;
sx=j;
sy=k;
}
if(s[i][j][k]=='E'){
ez=i;
ex=j;
ey=k;
}
}
}
}
memset(vis,0,sizeof(vis));
bfs();
}
}
Catch That Cow
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int n,k;
int vis[100005],d[100005];
int cnt;
void bfs(){
memset(d,0x3f3f3f3f,sizeof(d));
queue<int>q;
q.push(n);
vis[n]=1;
d[n]=0;
while(!q.empty()){
int temp=q.front();
q.pop();
if(temp==k)
break;
for(int i=0;i<3;i++){
int x;
if(i==0)
x=temp+1;
if(i==1)
x=temp-1;
if(i==2)
x=temp*2;
if(x>0&&x<2*k&&!vis[x]){
d[x]=d[temp]+1;
vis[x]=1;
q.push(x);
}
}
}
}
int main(){
while(~scanf("%d%d",&n,&k)){
memset(vis,0,sizeof(vis));
if(n>=k){
printf("%d\n",n-k);
continue;
}
bfs();
printf("%d\n",d[k]);
}
}
Fliptile
#include<cstdio>
#include<cstring>
int mp[20][20],fli[20][20],out[20][20];
int dir[6][2]={{0,0},{1,0},{-1,0},{0,1},{0,-1}};
int m,n;
int check(int x,int y){
int c=mp[x][y];
for(int i=0;i<5;i++){
int xx=x+dir[i][0],yy=y+dir[i][1];
if(xx>=0&&xx<n&&yy>=0&&yy<m)
c+=fli[xx][yy];
}
return c%2;
}
int cal(){
for(int i=1;i<n;i++){
for(int j=0;j<m;j++){
if(check(i-1,j)!=0)
fli[i][j]=1;
}
}
for(int i=0;i<m;i++)
if(check(n-1,i)!=0)
return -1;
int res=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
res+=fli[i][j];
return res;
}
int main(){
while(~scanf("%d%d",&n,&m)){
int ans=-1;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
scanf("%d",&mp[i][j]);
for(int i=0;i<1<<m;i++){
memset(fli,0,sizeof(fli));
for(int j=0;j<m;j++)
fli[0][m-j-1]=(i>>j)&1;
int num=cal();
if(num>0&&(ans<0||num<ans)){
ans=num;
memcpy(out,fli,sizeof(fli));
}
}
if(ans==-1)
printf("IMPOSSIBLE\n");
else {
for(int i=0;i<n;i++){
for(int j=0;j<m-1;j++)
printf("%d ",out[i][j]);
printf("%d\n",out[i][m-1]);
}
}
}
}
Find The Multiple
#include<cstdio>
typedef long long ll;
int flag,n;
void dfs(ll t,int k){
if(k==19||flag){
return;
}
if(t%n==0){
flag=1;
printf("%lld\n",t);
return;
}
dfs(t*10,k+1);
dfs(t*10+1,k+1);
}
int main(){
while(~scanf("%d",&n)&&n){
flag=0;
dfs(1,0);
}
}
Prime Path
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;
int isprime[10005];
int vis[10005],d[10005];
int s,t;
void seive(){
for(int i=2;i<=10000;i++){
if(!isprime[i]){
for(int j=i*2;j<=10000;j+=i)
isprime[j]=1;
}
}
}
int bfs(){
queue<int>q;
int p[5];
q.push(s);
vis[s]=1;
d[s]=0;
while(!q.empty()){
int v=q.front();
q.pop();
if(v==t)
return d[t];
p[0]=v%10;
p[1]=v/10%10;
p[2]=v/100%10;
p[3]=v/1000;
for(int i=0;i<4;i++){
int te=p[i];
for(int j=0;j<10;j++){
if(j!=te){
p[i]=j;
int tem=p[3]*1000+p[2]*100+p[1]*10+p[0];
if(!vis[tem]&&tem>=1000&&tem<10000&&!isprime[tem]){
d[tem]=d[v]+1;
vis[tem]=1;
q.push(tem);
}
if(tem==t)
return d[tem];
}
}
p[i]=te;
}
}
return -1;
}
int main(){
int T;
seive();
scanf("%d",&T);
while(T--){
scanf("%d%d",&s,&t);
memset(vis,0,sizeof(vis));
memset(d,0,sizeof(d));
int ans=bfs();
if(ans==-1)
printf("Impossible\n");
else printf("%d\n",ans);
}
return 0;
}
Shuffle'm Up
#include<cstdio>
#include<string>
#include<map>
#include<iostream>
using namespace std;
int main(){
int T;
scanf("%d",&T);
for(int j=1;j<=T;j++){
string s1,s2,s3;
int n;
scanf("%d",&n);
cin>>s1>>s2>>s3;
map<string,int>m;
int ans=0;
while(1){
string s;
for(int i=0;i<n;i++){
s+=s2[i];
s+=s1[i];
}
ans++;
if(s==s3&&m[s]==0){
printf("%d %d\n",j,ans);
break;
}
if(m[s]==1&&s!=s3){
printf("%d -1\n",j);
break;
}
m[s]=1;
s1.clear();
s2.clear();
for(int i=0;i<n;i++)
s1+=s[i];
for(int i=n;i<2*n;i++)
s2+=s[i];
}
}
return 0;
}
Pots
#include <iostream>
#include <cstdio>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <sstream>
using namespace std;
int a,b,c;
int tot=0,id[105*105],vis[105][105];
char op[][10]={"0","FILL(1)","FILL(2)","DROP(1)","DROP(2)","POUR(1,2)","POUR(2,1)"};
struct node{
int no,k1,k2,op,step,pre;
bool operator<(const node &c)const{
return step>c.step;
}
};
priority_queue<node>q;
node now,nxt;
vector<node>v;
void print(int i){
int j=0;
while(v[i].no){
id[j++]=v[i].no;
i=v[i].pre;
}
for(int k=j-1;k>=0;k--)
printf("%s\n",op[v[id[k]].op]);
}
void bfs(){
now.k1=now.k2=now.no=now.step=now.op=now.pre=0;
vis[now.k1][now.k2]=1;
q.push(now);
v.push_back(now);
while(!q.empty()){
now=q.top();
q.pop();
if(now.k1==c||now.k2==c){
printf("%d\n",now.step);
print(now.no);
return;
}
for(int i=1;i<=6;i++){
if(i==1){
nxt.k1=a;
nxt.k2=now.k2;
}
else if(i==2){
nxt.k1=now.k1;
nxt.k2=b;
}
else if(i==3){
nxt.k1=0;
nxt.k2=now.k2;
}
else if(i==4){
nxt.k1=now.k1;
nxt.k2=0;
}
else if(i==5){
if(now.k1+now.k2>b){
nxt.k1=now.k1-(b-now.k2);
nxt.k2=b;
}
else {
nxt.k1=0;
nxt.k2=now.k1+now.k2;
}
}
else if(i==6){
if(now.k1+now.k2>a){
nxt.k2=now.k2-(a-now.k1);
nxt.k1=a;
}
else {
nxt.k2=0;
nxt.k1=now.k2+now.k1;
}
}
nxt.op=i;
if(!vis[nxt.k1][nxt.k2]){
vis[nxt.k1][nxt.k2]=1;
tot++;
nxt.no=tot;
nxt.step=now.step+1;
nxt.pre=now.no;
q.push(nxt);
v.push_back(nxt);
}
}
}
printf("impossible\n");
}
int main(){
memset(vis,0,sizeof(vis));
scanf("%d%d%d",&a,&b,&c);
bfs();
}
Fire!
#include<bits/stdc++.h>
using namespace std;
const int inf=0x3f3f3f3f;
int dir[4][2]={{-1,0},{1,0},{0,1},{0,-1}};
int n,m,s,e;
bool vis[1005][1005];
int times[1005][1005];
int step[1005][1005];
char a[1005][1005];
struct node{
int x,y;
node(){};
node(int _x,int _y):x(_x),y(_y){}
};
queue<node>q;
bool check(int x,int y){
if(x<0||x>=n||y<0||y>=m)
return false;
if(vis[x][y])
return false;
return a[x][y]=='.';
}
void bfs_fire(){
while(!q.empty()){
node p=q.front();
q.pop();
for(int i=0;i<4;i++){
int xx=p.x+dir[i][0];
int yy=p.y+dir[i][1];
if(check(xx,yy)){
vis[xx][yy]=true;
times[xx][yy]=times[p.x][p.y]+1;
q.push(node(xx,yy));
}
}
}
}
int bfs(int x,int y){
step[x][y]=0;
q.push(node(x,y));
vis[x][y]=true;
while(!q.empty()){
node p=q.front();
q.pop();
if(p.x==0||p.x==n-1||p.y==0||p.y==m-1)
return step[p.x][p.y]+1;
for(int i=0;i<4;i++){
int xx=p.x+dir[i][0];
int yy=p.y+dir[i][1];
if(check(xx,yy)&&step[p.x][p.y]+1<times[xx][yy]){
step[xx][yy]=step[p.x][p.y]+1;
vis[xx][yy]=true;
q.push(node(xx,yy));
}
}
}
return -1;
}
int main(){
ios::sync_with_stdio(false);
int t;
cin>>t;
while(t--){
cin>>n>>m;
memset(times,inf,sizeof(times));
memset(vis,false,sizeof(vis));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>a[i][j];
if(a[i][j]=='J'){
s=i;
e=j;
}
if(a[i][j]=='F'){
vis[i][j]=true;
q.push(node(i,j));
times[i][j]=0;
}
}
}
bfs_fire();
while(!q.empty())
q.pop();
memset(vis,false,sizeof(vis));
int ans=bfs(s,e);
if(ans==-1)
cout<<"IMPOSSIBLE\n";
else cout<<ans<<"\n";
}
return 0;
}
迷宫问题
#include<cstdio>
#include<queue>
#include<cstring>
using namespace std;
struct node{
int x,y;
};
node pre[8][8],t;
int dir[4][2]={{1,0},{-1,0},{0,1},{0,-1}},a[8][8];
queue<node>q;
void bfs(){
q.push({5,5});
while(!q.empty()){
int s=q.size();
for(int i=0;i<s;i++){
node t=q.front();
q.pop();
for(int j=0;j<4;j++){
int x=t.x+dir[j][0],y=t.y+dir[j][1];
if(a[x][y]==0){
a[x][y]=1;
pre[x][y]={t.x,t.y};
q.push({x,y});
if(t.x==1&&t.y==1)
return;
}
}
}
}
}
int main(){
memset(a,-1,sizeof(a));
for(int i=1;i<=5;i++)
for(int j=1;j<=5;j++)
scanf("%d",&a[i][j]);
bfs();
node t={1,1};
printf("(0, 0)\n");
while(t.x!=5||t.y!=5){
t=pre[t.x][t.y];
printf("(%d, %d)\n",t.x-1,t.y-1);
}
}
Oil Deposits
#include<bits/stdc++.h>
using namespace std;
char s[105][105];
int vis[105][105];
int dir[8][2]={{1,0},{-1,0},{0,-1},{0,1},{1,1},{1,-1},{-1,1},{-1,-1}};
int n,num,m;
void dfs(int x,int y){
if(x<0||y<0||x>=n||y>=m||vis[x][y]||s[x][y]=='*')
return;
vis[x][y]=num;
for(int i=0;i<8;i++){
int xx=x+dir[i][0];
int yy=y+dir[i][1];
if(xx>=0&&yy>=0&&xx<n&&yy<m&&s[xx][yy]=='@')
dfs(xx,yy);
}
}
int main(){
while(~scanf("%d%d",&n,&m)&&n){
num=0;
memset(vis,0,sizeof(vis));
for(int i=0;i<n;i++)
scanf("%s",s[i]);
for(int i=0;i<n;i++)
for(int j=0;j<m;j++){
if(vis[i][j]==0&&s[i][j]=='@'){
num++;
dfs(i,j);
}
}
printf("%d\n",num);
}
}
Mine Sweeper
#include<cstdio>
#include<cstring>
using namespace std;
char mine[20][20];
char touch[20][20];
int dir[8][2]={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};
int cnt[20][20];
int main(){
int n;
memset(cnt,0,sizeof(cnt));
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%s",mine[i]);
for(int i=0;i<n;i++)
scanf("%s",touch[i]);
int f=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(mine[i][j]=='*'&&touch[i][j]=='x')
f=1;
for(int k=0;k<8;k++){
int x=i+dir[k][0],y=j+dir[k][1];
if(x>=0&&y>=0&&x<n&&y<n){
cnt[i][j]+=mine[x][y]=='*';
}
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
if(f&&mine[i][j]=='*')
touch[i][j]='*';
else if(touch[i][j]=='x')
touch[i][j]=cnt[i][j]+'0';
}
}
for(int i=0;i<n;i++)
puts(touch[i]);
}