wineandchord

一道较为复杂的模拟题，数组要开大一点（尤其是时间维度）#include<iostream>#include<cstdio>#define MAXN 55using namespace std;int n,m,a[MAXN*MAXN],b[MAXN][MAXN],t[MAXN][MAXN],s[MAXN],last[MAXN];bool tl[MAXN*MAXN][7225];int res;bool check(int s,int e,int m){ for(

模拟题，需要注意的是如何判断进入死循环#include<iostream>#include<cstdio>#define MAXN 15using namespace std;struct Node{ int x,y,d;};Node f,c;int res;bool vis[100000];char a[MAXN][MAXN];int dx[4]={-1,0,1,0};int dy[4]={0,1,0,-1};void move(Node&

不错的矩阵旋转题#include<iostream>#include<cstdio>#define MAXN 550using namespace std;int n,m,tot,a[MAXN][MAXN],x,y,r,t;int main(){#ifdef WINE freopen("data.in","r",stdin);#endif scanf("%d%d",&n,&m); for(int i=1;i<=n;i++)