제출 #381590

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381590		ne4eHbKa	Paint (COI20_paint)	C++17	0 / 100	130 ms	31828 KiB

paint

#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

int n, m, k;
vector<vector<int>> a, id, lst;
const int N = 2e5 + 5;
int p[N], cl[N];

int get(int i) {return p[i] == i ? i : p[i] = get(p[i]);}
void unite(int i, int j) {p[get(i)] = get(j);}

vector<vector<unordered_map<int, int>>> f;

struct ev {
    int i, j, c, t;
    void perform(int x, int y) {
        if(x < 0 || y < 0 || x >= n || y >= m)
            return;
        auto &e = f[x][y];
        if(e.find(c) == e.end())
            return;
        if(lst[i][j] > e[c])
            unite(id[i][j], id[x][y]);
    }
    void perform() {
        f[i][j][c] = t;
        for(int d : {-1, +1})
            perform(i + d, j),
            perform(i, j + d);
        lst[i][j] = t;
    }
};

vector<ev> es;

void solve() {
    cin >> n >> m;
    a.assign(n, vector<int>(m, +inf));
    id = lst = a;
    k = 0;
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            cin >> a[i][j], id[i][j] = k++;
    iota(p, p + k, 0);
    int q; cin >> q;
    es.clear();
    f.assign(n, vector<unordered_map<int, int>>(m));
    for(int i = 0; i < n; ++i)
        for(int j = 0; j < m; ++j)
            es.push_back({i, j, a[i][j], 0});
    for(int i = 1; i <= q; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        es.push_back({--x, --y, c, i});
    }
    for(int t = len(es) - 1; ~t; --t)
        es[t].perform();
    for(int i = 0; i < len(es); ++i)
        cl[get(id[es[i].i][es[i].j])] = es[i].c;
    for(int i = 0; i < n; ++i, cout << '\n')
        for(int j = 0; j < m; ++j)
            cout << cl[get(id[i][j])] << ' ';
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL
//    freopen("file.in", "r", stdin);
//    freopen("file.out", "w", stdout);
#else
    system("color a");
    freopen("in.txt", "r", stdin);
    int t; cin >> t;
    while(t--)
#endif
    solve();
}

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