Lehmät

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int N =1e5;
const int inf = 1e9;


int main(){

    int n, m;
    cin >> n >> m;
    int grid[n][m];
    int sy=-1, sx=-1, ey = -1, ex= -1;
    
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < m; ++j){
            char c;cin>>c;
            if(c=='.')grid[i][j]=0;
            else if(c=='@')grid[i][j]=1;
            else{ 
                grid[i][j] = 2; 
                if(sy==-1){
                    sy = i; sx = j;
                }
                else{
                    ey = i; ex = j;
                }
            }
        }
    }

    
    int ans = 0;
    for(int i = sy; i < ey; ++i){
        for(int j = sx; j < ex; ++j){
            if(grid[i][j]==1)ans++;
        }
    }
    cout << ans << "\n";

    
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED