Submission #75840858


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

void O_O() {
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            int cnt = 0;
            for (int k = 0; k < 4; k++) {
                int ni = i + dx[k];
                int nj = j + dy[k];
                cnt += (ni >= 0 && ni < n && nj >= 0 && nj < m);
            }
            cout << cnt << ' ';
        }
        cout << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int TC = 1;
    // cin >> TC;
    while (TC--) {
        O_O();
        if (TC) cout << '\n';
    }

    return 0;
}

Submission Info

Submission Time
Task B - Count Adjacent Cells
User Mariouma
Language C++23 (GCC 15.2.0)
Score 200
Code Size 754 Byte
Status AC
Exec Time 1 ms
Memory 3612 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 3
AC × 22
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt
All 00-sample-01.txt, 00-sample-02.txt, 00-sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 1 ms 3612 KiB
00-sample-02.txt AC 1 ms 3372 KiB
00-sample-03.txt AC 1 ms 3528 KiB
01-01.txt AC 1 ms 3548 KiB
01-02.txt AC 1 ms 3600 KiB
01-03.txt AC 1 ms 3372 KiB
01-04.txt AC 1 ms 3428 KiB
01-05.txt AC 1 ms 3412 KiB
01-06.txt AC 1 ms 3412 KiB
01-07.txt AC 1 ms 3612 KiB
01-08.txt AC 1 ms 3604 KiB
01-09.txt AC 1 ms 3500 KiB
01-10.txt AC 1 ms 3344 KiB
01-11.txt AC 1 ms 3604 KiB
01-12.txt AC 1 ms 3548 KiB
01-13.txt AC 1 ms 3372 KiB
01-14.txt AC 1 ms 3612 KiB
01-15.txt AC 1 ms 3412 KiB
01-16.txt AC 1 ms 3612 KiB
01-17.txt AC 1 ms 3500 KiB
01-18.txt AC 1 ms 3412 KiB
01-19.txt AC 1 ms 3536 KiB