Robotti

#include <bits/stdc++.h>
using namespace std;
int n;
char t[20][20];
int s {};
void search(int x, int y, int d)
{
    ++s;
    if(x == n || x == -1 || y == n || y == -1) return;
    if(t[x][y] == '.')
    {
        if(d == 0) search(x, y + 1, d);
        else if(d == 1) search(x, y - 1, d);
        else if(d == 2) search(x + 1, y, d);
        else search(x - 1, y, d);
    }
    else if(t[x][y] == '/')
    {
        t[x][y] = '\\';
        if(d == 0) search(x - 1, y, 3);
        if(d == 1) search(x + 1, y, 2);
        if(d == 2) search(x, y - 1, 1);
        if(d == 3) search(x, y + 1, 0);
    }
    else
    {
        t[x][y] = '/';
        if(d == 1) search(x - 1, y, 3);
        if(d == 0) search(x + 1, y, 2);
        if(d == 3) search(x, y - 1, 1);
        if(d == 2) search(x, y + 1, 0);
    }
}
int main()
{
    cin >> n;
    for(int i {}; i < n; ++i)
        for(int j {}; j < n; ++j)
            cin >> t[j][i];
    search(0, 0, 0);
    cout << s - 1;
}

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