Revise paste Untitled

#include <iostream>
#include <vector>
#include <queue>
using namespace std;
int main()
{
    int n, m;
    cin >> n >> m;
    
    char mat[n][m];
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> mat[i][j];
        }
    }
    
    vector<vector<bool>> visited(n, vector<bool>(m, false));
    
    int prezhiveani_ovci = 0;
    int prezhiveani_volci = 0;
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            if(!visited[i][j] and mat[i][j] != '#') {
                queue<int> q;
                q.push(i);
                q.push(j);
                
                visited[i][j] = true;
                
                int kolku_ovci = 0;
                int kolku_volci = 0;
                
                while(!q.empty()) {
                    int ci = q.front();
                    q.pop();
                    int cj = q.front();
                    q.pop();
                 
                    if(mat[ci][cj] == 'v') {
                        kolku_volci++;
                    }
                    if(mat[ci][cj] == 'o') {
                        kolku_ovci++;
                    }
                    
                    if(ci + 1 < n and mat[ci + 1][cj] != '#' and !visited[ci + 1][cj]) {
                        visited[ci + 1][cj] = true;
                        q.push(ci + 1);
                        q.push(cj);
                    }
                    if(ci - 1 >= 0 and mat[ci - 1][cj] != '#' and !visited[ci - 1][cj]) {
                        visited[ci - 1][cj] = true;
                        q.push(ci - 1);
                        q.push(cj);
                    }
                    if(cj + 1 < m and mat[ci][cj + 1] != '#' and !visited[ci][cj + 1]) {
                        visited[ci][cj + 1] = true;
                        q.push(ci);
                        q.push(cj + 1);
                    }
                    if(cj - 1 >= 0 and mat[ci][cj - 1] != '#' and !visited[ci][cj - 1]) {
                        visited[ci][cj - 1] = true;
                        q.push(ci);
                        q.push(cj - 1);
                    }
                }
                if(kolku_ovci > kolku_volci) {
                    prezhiveani_ovci += kolku_ovci;
                }
                else {
                    prezhiveani_volci += kolku_volci;
                }

}
        }
    }
        cout << prezhiveani_ovci << " " << prezhiveani_volci << endl;
    
    return 0;
}