Lehmät

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
ll t[105][105];
 
int main() {
  ll n, m;
  char a;
  cin >> n >> m;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      cin >> a;
      if (a == '*') t[i][j] = 1;
      else if (a == '@') t[i][j] = 2;
    }
  }
  ll s = 0;
  bool to = false;
  bool tor = false;
  for (int i = 0; i < n; ++i) {
    for (int j = 0; j < m; ++j) {
      //cout << s << " " << i << " " << j << " " << to << " " << tor << endl;
      if (to && tor && t[i][j] == 2) {
        s += 1;
      }
      else if (t[i][j] == 1 && t[i][j+1] == 1) {
        to = !to;
        break;
      }
      else if (to) {
        if (t[i][j] == 1) {
          tor = !tor;
          if (!tor) break;
        }
      }
    }
  }
  cout << s << endl;
}

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