Suunnistus

input/code.cpp: In function 'void solve()':
input/code.cpp:51:18: warning: unused variable 'done' [-Wunused-variable]
   51 |             bool done = false;
      |                  ^~~~

#include <bits/stdc++.h>

using namespace std;

//#define int long long
typedef vector<int> vi;
typedef pair<int, int> pi;

#define fi first
#define se second
#define pb push_back

#define MOD 1000000007
#define INF INT32_MAX/2-1

void solve() {
    int N, M, K;
    cin >> N >> M >> K;

    vector<int> adj[251010];
    bool wall[251010];
    set<int> rastit[K+2];

    for (int r=0;r<N;r++) for (int c=0; c<M; c++) {
        char x;
        cin >> x;
        if (x == '#') wall[r*M+c] = true;
        if (x == 'S') rastit[0].insert(r*M+c);
        if (x == 'E') rastit[K+1].insert(r*M+c);
        if (('1' <= x) && (x <= '9')) rastit[x-'1'+1].insert(r*M+c);
        
        if (r > 0) adj[r*M+c].pb(r*M+c-M);
        if (c > 0) adj[r*M+c].pb(r*M+c-1);
        if (r < N-1) adj[r*M+c].pb(r*M+c+M);
        if (c < M-1) adj[r*M+c].pb(r*M+c+1);
    }

    //for (auto rasti : rastit) {for (auto ruutu : rasti) cout << ruutu << " ";cout << "\n";}

    queue<tuple<int, int, int>> edgelist;
    for (int i=0; i<K+1; i++) { 
        for (auto start : rastit[i]) {   
            bool vis[251010];
            copy(wall, wall + 251010, vis);

            int dis[251010] = {};
            queue<int> q;
            q.push(start);
            vis[start]=true;

            bool done = false;
            while (!q.empty()){
                int u = q.front();
                q.pop();
                for (auto child : adj[u]) {
                    if (vis[child]) continue;
                    
                    dis[child] = dis[u] + 1;
                    if (rastit[i+1].count(child)) edgelist.push({start, child, dis[child]});

                    vis[child] = true;
                    q.push(child);
                }
            }
        }
    }

    int dis[251010] = {};
    for (int i=1; i<=K+1; i++) {
        for (auto ruutu : rastit[i]) {
            dis[ruutu] = INF;
        }
    }

    while (!edgelist.empty()) {
        int a, b, w;
        tie(a, b, w) = edgelist.front();
        //printf("a: %d, b: %d, w: %d\n", a, b, w);
        edgelist.pop();
        //printf("disb=%d, disa=%d, w=%d\n\n", dis[b], dis[a], w);
        dis[b] = min(dis[b], dis[a] + w);
    }

    //cout << *(rastit[K+1].begin()) << endl;

    if (dis[*(rastit[K+1].begin())] == INF) cout << "-1\n";
    else cout << dis[*(rastit[K+1].begin())] << "\n";

}

signed main() {
    cin.tie(0) -> ios::sync_with_stdio(0);
    solve();
}

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

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

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