結果
| 問題 |
No.307 最近色塗る問題多くない？
|
| コンテスト | |
| ユーザー |
 shimomire
|
| 提出日時 | 2015-11-28 00:52:38 |
| 言語 | C++11（廃止可能性あり） (gcc 13.3.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 7,609 bytes |
| コンパイル時間 | 1,340 ms |
| コンパイル使用メモリ | 129,544 KB |
| 実行使用メモリ | 23,772 KB |
| 最終ジャッジ日時 | 2024-09-14 00:58:52 |
| 合計ジャッジ時間 | 7,334 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 6 WA * 2 TLE * 1 -- * 27 |
ソースコード
#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;
typedef long long ll;typedef unsigned long long ull;typedef long double ld;
#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"
struct range{
struct Iter{
int v,step;
Iter& operator++(){v+=step;return *this;}
bool operator!=(Iter& itr){return v<itr.v;}
int& operator*(){return v;}
};
Iter i, n;
range(int i, int n,int step):i({i,step}), n({n,step}){}
range(int i, int n):range(i,n,1){}
range(int n):range(0,n){}
Iter& begin(){return i;}
Iter& end(){return n;}
};
struct rrange{
struct Iter{
int v,step;
Iter& operator++(){v-=step;return *this;}
bool operator!=(Iter& itr){return v>itr.v;}
int& operator*(){return v;}
};
Iter i, n;
rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
rrange(int i, int n):rrange(i,n,1){}
rrange(int n) :rrange(0,n){}
Iter& begin(){return n;}
Iter& end(){return i;}
};
//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}
// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};
template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};
// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}
template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}
ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
template<class Cost> struct Edge{
int from,to;Cost cost;
Edge(int from,int to,Cost cost):from(from),to(to),cost(cost){};
bool operator<(Edge r) const{ return cost<r.cost;}
bool operator>(Edge r) const{ return cost>r.cost;}
};
struct UnionFind{
vector<Edge<int>> es;
vector<vector<int> > f_cache, t_cache;
vector<int> col;
vector<int> par,rank,ss;
int size;
UnionFind(int n):size(n){
par=vector<int>(n);iota(ALL(par),0);
rank = vector<int>(n);ss=vector<int>(n,1);
col = vector<int>(n);
f_cache = vector<vector<int> >(n); t_cache = vector<vector<int> >(n);
}
void add_edge(int f,int t, int x){
int ei = es.size(); es.push_back({f,t,x});
f_cache[f].push_back(ei); t_cache[t].push_back(ei);
}
int root(int x){ return par[x] = par[x] == x ? x: root(par[x]);}
bool same(int x,int y){ return root(x) == root(y);}
void unite(int x,int y){
x = root(x);y = root(y);
if(x==y)return;
if(f_cache[x].size() + t_cache[x].size() > f_cache[y].size() + t_cache[y].size()) swap(x,y);
// if(rank[x]>rank[y])swap(x,y);
for(int ei:f_cache[x]) f_cache[y].push_back(ei);
for(int ei:t_cache[x]) t_cache[y].push_back(ei);
par[x] = y;ss[y]+=ss[x];
if(rank[x] == rank[y]) rank[x]++;
size--;
}
int getS(int x){ return ss[root(x)];}
};
int dy[4] = {0,1,0,-1},dx[4]={1,0,-1,0};
class Main{
public:
int H,W;
int enc(int y,int x){return y * W + x;}
void run(){
cin >> H >> W;
vector<vector<int>> board(H,vector<int>(W));cin >> board;
UnionFind uf(H*W);
for(int y:range(H))for(int x:range(W)) uf.col[enc(y,x)]=board[y][x];
for(int y:range(H))for(int x:range(W)){
for(int d:range(4)){
int ny = y + dy[d],nx = x + dx[d];
if(!IN(0,ny,H) || !IN(0,nx,W))continue;
uf.add_edge(enc(y,x),enc(ny,nx),1);
uf.add_edge(enc(ny,nx),enc(y,x),1);
if(board[y][x]==board[ny][nx]) uf.unite(enc(y,x),enc(ny,nx));
}
}
int Q;cin >> Q;
for(int q:range(Q)){
int r,c,x;cin >> r >> c >> x;r--;c--;
int gi = uf.root(enc(r,c));
if(uf.col[gi]!=x){
for(int i:range(uf.f_cache[gi].size()))uf.unite(gi, uf.root(uf.es[uf.f_cache[gi][i]].to));
uf.col[uf.root(gi)] = x;
}
}
// for(int y:range(H)){
// for(int x:range(W)){
// if(x!=0) cout <<" ";
// cout << uf.root(enc(y,x));
// }
// cout << endl;
// }
for(int y:range(H)){
for(int x:range(W)){
if(x!=0) cout <<" ";
cout << uf.col[uf.root(enc(y,x))];
}
cout << endl;
}
}
};
int main(){
cout <<fixed<<setprecision(20);
cin.tie(0);
ios::sync_with_stdio(false);
Main().run();
return 0;
}