2020 蓝桥杯大学 B 组省赛模拟赛 被袭击的村庄

题目链接

题目链接

思路

• 根据题意模拟
• 注意题意有些问题，输出的结果第一行是完全被破坏的道路、房屋、田地的数量，而不是伤害，第二行是造成的总伤害。

参考代码

#include<bits/stdc++.h>
using namespace std;

int yd2[10][2] = { { -1, -1 }, { -1, 0 }, { -1, 1 }, { 0, -1 }, { 0, 1 }, { 1, -1 }, { 1, 0 }, { 1, 1 } };
long long aa[310][310];
long long fw[310][310];
long long fw2[310][310];
int main()
{

    long long n,m,a,b,c,k,w;
    cin>>n>>m>>a>>b>>c>>k>>w;

    for (int i = 1; i <= k; i++)
    {
        for (int j = 1; j <= k; j++)
        {
            cin>>aa[i][j];
        }
    }
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= m; j++)
        {
            cin>>fw[i][j];
            if (fw[i][j] == 1)
                fw2[i][j] = a;
            else if (fw[i][j] == 2)
                fw2[i][j] = b;
            else
                fw2[i][j] = c;
        }
    }

    int q;
    cin>>q;
    for (int i = 0; i < q; i++)
    {
        int id,x,y;
        cin>>id>>x>>y;
        if (id == 1)
        {

            //  int xx = x - k / 2 ;
            //   int yy = y - k / 2 ;

            for (int j = 1,xx = x - k / 2 ; j <= k,xx<=x+k/2; j++,xx++)
            {
                for (int jj = 1,yy = y - k / 2 ; jj <= k,yy<=y+k/2; jj++, yy++)
                {
                    if(xx>=1&&yy>=1&&xx<=n&&yy<=m)
                    {
                        if (aa[j][jj] < fw2[xx][yy])
                        {

                            fw2[xx ][yy] -= aa[j][jj];
                        }
                        else
                        {
                            fw2[xx][yy] = 0;
                        }

                    }

                }
            }
        }
        else
        {

            //int xx = x - k / 2 - 1;
            //   int yy = y - k / 2 - 1;


            for (int j = 1,xx = x - k / 2 ; j <= k,xx<=x+k/2; j++,xx++)
            {
                for (int jj = 1,yy = y - k / 2 ; jj <= k,yy<=y+k/2; jj++, yy++)
                {

                    if (xx >= 1 && yy >= 1 && xx  <= n  && yy  <= m )
                    {
                        if (aa[j][jj] < fw2[xx ][yy ])
                        {

                            fw2[xx][yy ] -= aa[j][jj];

                        }
                        else
                        {

                            fw2[xx][yy ] = 0;
                        }


                        for (int l = 0; l < 8; l++)
                        {
                            int xx2 = xx + yd2[l][0];
                            int yy2 = yy + yd2[l][1];
                            if (xx2 >= 1 && yy2 >= 1 && xx2 <= n  && yy2 <= m)
                            {
                                if (fw2[xx2][yy2] >= w)
                                {
                                    fw2[xx2][yy2] -= w;

                                }
                                else
                                {
                                    fw2[xx2][yy2] = 0;
                                }
                            }
                        }
                    }
                }
            }

        }

    }


    long long ans1=0,ans2=0,ans3=0;

    long long ans4=0;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {

                if(fw[i][j]==1)
                {
                    ans4+=a-fw2[i][j];
                    if(fw2[i][j]==0)
                    ans1++;
                }
                else if(fw[i][j]==2)
                {
                    ans4+=b-fw2[i][j];
                    if(fw2[i][j]==0)
                    ans2++;
                }
                else
                {
                    ans4+=c-fw2[i][j];
                    if(fw2[i][j]==0)
                    ans3++;
                }



        }
    }
    cout<<ans1<<" "<<ans2<<" "<< ans3<<endl;
    cout<<ans4<<endl;

}