結果
問題 | No.697 池の数はいくつか |
ユーザー | nomi |
提出日時 | 2018-07-11 13:48:15 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,598 ms / 6,000 ms |
コード長 | 2,406 bytes |
コンパイル時間 | 1,945 ms |
コンパイル使用メモリ | 171,868 KB |
実行使用メモリ | 24,320 KB |
最終ジャッジ日時 | 2024-11-08 08:01:48 |
合計ジャッジ時間 | 14,534 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 3 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 2 ms
5,248 KB |
testcase_18 | AC | 2 ms
5,248 KB |
testcase_19 | AC | 2 ms
5,248 KB |
testcase_20 | AC | 2 ms
5,248 KB |
testcase_21 | AC | 2 ms
5,248 KB |
testcase_22 | AC | 2 ms
5,248 KB |
testcase_23 | AC | 2 ms
5,248 KB |
testcase_24 | AC | 178 ms
8,320 KB |
testcase_25 | AC | 179 ms
8,448 KB |
testcase_26 | AC | 177 ms
8,320 KB |
testcase_27 | AC | 180 ms
8,192 KB |
testcase_28 | AC | 178 ms
8,320 KB |
testcase_29 | AC | 1,578 ms
24,192 KB |
testcase_30 | AC | 1,568 ms
24,320 KB |
testcase_31 | AC | 1,581 ms
24,064 KB |
testcase_32 | AC | 1,567 ms
24,192 KB |
testcase_33 | AC | 1,564 ms
24,192 KB |
testcase_34 | AC | 1,598 ms
24,320 KB |
ソースコード
#include <bits/stdc++.h>using namespace std;#define ll long long#define vvi vector<vector<int>>#define vec vector#define pq priority_queue#define all(v) (v).begin(), (v).end()#define uniqueV(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());#define rep(i, n) for (int (i) = (0); (i) < (n); ++(i))#define repp(i, m, n) for (int (i) = (m); (i) < (n); ++(i))#define debug(x) cerr << #x << ": " << x << endl;#define debug2(x, y) cerr<<"("<<#x<<", "<<#y<<") = "<<"("<<x<<", "<<y<<")"<<endl;#define debug3(x, y, z) cerr<<"("<<#x<<", "<<#y<<", "<<#z<<") = "<<"("<<x<<", "<<y<<", "<<z<<")"<<endl;#define debugB(value, size) cerr<<#value<<": "<<bitset<size>(value) << endl;#define line() cerr << "---------------" << endl;const int dx[] = {1, -1, 0, 0};const int dy[] = {0, 0, -1, 1};const double PI = 3.14159265358979323846;template<typename T>void printA(vector<T> &printArray, char between = ' ') {int paSize = printArray.size();for (int i = 0; i < paSize; i++) { cerr << printArray[i] << between;}if (between != '\n') {cerr << endl;}}// ------------------------------------------------------------------------------------------int H, W;bool B[10001][10001];void dfs(int y, int x) {B[y][x] = 0;rep (i, 4) {int ny = y + dy[i], nx = x + dx[i];if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;if (B[ny][nx] == 0) continue;dfs(ny, nx);}}using P = pair<int, int>;void bfs(int ay, int ax) {queue<P> que;que.push({ay, ax});B[ay][ax] = 0;while (que.size()) {P p = que.front(); que.pop();int y = p.first, x = p.second;// debug2(y, x)rep (i, 4) {int ny = y + dy[i], nx = x + dx[i];// debug2(ny, nx)if (ny < 0 || ny >= H || nx < 0 || nx >= W) continue;if(B[ny][nx] == 0) continue;B[ny][nx] = 0;que.push({ny, nx});}}}void print() {rep (i, H) {rep (j, W) {cout << B[i][j];}puts("");}line()}int main() {bool t = 0;cin >> H >> W;rep (i, H) {rep (j, W) {cin >> B[i][j];}}int ans = 0;rep (i, H) {rep (j, W) {if (B[i][j] == 1) {ans++;// dfs(i, j);bfs(i, j);// print();}}}cout << ans << endl;return 0;}