Ruudukko

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <iomanip>
#include <cstdlib>
#include <queue>
#include <unordered_map>

#define uint unsigned int
#define INF 999999999
#define ll long long
#define M 1000000007
#define E 0.0000001
#define N 131072

using namespace std;

int main() {
    int n;
    cin>>n;
    string s[n][n];
    for (int y = 0; y < n; y++) {
        for (int x = 0; x < n; x++) {
            char c;
            cin>>c;
            if (y > 0 && x > 0) s[y][x] = min(s[y - 1][x], s[y][x - 1]) + c;
            else if (y > 0) s[y][x] = s[y - 1][x] + c;
            else if (x > 0) s[y][x] = s[y][x - 1] + c;
            else s[y][x] = string() + c;
        }
    }

    cout<<s[n - 1][n - 1]<<endl;

    return 0;
}

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

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED