Suunnistus

input/code.cpp: In function 'int main()':
input/code.cpp:111:9: warning: unused variable 'distance' [-Wunused-variable]
  111 |     int distance = 0;
      |         ^~~~~~~~

#include <bits/stdc++.h>

#define newl "\n"

#define X first
#define Y second

#define N 502

using namespace std;

typedef long long ll;

typedef pair<int, int> ip;
typedef pair<ll, ll> lp;

struct Move
{
    ip p;
    int d;
};

char m[N][N];
bool v[N][N];

int h, w, k;

void clear_visited()
{
    for (int y = 1; y <= h; y++)
    for (int x = 1; x <= w; x++)
    {
        v[x][y] = false;
    }
}

bool valid(ip p)
{
    return v[p.X][p.Y] == false && m[p.X][p.Y] != '#';
}

int bfs(ip & start, char target)
{
    queue<Move> q;

    q.push({start, 0});

    while (q.size() > 0)
    {
        Move move = q.front(); q.pop();

        if (!valid(move.p)) continue;

        int x = move.p.X;
        int y = move.p.Y;
        int d = move.d;

        v[x][y] = true;

        if (m[x][y] == target)
        {
            start.X = x;
            start.Y = y;
            return d;
        }

        q.push({{x+1, y}, d+1});
        q.push({{x-1, y}, d+1});
        q.push({{x, y+1}, d+1});
        q.push({{x, y-1}, d+1});
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);

    for (int y = 0; y < N; y++)
    for (int x = 0; x < N; x++)
    {
        m[x][y] = '#';
    }

    cin >> h >> w >> k;

    ip start, end;

    for (int y = 1; y <= h; y++)
    for (int x = 1; x <= w; x++)
    {
        char c; cin >> c;

        if (c != '#') m[x][y] = c;
        if (c == 'S') start = {x, y};
        if (c == 'E') end =  {x, y};
    }

    // cout << "Start: " << start.X << " " << start.Y << endl;
    // cout << "End: " << end.X << " " << end.Y << endl;

    // for (int y = 0; y <= h+1; y++)
    // {
    //     for (int x = 0; x <= w+1; x++)
    //     {
    //         cout << m[x][y] << " ";
    //     }
    //     cout << endl;
    // }

    int distance = 0;

    if (k == 0)
    {
        cout << bfs(start, 'E') << endl;;
    }
    else
    {
        int distance = 0;
        for (int i = 1; i <= k; i++)
        {   int result = bfs(start, i+48);
            if (result == -1)
            {
                cout << -1 << endl;
                exit(0);
            }
            distance += result;
            clear_visited();
        }
        int result = bfs(start, 'E');
        if (result == -1)
        {
            cout << -1 << endl;
            exit(0);
        }
        distance += result;
        cout << distance << endl;
    }
    
    // for (int i = 1; i <= k; i++)
    // {
    //     distance += bfs(start, i+48);
    //     clear_visited();
    // }
    // distance += bfs(start, 'E');

    // cout << distance << endl;
}

Test 1

Group: 3

Verdict: WRONG ANSWER

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 2, 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: WRONG ANSWER

Test 16

Group: 3

Verdict: WRONG ANSWER

Test 17

Group: 2, 3

Verdict: ACCEPTED