Submission #75849079

Source Code Expand

#include<bits/stdc++.h>
#define ll long long
using namespace std;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int main(){
	int n,m;cin>>n>>m;
	for(int i=1;i<=n;i++,cout<<endl)for(int j=1;j<=m;j++){
		int ans=0;
		for(int k=0;k<4;k++){
			int di=i+dx[k],dj=j+dy[k];
			if(di<1||dj<1||di>n||dj>m)continue;
			ans++;
		}cout<<ans<<' ';
	}
	return 0;
}

Submission Info

Submission Time
Task B - Count Adjacent Cells
User VastYang
Language C++23 (GCC 15.2.0)
Score 200
Code Size 362 Byte
Status AC
Exec Time 1 ms
Memory 3604 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 3536 KiB
00-sample-02.txt AC 1 ms 3392 KiB
00-sample-03.txt AC 1 ms 3604 KiB
01-01.txt AC 1 ms 3400 KiB
01-02.txt AC 1 ms 3536 KiB
01-03.txt AC 1 ms 3368 KiB
01-04.txt AC 1 ms 3476 KiB
01-05.txt AC 1 ms 3392 KiB
01-06.txt AC 1 ms 3476 KiB
01-07.txt AC 1 ms 3536 KiB
01-08.txt AC 1 ms 3568 KiB
01-09.txt AC 1 ms 3376 KiB
01-10.txt AC 1 ms 3456 KiB
01-11.txt AC 1 ms 3604 KiB
01-12.txt AC 1 ms 3456 KiB
01-13.txt AC 1 ms 3420 KiB
01-14.txt AC 1 ms 3456 KiB
01-15.txt AC 1 ms 3400 KiB
01-16.txt AC 1 ms 3376 KiB
01-17.txt AC 1 ms 3456 KiB
01-18.txt AC 1 ms 3376 KiB
01-19.txt AC 1 ms 3552 KiB