codeforces contest 750

http://codeforces.com/contest/750

//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

D  750D  New Year and Fireworks
题意：

题解：爆炸范围很小，因此已经访问过的状态不用再访问了。

#include<cstdio>
#include<cstring>
const int N=35;
const int M=405;
bool vis[M][M][9][N],mp[M][M];
int a[N],n;
int dx[]={0,1,1,1,0,-1,-1,-1};
int dy[]={1,1,0,-1,-1,-1,0,1};
void dfs(int x,int y,int dir,int i) {
	if(vis[x][y][dir][i]) return ;
	vis[x][y][dir][i]=1;
	for(int j=1;j<=a[i];++j) mp[x+dx[dir]*j][y+dy[dir]*j]=1;
	if(i==n) return ;
	dfs(x+dx[dir]*a[i],y+dy[dir]*a[i],(dir+1)%8,i+1);
	dfs(x+dx[dir]*a[i],y+dy[dir]*a[i],(dir-1+8)%8,i+1);
	
}
int main() {
	while(~scanf("%d",&n)) {
		memset(vis,0,sizeof(vis));
		memset(mp,0,sizeof(mp));
		for(int i=1;i<=n;++i) scanf("%d",&a[i]);
		dfs(200,200,0,1);
		int ans=0;
		for(int i=0;i<M;++i) {
			for(int j=0;j<M;++j) {
				ans+=mp[i][j];
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}

//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------

E  750E  New Year and Old Subsequence
http://blog.csdn.net/qq_32707623/article/details/54583877