Suunnistus

input/code.cpp: In function 'int main()':
input/code.cpp:71:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   71 |         auto [dis, no] = pq.front(); pq.pop();
      |              ^
input/code.cpp:72:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   72 |         auto [x, y] = no;
      |              ^
input/code.cpp:41:23: warning: unused variable 'c' [-Wunused-variable]
   41 |     ll n, m, i, j, k, c = 1, ans = 0;
      |                       ^

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector <ll> vl;
typedef vector <vl> vvl;
typedef pair <ll, ll> pl;
typedef vector <pl> vpl;
typedef stack <ll> stl;
typedef set <ll> sl;
typedef vector <char> vc;
typedef vector <vc> vvc;
typedef vector <bool> vb;

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

pl d[4] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};


ll cvt(ll x, ll y, ll m)
{
    return x * m + y;
}

pl rct(ll k, ll m)
{
    return {k / m, k % m};
}

bool valid(ll x, ll y, ll n, ll m, const vvc &g)
{
    return (x < n && x >= 0 && y < m && y >= 0 && g[x][y] != '#');
}

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

    ll n, m, i, j, k, c = 1, ans = 0;
    bool flag = false;
    pl b;
    string s;
    cin >> n >> m >> k;
    k++;
    vvc g(n, vc(m));
    vector <vb> vis(n, vb(m, false));
    for(i = 0; i < n; i++)
    {
        cin >> s;
        for(j = 0; j < m; j++)
        {
            g[i][j] = s[j];
            if(s[j] == 'S')
            {
                b.fi = i; b.se = j;
                vis[i][j] = true;
            }
            if(s[j] == 'E')
                g[i][j] = char(k + '0');
        }
    }


    char target = '1';

    queue <pair <ll, pl>> pq; pq.push({0, b});
    while(!pq.empty())
    {
        auto [dis, no] = pq.front(); pq.pop();
        auto [x, y] = no;
        //cerr << x << " " << y << "\n";
        for(i = 0; i < 4; i++)
        {
            ll xx = x + d[i].fi, yy = y + d[i].se;
            if(valid(xx, yy, n, m, g) && !vis[xx][yy])
            {
                vis[xx][yy] = true;
                if(g[xx][yy] == target)
                {
                    ans += dis + 1;
                    while(!pq.empty())
                        pq.pop();
                    pq.push({0, {xx, yy}});
                    for(ll z = 0; z < n; z++)
                    {
                        fill(vis[z].begin(), vis[z].end(), false);
                        vis[xx][yy] = true;
                    }
                    target++;
                    if(target - '0' > k)
                        flag = true;
                    break;
                }
                else
                    pq.push({dis + 1, {xx, yy}});
            }
        }
        if(flag)
            break;
    }
    if(flag)
        cout << ans;
    else
        cout << -1;

    return 0;
}

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