#include <bits/stdc++.h>
#define f first
#define s second
#define m_p make_pair
#define vec vector
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
const int N=2e5+1;
const int K=400;
//vec<vec<int>>who[2*N/K+1];
map<int,vec<int>> who[N];
//map<int,int> mp[N];
int idt;
int c[N];
int id[N],p[N];
vec<int> neig[N];
vec<int> with[N];
vec<int> bigs;
int n,m;
int ii(int i,int j){
return i*m+j;
}
void make(int v){
id[v]=-1;p[v]=v;
}
int get(int v){
return p[v]=(p[v]==v?v:get(p[v]));
}
int used[N],tt;
void get_unique(vec<int> &vc){
++tt;
vec<int> n_vc;
for(auto &z : vc){
if(used[z]!=tt)
n_vc.pb(z);
used[z]=tt;
}
swap(vc,n_vc);
}
void mg(int a,int b,bool type=1){
a=get(a),b=get(b);
if(a==b) return;
if(sz(neig[a])>sz(neig[b])) swap(a,b);
p[a]=b;
for(auto &z : neig[a]) z=get(z);
get_unique(neig[a]);
for(auto &z : neig[a]){
if(z==b) continue;
neig[b].pb(z);
}
if(!type){
neig[a].clear();
return;
}
if(id[b]==-1 && sz(neig[b])>=K){
id[b]=idt++;
bigs.pb(b);
for(auto &z : neig[b]) z=get(z);
get_unique(neig[b]);
for(auto &z : neig[b]){
if(z==b) continue;
who[id[b]][c[z]].pb(z);
with[z].pb(b);
}
}
else if(id[b]!=-1){
for(auto &z : neig[a]){
if(z==b) continue;
who[id[b]][c[z]].pb(z);
with[z].pb(b);
}
}
if(sz(with[a])>sz(with[b])) swap(with[a],with[b]);
for(auto &z : with[a]) with[b].pb(z);
for(auto &z : with[b]) z=get(z);
get_unique(with[b]);
for(auto &z : with[b]){
who[id[z]][c[b]].pb(b);
}
neig[a].clear();
}
signed main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
cin>>n>>m;
for(int i=0;i<n*m;i++)
make(i);
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
cin>>c[ii(i,j)];
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
if(i){
if(c[ii(i-1,j)]==c[ii(i,j)])
mg(ii(i,j),ii(i-1,j),0);
else
neig[get(ii(i,j))].pb(ii(i-1,j)),neig[get(ii(i-1,j))].pb(ii(i,j));
}
if(j){
if(c[ii(i,j-1)]==c[ii(i,j)])
mg(ii(i,j),ii(i,j-1),0);
else
neig[get(ii(i,j))].pb(ii(i,j-1)),neig[get(ii(i,j-1))].pb(ii(i,j));
}
}
}
vec<int> ids(n*m);iota(all(ids),0);
for(auto &z : ids) z=get(z);
get_unique(ids);
for(auto &b : ids){
if(sz(neig[b])>=K){
id[b]=idt++;
bigs.pb(b);
for(auto &z : neig[b]) z=get(z);
get_unique(neig[b]);
for(auto &z : neig[b]){
if(z==b) continue;
who[id[b]][c[z]].pb(z);
with[z].pb(b);
}
}
}
auto colour=[&](int v,int ct){
c[v]=ct;
if(id[v]!=-1){
vec<int> kek=who[id[v]][ct];
who[id[v]][ct].clear();
for(auto &z : kek){
if(c[v]==c[get(z)])
mg(v,z);
}
}
else{
vec<int> kek=neig[v];
for(auto &z : kek){
if(c[v]==c[get(z)])
mg(v,z);
}
}
};
int q;
cin>>q;
for(int t=0;t<q;t++){
int i,j,ct;
cin>>i>>j>>ct;--i;--j;
colour(get(ii(i,j)),ct);
}
for(int i=0;i<n;i++){
for(int j=0;j<m;j++)
cout<<c[get(ii(i,j))]<<' ';
cout<<'\n';
}
return 0;
}
/*
16 5
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
*/
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
12 ms |
19156 KB |
Output is correct |
| 2 |
Correct |
10 ms |
19088 KB |
Output is correct |
| 3 |
Correct |
13 ms |
19720 KB |
Output is correct |
| 4 |
Incorrect |
15 ms |
19668 KB |
Output isn't correct |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
50 ms |
21844 KB |
Output is correct |
| 2 |
Correct |
108 ms |
23768 KB |
Output is correct |
| 3 |
Correct |
172 ms |
31160 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
176 ms |
35940 KB |
Output is correct |
| 2 |
Correct |
153 ms |
33840 KB |
Output is correct |
| 3 |
Runtime error |
116 ms |
61344 KB |
Execution killed with signal 11 |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
129 ms |
28456 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
