Submission

Score: 20

User: august

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

Language: c

Time: 0.002 second

Submitted On: 2025-10-12 19:30:15

#include <stdio.h>
#include <string.h>

int main() {
    int n;
    scanf("%d", &n);

    int a[n+2][n+2];
    int s=(n+1)*(n+1)+n*n*3;
    char st[s];

    scanf("%s", &st);

    int r=1,c=1;
    for (int i=0; i<strlen(st); i++) {
        if (st[i] >= '0' && st[i] <= '9') {
            a[r][c]=st[i]-'0';
            c++;
        }
        if (c>n) {
            c=1;
            r++;
        }
    } 

    for (int i=0; i<=n+1; i++) a[i][0]=a[0][i]=a[n+1][i]=a[i][n+1]=0;

    int sm=0;

    for (int i=1; i<=n; i++) {
        for (int j=1; j<=n; j++) {
            if (a[i][j] != 0) {
                if (a[i][j] > a[i-1][j]) sm+=a[i][j] - a[i-1][j];
                if (a[i][j] > a[i][j-1]) sm+=a[i][j] - a[i][j-1];
                if (a[i][j] > a[i+1][j]) sm+=a[i][j] - a[i+1][j];
                if (a[i][j] > a[i][j+1]) sm+=a[i][j] - a[i][j+1];
                sm+=2;
            }
        }
    }
    printf("%d", sm);
}