Submission #1185098

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185098		susman	Tracks in the Snow (BOI13_tracks)	C++20	29.58 / 100	783 ms	782520 KiB

tracks

#include <iostream>
#include <vector>
using namespace std;

int rows, cols;
vector<string> grid;
vector<vector<bool>> visited;

void dfs(int i, int j, char type) {
    if (i < 0 || i >= rows || j < 0 || j >= cols) return;
    if (visited[i][j] || grid[i][j] != type) return;
    visited[i][j] = true;
    dfs(i+1, j, type);
    dfs(i-1, j, type);
    dfs(i, j+1, type);
    dfs(i, j-1, type);
}

int main() {
    cin >> rows >> cols;
    grid.resize(rows);
    visited.assign(rows, vector<bool>(cols, false));
    
    for (int i = 0; i < rows; i++) {
        cin >> grid[i];
    }
    
    int count = 0;
    for (int i = 0; i < rows; i++) {
        for (int j = 0; j < cols; j++) {
            if (grid[i][j] != '.' && !visited[i][j]) {
                count++;
                dfs(i, j, grid[i][j]);
            }
        }
    }
    
    cout << count << endl;
    return 0;
}

• Subtask 1: 3.3333 / 30
• Subtask 2: 26.25 / 70