#60863 (C++11) No.307 最近色塗る問題多くない？

• 問題: No.307 最近色塗る問題多くない？
• ユーザー: かに
• 提出日時: 2015-11-28 00:14:20
• 言語: C++11 (gcc 11.4.0)
• 結果: TLE
• 実行時間: -
• コード長: 1,911 bytes
• コンパイル時間: 1,444 ms
• コンパイル使用メモリ: 167,084 KB
• 実行使用メモリ: 14,016 KB
• 最終ジャッジ日時: 2024-09-14 00:29:43
• 合計ジャッジ時間: 26,223 ms
• ジャッジサーバーID （参考情報）: judge3 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,376 KB
testcase_02	AC	3 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	3 ms; 5,376 KB
testcase_05	AC	2 ms; 5,376 KB
testcase_06	AC	2 ms; 5,376 KB
testcase_07	AC	9 ms; 5,376 KB
testcase_08	AC	61 ms; 5,376 KB
testcase_09	AC	17 ms; 5,376 KB
testcase_10	AC	441 ms; 5,376 KB
testcase_11	AC	2,916 ms; 5,376 KB
testcase_12	AC	2 ms; 5,376 KB
testcase_13	AC	24 ms; 5,376 KB
testcase_14	AC	3 ms; 5,376 KB
testcase_15	AC	4 ms; 5,376 KB
testcase_16	AC	4 ms; 5,376 KB
testcase_17	AC	22 ms; 5,376 KB
testcase_18	AC	63 ms; 5,376 KB
testcase_19	AC	55 ms; 5,376 KB
testcase_20	AC	3 ms; 5,376 KB
testcase_21	AC	72 ms; 5,376 KB
testcase_22	AC	48 ms; 5,376 KB
testcase_23	AC	322 ms; 5,376 KB
testcase_24	AC	139 ms; 5,376 KB
testcase_25	AC	203 ms; 5,376 KB
testcase_26	AC	364 ms; 5,376 KB
testcase_27	AC	1,399 ms; 5,376 KB
testcase_28	AC	1,423 ms; 5,376 KB
testcase_29	AC	17 ms; 5,376 KB
testcase_30	AC	3,831 ms; 5,376 KB
testcase_31	AC	3,519 ms; 5,376 KB
testcase_32	AC	3,529 ms; 5,376 KB
testcase_33	AC	13 ms; 5,376 KB
testcase_34	TLE	-
testcase_35	--	-

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i,n) for(int i = 0;i < n;i++)
#define P(p) cout<<(p)<<endl;
using namespace std;
typedef long long ll;
int dx[] = { 0, 1, 0, -1 };
int dy[] = { -1, 0, 1, 0 };

int sttoi(std::string str) {
	int ret;
	std::stringstream ss; ss << str;
	ss >> ret;
	return ret;
}

ll gcd(ll a, ll b){
	if (b > a)swap(a, b); if (b == 0)return a; else{ return gcd(b, a%b); }
}

void solve() {
	int n, m;
	cin >> n >> m;
	int board[201][201];
	for (int i = 1; i <= n; i++){
		for (int j = 1; j <= m; j++){
			cin >> board[i][j];
		}
	}
	int q;
	cin >> q;
	bool flag1 = true;
	bool flag2 = true;
	bool end = false;
	int last;
	int x[50000], y[50000], c[50000];
	rep(i, q){
		cin >> y[i] >> x[i] >> c[i];
	}
	rep(i, q){
		stack<pair<int, int>> st;
		st.push(make_pair(x[i], y[i]));
		int f = board[y[i]][x[i]];
		int colo = board[1][1];
		flag1 = true;
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= m; j++){
				if (board[i][j] != colo){
					flag1 = false;
				}
			}
		}
		if (flag1){
			end = true;
			break;
		}
		while (!st.empty()){
			pair<int, int> pos = st.top();
			st.pop();
			board[pos.second][pos.first] = 2;
			for (int j = 0; j < 4; j++){
				int newX = pos.first + dx[j];
				int newY = pos.second + dy[j];
				if (newX >= 1 && newX <= m && newY >= 1 && newY <= n){
					if (board[newY][newX] == f){
						st.push(make_pair(newX, newY));
					}
				}
			}
		}
		for (int j = 1; j <= n; j++){
			for (int k = 1; k <= m; k++){
				if (board[j][k] == 2){
					board[j][k] = c[i];
				}
			}
		}
	}
	if (end){
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= m; j++){
				cout << c[q-1];
				if (j != m)cout << " ";
			}
			cout << endl;
		}
	}
	else{
		for (int i = 1; i <= n; i++){
			for (int j = 1; j <= m; j++){
				cout << board[i][j];
				if (j != m)cout << " ";
			}
			cout << endl;
		}
	}
}

int main() {
	solve();
	return 0;
}