Submission #2515735
Source Code Expand
#include <bits/stdc++.h> #define int long long using namespace std; const int INF = 1e9 + 7, MOD = 1e9 + 7; const long long LINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; signed main() { int h, w; cin >> h >> w; int table[h][w], ans[h][w] = {}; for (int i = 0; i < h; i++) { string s; cin >> s; for (int j = 0; j < w; j++) { table[i][j] = s[j] - '0'; } } for (int i = 1; i <= h - 2; i++) { for (int j = 1; j <= w - 2; j++) { bool flag = true; int Min = INF; for (int k = 0; k < 4; k++) { if (!table[i + dx[k]][j + dy[k]]) { flag = false; } else { Min = min(Min, table[i + dx[k]][j + dy[k]]); } } if (flag) { for (int k = 0; k < 4; k++) { table[i + dx[k]][j + dy[k]] -= Min; } ans[i][j] = Min; } } } for (int i = 0; i < h; i++) { for (int j = 0; j < w; j++) { cout << ans[i][j]; } cout << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - アメーバ |
User | Impulse |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 963 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 4352 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 25 ms | 4352 KB |
subtask1_04.txt | AC | 25 ms | 4352 KB |
subtask1_05.txt | AC | 25 ms | 4352 KB |
subtask1_06.txt | AC | 25 ms | 4352 KB |
subtask1_07.txt | AC | 25 ms | 4352 KB |
subtask1_08.txt | AC | 25 ms | 4352 KB |
subtask1_09.txt | AC | 26 ms | 4224 KB |
subtask1_10.txt | AC | 3 ms | 512 KB |
subtask1_11.txt | AC | 3 ms | 384 KB |
subtask1_12.txt | AC | 15 ms | 2432 KB |
subtask1_13.txt | AC | 8 ms | 1408 KB |
subtask1_14.txt | AC | 9 ms | 1408 KB |
subtask1_15.txt | AC | 15 ms | 2304 KB |
subtask1_16.txt | AC | 8 ms | 1280 KB |
subtask1_17.txt | AC | 6 ms | 1024 KB |
subtask1_18.txt | AC | 2 ms | 256 KB |
subtask1_19.txt | AC | 4 ms | 512 KB |
subtask1_20.txt | AC | 2 ms | 384 KB |
subtask1_21.txt | AC | 9 ms | 1408 KB |
subtask1_22.txt | AC | 5 ms | 768 KB |
subtask1_23.txt | AC | 11 ms | 1792 KB |
subtask1_24.txt | AC | 11 ms | 1792 KB |