Suunnistus

#include <bits/stdc++.h> 
#define all(v) (v).begin(), (v).end()
using namespace std;
vector<array<int, 2>> pos[12];
int dist[12][501][501];
char g[501][501];
int n, m, k;

bool ok(int i, int j) {
	return i>=0 && i<n && j>=0 && j<m && g[i][j]!='#';
}
int main() {
	cin >> n >> m >> k;
	for (int i=0; i<n; i++) for (int j=0; j<m; j++) {
	       cin >> g[i][j];	
	       if (g[i][j]=='S') pos[0].push_back({i, j});
	       if (g[i][j]=='E') pos[k+1].push_back({i, j});
	       if ('1'<=g[i][j] && g[i][j]<='9') pos[g[i][j]-'0'].push_back({i, j});
	}
	for (int z=0; z<=k+1; z++) {
		for (int i=0; i<n; i++) for (int j=0; j<m; j++) {
			dist[z][i][j] = 1e9;
		}
	}
	for (int z=k+1; z>=0; z--) {
		queue<array<int, 2>> q;
		for (auto [i, j]: pos[z]) {
			if (z==k+1) dist[z][i][j] = 0;
			else dist[z][i][j] = dist[z+1][i][j];
			q.push({i, j});
		}
		while (!q.empty()) {
			auto t = q.front(); q.pop();
			int i = t[0];
			int j = t[1];
			auto mv = [&](int ni, int nj) {
				if (ok(i, j) && dist[z][ni][nj]>dist[z][i][j]+1) {
					dist[z][ni][nj] = dist[z][i][j]+1;
					q.push({ni, nj});
				}
			};
			mv(i-1, j);
			mv(i+1, j);
			mv(i, j-1);
			mv(i, j+1);
		}
	}
	auto [i, j] = pos[0][0];
	if (dist[0][i][j]>=1e9) cout << "-1\n"; 
	else cout << dist[0][i][j] << '\n';
}

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: ACCEPTED

Test 9

Group: 2, 3

Verdict: ACCEPTED

Test 10

Group: 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

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