제출 #500009

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
500009		kappa	Paint (COI20_paint)	C++14	0 / 100	3073 ms	5180 KiB

paint

#include <bits/stdc++.h>
#define st first
#define nd second

using namespace std;

long long a, b, q;

void solve(vector<vector<int> > &v){
    long long x, y, col, vis[a + 2][b + 2];
    memset(vis, 0, sizeof(vis));
    
    pair<int, int> dir[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

    cin >> x >> y >> col;

    queue<pair<int, int> > q;

    q.push({x, y});

    while(!q.empty()){
        pair<int, int> curr = q.front();
        q.pop();

        long long cx = curr.st, cy = curr.nd, currColor = v[cx][cy];

        if(vis[cx][cy]) continue;

        vis[cx][cy] = 1;

        v[cx][cy] = col; 

        for (int i = 0; i < 4; i++)
        {
            if(!vis[cx + dir[i].first][cy + dir[i].second] && v[cx + dir[i].first][cy + dir[i].second] == currColor){
                q.push({cx + dir[i].first, cy + dir[i].second});
            }
        }
    }
}

int main(){
    cin >> a >> b;

    vector<vector<int> > d(a + 2, vector<int>(b + 2, 0));

    for (int i = 1; i <= a; i++)
    {
        for (int j = 1; j <= b; j++)
        {
            cin >> d[i][j];
        }
    }

    cin >> q;

    while(q--){
        solve(d);
    }

    for (int i = 1; i <= a; i++)
    {
        for (int j = 1; j <= b; j++)
        {
            cout << d[i][j] << " ";
        }
        cout << "\n";
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 31
• Subtask 4: 0 / 52