85分求助!就一个点过不去!!!
查看原帖
85分求助!就一个点过不去!!!
645451
封禁用户楼主2023/6/17 08:50

RT

#include <iostream>

using namespace std;
int n,m,q;

struct RGB{
    int r;
    int g;
    int b;
};
RGB mapaa[105][105]={};
bool dc()
{
    bool flag=true;
    for (int i=0;i<n;i++)
    {
        if (!flag) break;
        for (int j=0;j<m;j++)
        {
            if (mapaa[i][j].r == mapaa[i][m-j+1].r && mapaa[i][j].g == mapaa[i][m-j+1].g && mapaa[i][j].b == mapaa[i][m-j+1].b)
            {

            }
            else
            {
                flag=false;
                break;
            }
        }
    }
    return flag;
}

int main()
{
    
    cin >> n >> m >> q;
    for (int cs=0;cs<q;cs++)
    {
        int i,j,t,c;
        cin >> i >> j >> t >> c;
        c%=256;
        switch(t)
        {
            case 1:mapaa[i][j].r=(mapaa[i][j].r+c)%256;break;
            case 2:mapaa[i][j].g=(mapaa[i][j].g+c)%256;break;
            case 3:mapaa[i][j].b=(mapaa[i][j].b+c)%256;break;
            
                        
        }
        if (dc())
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }
    
}
2023/6/17 08:50
加载中...