Submission #3730849
Source Code Expand
#include<bits/stdc++.h> using namespace std; #define p_ary(ary,a,b,i) do { cout << "["; for (int i = a;i <= b;++i) cout << ary[i] << (b == i ? "]\n" : ", "); } while(0) #define p_map(map,it) do {cout << "{";for (auto it = map.begin();;++it) {if (it == map.end()) {cout << "}\n";break;}else cout << "" << it->first << "=>" << it->second << ", ";}}while(0) int main() { int n,m; //int s[510][510],ans[510][510]; vector<vector<int>> s(510,vector<int>(510,0)),ans(510,vector<int>(510,0)); cin >> n >> m; for (int i = 0;i < n;++i) { for (int j = 0;j < m;++j) { char c; cin >> c; s[i][j] = c-'0'; } } for (int i = 0;i < n;++i) { for (int j = 0;j < m;++j){ if (s[i][j]){ ans[i+1][j] += s[i][j]; s[i+1][j-1] -= s[i][j]; s[i+1][j+1] -= s[i][j]; s[i+2][j] -= s[i][j]; } } } for (int i = 0;i < n;++i) { for (int j = 0;j < m;++j) cout << ans[i][j]; cout << "\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - アメーバ |
User | koikotya |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1115 Byte |
Status | AC |
Exec Time | 28 ms |
Memory | 2560 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 | 2 ms | 2304 KB |
sample_02.txt | AC | 2 ms | 2304 KB |
sample_03.txt | AC | 2 ms | 2304 KB |
subtask1_01.txt | AC | 2 ms | 2304 KB |
subtask1_02.txt | AC | 2 ms | 2304 KB |
subtask1_03.txt | AC | 28 ms | 2560 KB |
subtask1_04.txt | AC | 28 ms | 2560 KB |
subtask1_05.txt | AC | 28 ms | 2560 KB |
subtask1_06.txt | AC | 28 ms | 2560 KB |
subtask1_07.txt | AC | 28 ms | 2560 KB |
subtask1_08.txt | AC | 28 ms | 2560 KB |
subtask1_09.txt | AC | 28 ms | 2560 KB |
subtask1_10.txt | AC | 4 ms | 2304 KB |
subtask1_11.txt | AC | 3 ms | 2304 KB |
subtask1_12.txt | AC | 17 ms | 2432 KB |
subtask1_13.txt | AC | 10 ms | 2432 KB |
subtask1_14.txt | AC | 10 ms | 2432 KB |
subtask1_15.txt | AC | 17 ms | 2432 KB |
subtask1_16.txt | AC | 9 ms | 2304 KB |
subtask1_17.txt | AC | 8 ms | 2304 KB |
subtask1_18.txt | AC | 3 ms | 2304 KB |
subtask1_19.txt | AC | 5 ms | 2304 KB |
subtask1_20.txt | AC | 3 ms | 2304 KB |
subtask1_21.txt | AC | 10 ms | 2432 KB |
subtask1_22.txt | AC | 6 ms | 2304 KB |
subtask1_23.txt | AC | 13 ms | 2432 KB |
subtask1_24.txt | AC | 12 ms | 2432 KB |