結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | shimomire |
提出日時 | 2015-11-28 01:15:53 |
言語 | C++11 (gcc 11.4.0) |
結果 |
AC
|
実行時間 | 138 ms / 4,000 ms |
コード長 | 6,408 bytes |
コンパイル時間 | 1,308 ms |
コンパイル使用メモリ | 125,048 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-05-01 16:44:50 |
合計ジャッジ時間 | 2,831 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 4 ms
5,376 KB |
testcase_08 | AC | 16 ms
5,376 KB |
testcase_09 | AC | 6 ms
5,376 KB |
testcase_10 | AC | 4 ms
5,376 KB |
testcase_11 | AC | 6 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 9 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 2 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 9 ms
5,376 KB |
testcase_18 | AC | 25 ms
5,376 KB |
testcase_19 | AC | 22 ms
5,376 KB |
testcase_20 | AC | 2 ms
5,376 KB |
testcase_21 | AC | 18 ms
5,376 KB |
testcase_22 | AC | 15 ms
5,376 KB |
testcase_23 | AC | 120 ms
5,376 KB |
testcase_24 | AC | 49 ms
5,376 KB |
testcase_25 | AC | 69 ms
5,376 KB |
testcase_26 | AC | 135 ms
5,376 KB |
testcase_27 | AC | 11 ms
5,376 KB |
testcase_28 | AC | 17 ms
5,376 KB |
testcase_29 | AC | 7 ms
5,376 KB |
testcase_30 | AC | 138 ms
5,376 KB |
testcase_31 | AC | 16 ms
5,376 KB |
testcase_32 | AC | 15 ms
5,376 KB |
testcase_33 | AC | 8 ms
5,376 KB |
testcase_34 | AC | 15 ms
5,376 KB |
testcase_35 | AC | 15 ms
5,376 KB |
ソースコード
#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;} }; 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; int c1=0;for(int y:range(H))for(int x:range(W))c1 +=board[y][x]; int Q;cin >> Q;bool all = false; for(int q:range(Q)){ int r,c,x;cin >> r >> c >> x;r--;c--; if(all){ board[0][0] = x; continue; } if(board[r][c]==x)continue; queue<pair<int,int>> que; que.push({r,c}); c1 += x - board[r][c];board[r][c] = x; while(!que.empty()){ int r,c;tie(r,c)=que.front();que.pop(); for(int d:range(4)){ int ny= r + dy[d],nx = c + dx[d]; if(!IN(0,ny,H) || !IN(0,nx,W))continue; if(board[ny][nx]!=x){ c1 += x - board[ny][nx];board[ny][nx] = x; que.push({ny,nx}); } } } if(c1 == 0 || c1 == H*W)all = true; } if(all) for(int y:range(H))for(int x:range(W))board[y][x] = board[0][0]; for(int y:range(H)){ for(int x:range(W)){ if(x!=0) cout <<" "; cout << board[y][x]; } cout << endl; } } }; int main(){ cout <<fixed<<setprecision(20); cin.tie(0); ios::sync_with_stdio(false); Main().run(); return 0; }