Submission

Score: 100

User: bananakung

Problemset: บริษัททำความสะอาด

Language: cpp

Time: 0.004 second

Submitted On: 2026-09-20 14:38:12

#include<bits/stdc++.h>
using namespace std;
int b[505][505];
int main()
{
	int n;
	char t;
	
	cin>>n;
	
	cin>>t;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			cin>>t>>b[i][j];
		}
		cin>>t>>t;
	}
	int sum=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)
		{
			//cout<<b[i][j]<<" ";
			if(b[i][j]!=0)
			{
				sum+=2;
				sum+=max(0,b[i][j]-b[i-1][j]);
				sum+=max(0,b[i][j]-b[i+1][j]);
				sum+=max(0,b[i][j]-b[i][j+1]);
				sum+=max(0,b[i][j]-b[i][j-1]);
			}
			
		}
		//cout<<endl;
	
	}
	cout<<sum;
	
	
	
	
	
	
	
	
	
	
	
	
	
}