| 18792 | 2025-11-05 02:22:08 | diak | Tóparti séta | cpp17 | Accepted 100/100 | 72ms | 1516 KiB |
#include <bits/stdc++.h>
using namespace std;
int main() {
int ans = 0, N, M; cin >> N >> M;
vector<vector<char>> v(N, vector<char>(M)); for (vector<char>& e : v) for (char& f : e) cin >> f;
for (int i = 1; i < N - 1; ++i) for (int j = 1; j < M - 1; ++j) {
if (v[i][j] == '.') continue;
if (v[i - 1][j] == '.') ++ans;
if (v[i + 1][j] == '.') ++ans;
if (v[i][j - 1] == '.') ++ans;
if (v[i][j + 1] == '.') ++ans; }
cout << ans << '\n';
return 0; }| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 500 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| subtask2 | 50/50 | ||||||
| 3 | Accepted | 1ms | 316 KiB | ||||
| 4 | Accepted | 4ms | 316 KiB | ||||
| 5 | Accepted | 64ms | 1516 KiB | ||||
| subtask3 | 30/30 | ||||||
| 6 | Accepted | 1ms | 512 KiB | ||||
| 7 | Accepted | 1ms | 500 KiB | ||||
| 8 | Accepted | 1ms | 508 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| subtask4 | 20/20 | ||||||
| 10 | Accepted | 1ms | 316 KiB | ||||
| 11 | Accepted | 1ms | 316 KiB | ||||
| 12 | Accepted | 1ms | 316 KiB | ||||
| 13 | Accepted | 4ms | 316 KiB | ||||
| 14 | Accepted | 64ms | 1516 KiB | ||||
| 15 | Accepted | 1ms | 512 KiB | ||||
| 16 | Accepted | 1ms | 500 KiB | ||||
| 17 | Accepted | 1ms | 508 KiB | ||||
| 18 | Accepted | 1ms | 316 KiB | ||||
| 19 | Accepted | 71ms | 1400 KiB | ||||
| 20 | Accepted | 72ms | 1412 KiB | ||||
| 21 | Accepted | 65ms | 1332 KiB | ||||
| 22 | Accepted | 64ms | 1412 KiB | ||||