Submission #75851649


Source Code Expand

//競プロ C++テンプレ
#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(),x.end()
#define ll long long
#define pb push_back


int main() {
    int N,K;
    cin >> N >> K;
    
    vector<vector<int>> vec(N,vector<int>(K));
    
    for(int i = 0; i < N;i++){
      for(int j = 0; j < K;j++){
        vec.at(i).at(j) = 0;
        if(i != 0){
          vec.at(i).at(j) += 1;
        }
        if(i != N-1){
          vec.at(i).at(j) += 1;
        }
        if(j != 0){
          vec.at(i).at(j) += 1;
        }
        if(j != K-1){
          vec.at(i).at(j) += 1;
        }
      }
    }
    for(int i = 0; i < N;i++){
      for(int j = 0; j < K;j++){
         cout << vec.at(i).at(j) << " ";
      }
      cout << endl;
    }
}

Submission Info

Submission Time
Task B - Count Adjacent Cells
User gumi11ta
Language C++23 (GCC 15.2.0)
Score 200
Code Size 793 Byte
Status AC
Exec Time 1 ms
Memory 3652 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 3640 KiB
00-sample-02.txt AC 1 ms 3652 KiB
00-sample-03.txt AC 1 ms 3640 KiB
01-01.txt AC 1 ms 3488 KiB
01-02.txt AC 1 ms 3568 KiB
01-03.txt AC 1 ms 3424 KiB
01-04.txt AC 1 ms 3480 KiB
01-05.txt AC 1 ms 3408 KiB
01-06.txt AC 1 ms 3536 KiB
01-07.txt AC 1 ms 3572 KiB
01-08.txt AC 1 ms 3536 KiB
01-09.txt AC 1 ms 3536 KiB
01-10.txt AC 1 ms 3568 KiB
01-11.txt AC 1 ms 3424 KiB
01-12.txt AC 1 ms 3408 KiB
01-13.txt AC 1 ms 3444 KiB
01-14.txt AC 1 ms 3408 KiB
01-15.txt AC 1 ms 3532 KiB
01-16.txt AC 1 ms 3424 KiB
01-17.txt AC 1 ms 3472 KiB
01-18.txt AC 1 ms 3536 KiB
01-19.txt AC 1 ms 3568 KiB