Robotti

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define FAST ios::sync_with_stdio(0); cin.tie(0);

int n;
vector<vector<char>> grid;


int next_step(int y, int x, pii dir, int steps){
    pii new_dir = dir;

    if(grid[y][x] == '/'){
        if(dir.first == -1) new_dir = {0, 1};
        else if(dir.first == 1) new_dir = {0, -1};
        else if(dir.second == 1) new_dir = {-1, 0};
        else if(dir.second == -1) new_dir = {1, 0};
        grid[y][x] = '\\';
    }
    else if(grid[y][x] == '\\'){
        if(dir.first == -1) new_dir = {0, -1};
        else if(dir.first == 1) new_dir = {0, 1};
        else if(dir.second == 1) new_dir = {1, 0};
        else if(dir.second == -1) new_dir = {-1, 0};
        grid[y][x] = '/';
    }

    int new_y_loc = y+new_dir.first;
    int new_x_loc = x+new_dir.second;

    if(new_y_loc < 0 || new_y_loc >= n) return steps +1;
    if(new_x_loc < 0 || new_x_loc >= n) return steps +1;

    steps = next_step(new_y_loc, new_x_loc, new_dir, steps+1);

    return steps;
}

int main(){
    
    cin >> n;

    grid.assign(n, vector<char>(n));

    for(int i=0; i<n; i++){
        for (int j = 0; j < n; j++)
        {
            cin >> grid[i][j];
        }   
    }

    int ans = next_step(0, 0, {1, 0}, 0);
    cout << ans;

    return 0;
}

Test 1 (public)

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED