题目:一本通P485
(思路很神奇,结构体也很神奇,就记一下)
代码:
#include<iostream>
using namespace std;int i,j,n,m,x,y;
char c;struct node{int x,y;
}f[301][301],k1,k2;node root(node k)
{if(f[k.x][k.y].x==k.x && f[k.x][k.y].y==k.y) return k;return root(f[k.x][k.y]);
}int main()
{cin>>n>>m;for(i=1;i<=n;i++)for(j=1;j<=n;j++){f[i][j].x=i;f[i][j].y=j;//初始化 }for(i=1;i<=m;i++){cin>>x>>y>>c;if(c=='D'){k1=root(f[x][y]);k2=root(f[x+1][y]);}if(c=='R'){k1=root(f[x][y]);k2=root(f[x][y+1]);}if(k1.x==k2.x && k1.y==k2.y){cout<<i<<endl;return 0;}else f[k1.x][k1.y]=k2;//一定要加 }cout<<"draw"<<endl;return 0;
}