ICPC2021网络赛第二轮

J.Leaking Roof

#include <bits/stdc++.h>
using namespace std;
const int N = 505;
double leak[N][N];
int roof[N][N];
bool st[N][N];
int n,m;
int dx[4]={1,0,0,-1}, dy[4]={0,1,-1,0};
bool judge (int x,int y)
{
	for (int i=0;i<4;i++)
	{
		int x1=x+dx[i], y1=y+dy[i];
		if (x1>=1&&x1<=n&&y1>=1&&y1<=n&&roof[x1][y1]<roof[x][y])
			return false;
	}
	return true;
}
void dfs(int x,int y,double v)
{
	if (judge(x,y))
	{
		leak[x][y]+=v;
		return;
	}
	int t=0;
	for (int j=0;j<4;j++)
	{
		int nx=x+dx[j], ny=y+dy[j];
		if (nx>=1&&nx<=n&&ny>=1&&ny<=n&&st[nx][ny]==false&&roof[nx][ny]<roof[x][y]) t++;
	}
	if (t==0) return;
	for (int i=0;i<4;i++)
	{
		int x1=x+dx[i], y1=y+dy[i];
		if (x1>=1&&x1<=n&&y1>=1&&y1<=n&&st[x1][y1]==false&&roof[x1][y1]<roof[x][y])
		{
			st[x1][y1]=true;
			dfs(x1,y1,v/t);
			st[x1][y1]=false;
		}
	}
}
int main ()
{
	scanf("%d %d",&n,&m);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			scanf("%d",&roof[i][j]);
	for (int i=1;i<=n;i++)
		for (int j=1;j<=n;j++)
			if (!roof[i][j]) leak[i][j]+=m;
			
	for (int x=1;x<=n;x++)
	{
		for (int y=1;y<=n;y++)
		{
			if (roof[x][y])
			{
				st[x][y]=true;
				dfs(x,y,m);
				st[x][y]=false;
			}
		}
	}
	for (int x=1;x<=n;x++)
	{
		for (int y=1;y<=n;y++)
		{
			if (!roof[x][y])
				printf("%.6f ",leak[x][y]);
			else printf("0 ");
		}
		printf("\n");
	}
	return 0;
}
/*
5
3
0 2 3 4 1
0 0 2 1 0
8 1 3 3 2
0 0 1 0 0
7 6 5 4 0
5.500000 0 0 0 0
4.000000 11.000000 0 0 17.000000
0 0 0 0 0
5.500000 11.062500 0 10.125000 5.000000
0 0 0 0 5.812500
*/ 

M.Addition

#include<bits/stdc++.h>
using namespace std;
const int N = 65;
int sgn[N],a[N],b[N],c[N];
int main()
{
   	int n; cin>>n;
   	for(int i=0;i<n;i++) cin>>sgn[i];
   	for(int i=0;i<n;i++)
   	{
   		cin>>a[i];
   		a[i]*=sgn[i];
   	}
   	for(int i=0;i<n;i++)
   	{
   		cin>>b[i];
   		b[i]*=sgn[i];
   		c[i]+=a[i]+b[i];
   		if(c[i]>=2) c[i]-=2,c[i+1]+=1;
   		else if(c[i]<=-2) c[i]+=2,c[i+1]-=1;
   		if(c[i]==-1&&sgn[i]==1) c[i]+=2,c[i+1]-=1;
   		else if(c[i]==1&&sgn[i]==-1) c[i]-=2,c[i+1]+=1;
	}
	for(int i=0;i<n-1;i++)
		cout<<fabs(c[i])<<' ';
	cout<<fabs(c[n-1]);
    return 0;
}