oj.uz

Submission #1003938

# Submission time Handle Problem Language Result Execution time Memory
1003938 2024-06-20T20:23:03 Z vjudge1 Paint (COI20_paint) C++17
8 / 100
 3000 ms 3264 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const int MAXN = 5e5+5;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define fr first
#define sc second

int n, m, q, c, aux[4] = {0,0,1,-1};
vector<vector<bool>> vis;
vector<vector<int>> v;
vector<pii> V;

void dfs(int x, int y) {
    V.pb({x,y});
    vis[x][y] = 1;

    for(int i = 0; i < 4; i++) {
        int a = x+aux[i], b = y+aux[3-i];
        if(a >= 0 and b >= 0 and a < n and b < m and v[a][b] == v[x][y] and !vis[a][b])
            dfs(a,b);
    }
    
    v[x][y] = c;
}

void bfs(int v1, int v2) {
    queue<pii> fila;
    fila.push({v1,v2});
    vis[v1][v2] = 1;

    while(!fila.empty()) {
        auto [x,y] = fila.front();
        fila.pop();
        V.pb({x,y});
        //cout << x << " " << y << "\n";
        
        for(int i = 0; i < 4; i++) {
            int a = x+aux[i], b = y+aux[3-i];
            if(a >= 0 and b >= 0 and a < n and b < m and v[a][b] == v[x][y] and !vis[a][b])
                fila.push({a,b}), vis[a][b] = 1;
        }

        v[x][y] = c;
    }
}
int main() {

    cin >> n >> m;
    v.resize(n);
    vis.resize(n);
    
    for(int i = 0; i < n; i++) {
        v[i].resize(m);
        vis[i].resize(m);
        for(int j = 0; j < m; j++)
            cin >> v[i][j];
    }

    cin >> q;
    while(q--) {
        int a, b;
        cin >> a >> b >> c;
        a--;
        b--;
        //cout << "ok\n";

        bfs(a,b);
        //cout << "fim bfs\n";

        for(auto [x,y] : V) vis[x][y] = 0;
        V.clear();
    }

    //cout << "ok\n";
    for(int i = 0; i < n; i++)
        for(int j = 0; j < m; j++)
            cout << v[i][j] << " \n"[j==m-1];
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 4 ms 476 KB Output is correct
5 Correct 302 ms 592 KB Output is correct
6 Correct 598 ms 604 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 604 KB Output is correct
2 Correct 303 ms 1108 KB Output is correct
3 Execution timed out 3033 ms 2320 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3031 ms 3264 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 1744 KB Output is correct
2 Execution timed out 3057 ms 2252 KB Time limit exceeded
3 Halted 0 ms 0 KB -