&机房没装,蒟蒻太懒了
by 小小二逼兽 @ 2018-10-16 20:45:31
@[小小二逼兽](/space/show?uid=35467) 题目不可能出错的吧。。。
by Starlight237 @ 2018-10-16 20:52:12
但事实好像就是这样,
你去试试看
by 小小二逼兽 @ 2018-10-16 20:57:12
@[huanghaox1212](/space/show?uid=75765)
by 小小二逼兽 @ 2018-10-16 20:57:21
@[小小二逼兽](/space/show?uid=35467) 我把它反过来交了一下,还是只有10分。。。
by Starlight237 @ 2018-10-16 20:58:15
@[小小二逼兽](/space/show?uid=35467) 麻烦把AC代码像这样发出来:
```
#include<cstdio>
......
```
by Starlight237 @ 2018-10-16 21:03:06
#include<bits/stdc++.h>
using namespace std;
int sq[501][501];
int zhe[501][501];
void ssz(int x,int y,int r)
{
for(int i=x-r;i<=x+r;i++)
for(int j=y-r;j<=y+r;j++)
{
zhe[i][j]=sq[i][j];
}
for(int i=x-r,j2=y-r;i<=x+r,j2<=y+r;i++,j2++)
for(int j=y-r,i2=x+r;j<=y+r,i2>=x-r;j++,i2--)
{
sq[i2][j2]=zhe[i][j];
}
}
by 小小二逼兽 @ 2018-10-16 21:36:16
void nsz(int x,int y,int r)
{
for(int i=x-r;i<=x+r;i++)
for(int j=y-r;j<=y+r;j++)
{
zhe[i][j]=sq[i][j];
}
for(int i=x-r,j2=y+r;i<=x+r,j2>=y-r;i++,j2--)
for(int j=y-r,i2=x-r;j<=y+r,i2<=x+r;j++,i2++)
{
sq[i2][j2]=zhe[i][j];
}}
int n,m;
by 小小二逼兽 @ 2018-10-16 21:36:54
void print()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
printf("%d ",sq[i][j]);
printf("\n");
}
return;
}
int main()
{
int x,y,r,z;
scanf("%d %d",&n,&m);
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
sq[i][j]=(i-1)*n+j;
}
}
for(int i=1;i<=m;i++)
{
scanf("%d %d %d %d",&x,&y,&r,&z);
if(z==0)
nsz(x,y,r);
else
ssz(x,y,r);
}
print();
return 0;
}
by 小小二逼兽 @ 2018-10-16 21:37:42
@[huanghaox1212](/space/show?uid=75765)
by 小小二逼兽 @ 2018-10-17 22:10:01