Suunnistus

input/code.cpp: In function 'void bfs(std::vector<std::pair<int, std::pair<int, int> > >&, std::vector<std::pair<int, std::pair<int, int> > >&, char)':
input/code.cpp:52:20: warning: array subscript has type 'char' [-Wchar-subscripts]
   52 |       if (++c >= p[target]) break;
      |                    ^~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:86:30: warning: array subscript has type 'char' [-Wchar-subscripts]
   86 |     if (c >= 48 && c < 58) p[c]++;
      |                              ^

#include <bits/stdc++.h>

#define N 502

#define F first
#define S second

#define pb push_back

using namespace std;

typedef pair<int, int> ip;

typedef pair<int, ip> Node;

int p[64];
char m[N][N];
char v[N][N];

void reset()
{
  for (int y = 0; y < N; y++)
  for (int x = 0; x < N; x++)
  {
    v[x][y] = false;
  }
}

void bfs(vector<Node> & start, vector<Node> & end, char target)
{
  priority_queue<Node, vector<Node>, greater<Node>> q;

  for (Node n : start) q.push(n);

  int c = 0;

  while (q.size())
  {
    Node n = q.top(); q.pop();

    int d = n.F;
    int x = n.S.F;
    int y = n.S.S;

    if (v[x][y] || m[x][y] == '#') continue;

    v[x][y] = true;

    if (m[x][y] == target)
    {
      end.pb(n);
      if (++c >= p[target]) break;
    }

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

int main()
{
  int w, h, k; cin >> h >> w >> k;

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

  ip s, e;

  // cout << "Width: " << w << endl;
  // cout << "Height: " << h << endl;

  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') s = {x, y};
    if (c == 'E') e = {x, y};
    if (c >= 48 && c < 58) p[c]++;
  }

  // cout << "Start: " << s.F << " " << s.S << endl;
  // cout << "End: " << e.F << " " << e.S << endl;

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

  vector<Node> start, end;

  start.pb({0, s});

  for (char c = '1'; c < '1' + k; c++)
  {
    bfs(start, end, c);
    reset();

    if (end.size() == 0)
    {
      cout << -1 << endl;
      exit(0);
    }

    start.clear();
    for (Node n : end) start.pb(n);
    end.clear();
  }

  bfs(start, end, 'E');

  if (end.size() == 0)
  {
    cout << -1 << endl;
    exit(0);
  }

  cout << end[0].F << endl;
}

Test 1

Group: 3

Verdict: ACCEPTED

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: TIME LIMIT EXCEEDED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 2, 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED

Test 17

Group: 2, 3

Verdict: ACCEPTED