Ruudukko

input/code.cpp: In function 'bool grt(std::__cxx11::string, std::__cxx11::string)':
input/code.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

#include <bits/stdc++.h>

using namespace std;

char arr[500][500] = {{__INT8_MAX__}};

string w[500][500] = {""};

int n;

bool valid(int i){
    return i >= 0 && i < n;
}

bool sF = false;
string shortest = "";
vector<char> shortestVec;

bool grt(string s1, string s2){
    if(s1.length() > s2.length()) return true;

}

void step(int x, int y, string len, vector<char> jono){
    len += arr[x][y];
    if(!w[x][y].empty() && len.length() >= w[x][y].length() && (len.length() > w[x][y].length() || len >= w[x][y])) return;
    w[x][y] = len;

    jono.emplace_back(arr[x][y]);
    if(x == n-1 && y == n-1){
        shortest = len;
        shortestVec = jono;
        return;
    }

    if(valid(x-1)) step(x-1, y, len, jono);
    if(valid(x+1)) step(x+1, y, len, jono);

    if(valid(y+1)) step(x, y+1, len, jono);
    if(valid(y-1)) step(x, y-1, len, jono);
}

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

    cin >> n;
    char b;
    for (int y = 0; y < n; ++y){
        for (int x = 0; x < n; ++x){
            cin >> b;
            arr[x][y] = b;
        }
    }
    step(0,0, "", {});
    for (const auto &item : shortestVec){
        cout << item;
    }

    flush(std::cout);
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR