結果
問題 | No.307 最近色塗る問題多くない? |
ユーザー | tancahn2380 |
提出日時 | 2018-03-31 19:35:12 |
言語 | C++11 (gcc 13.3.0) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,512 bytes |
コンパイル時間 | 865 ms |
コンパイル使用メモリ | 106,376 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-06-26 03:40:20 |
合計ジャッジ時間 | 5,142 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,944 KB |
testcase_07 | AC | 7 ms
6,944 KB |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | WA | - |
testcase_11 | RE | - |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 24 ms
6,940 KB |
testcase_14 | AC | 4 ms
6,940 KB |
testcase_15 | AC | 4 ms
6,940 KB |
testcase_16 | AC | 3 ms
6,940 KB |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | AC | 3 ms
6,940 KB |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | AC | 16 ms
6,944 KB |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:120:38: warning: ‘ans’ may be used uninitialized in this function [-Wmaybe-uninitialized] 120 | else cout << ans; | ^~~
ソースコード
# include <iostream># include <algorithm># include <vector># include <string># include <set># include <map># include <cmath># include <iomanip># include <functional># include <utility># include <stack># include <queue># include <list># include <tuple># include <unordered_map># include <numeric># include <complex># include <bitset># include <random># include <chrono>using namespace std;using LL = long long;using ULL = unsigned long long;constexpr int INF = 2147483647;constexpr int HINF = INF / 2;constexpr double DINF = 100000000000000000.0;constexpr double HDINF = 50000000000000000.0;constexpr long long LINF = 9223372036854775807;constexpr long long HLINF = 4500000000000000000;const double PI = acos(-1);int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 };template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };# define ALL(x) (x).begin(),(x).end()# define UNIQ(c) (c).erase(unique(ALL((c))),(c).end())# define LOWER(s) transform(ALL((s)),(s).begin(),TL<char>)# define UPPER(s) transform(ALL((s)),(s).begin(),TU<char>)# define mp make_pair# define eb emplace_back# define FOR(i,a,b) for(LL i=(a);i<(b);i++)# define RFOR(i,a,b) for(LL i=(a);i>=(b);i--)# define REP(i,n) FOR(i,0,n)# define INIT std::ios::sync_with_stdio(false);std::cin.tie(0)int h, w;int Par[100000];int Rank[100000];void init(int n) {for (int i = 0; i < n; i++) {Par[i] = i;Rank[i] = 0;}}int find(int x) {if (Par[x] == x) {return x;}else {return Par[x] = find(Par[x]);}}void unite(int x, int y) {x = find(x);y = find(y);if (x == y) return;if (Rank[x] < Rank[y]) {Par[x] = y;}else {Par[y] = x;if (Rank[x] == Rank[y])Rank[x]++;}}bool same(int x, int y) {return find(x) == find(y);}int a[1010][1010];void dfs(int y, int x, int c) {a[y][x] = c;REP(k, 4) {int nx = x + dx[k], ny = y + dy[k];if (0 <= nx&&nx < w && 0 <= ny&&ny < h&&a[ny][nx] != c) {dfs(ny, nx, c);}}return;}int main() {cin >> h >> w;init(h*w * 10);REP(i, h)REP(j, w) {cin >> a[i][j];}int q;cin >> q;int ans;REP(Q, q) {int r, c, x;cin >> r >> c >> x;r--, c--;if (q >= h + w) {ans = x;continue;}if(a[r][c]!=x)dfs(r, c, x);}REP(i, h) {REP(j, w) {if (j)cout << " ";if(q<h+w)cout << a[i][j];else cout << ans;}cout << endl;}//system("pause");}