oj.uz

Submission #557741

# Submission time Handle Problem Language Result Execution time Memory
557741 2022-05-06T01:46:06 Z Yazan_Alattar Paint (COI20_paint) C++14
8 / 100
 3000 ms 3012 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 500007;
const ll inf = 2e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const double eps = 1e-6;
const int dx[] = {0, -1, 0, 1}, dy[] = {1, 0, -1, 0};
const int block = 320;

int n, m;

int main(){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    vector < vector <int> > a(n + 1, vector <int> (m + 1));

    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) cin >> a[i][j];

    int q; cin >> q;
    while(q--){
        int x, y, c;
        cin >> x >> y >> c;
        if(a[x][y] == c) continue;

        int in = a[x][y];
        a[x][y] = c;

        queue < pair <int,int> > q;
        q.push({x, y});

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

            for(int i = 0; i < 4; ++i){
                int nx = dx[i] + node.F;
                int ny = dy[i] + node.S;

                if(nx && ny && nx <= n && ny <= m && a[nx][ny] == in){
                    a[nx][ny] = c;
                    q.push({nx, ny});
                }
            }
        }
    }

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= m; ++j) cout << a[i][j] << " ";
        cout << endl;
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 4 ms 440 KB Output is correct
5 Correct 345 ms 440 KB Output is correct
6 Correct 531 ms 420 KB Output is correct
7 Correct 0 ms 316 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 1548 KB Output is correct
2 Correct 211 ms 2400 KB Output is correct
3 Execution timed out 3080 ms 3012 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2272 ms 2032 KB Output is correct
2 Correct 399 ms 2088 KB Output is correct
3 Correct 472 ms 2168 KB Output is correct
4 Execution timed out 3059 ms 1868 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 1540 KB Output is correct
2 Execution timed out 3064 ms 2376 KB Time limit exceeded
3 Halted 0 ms 0 KB -