Ruudukko

#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>

using namespace std;

int n=0;
char map[500][500];


string solve(int, int);
bool next(int, int);

bool next(int x, int y) { /* smaller is better */
	if (x==n-1) return false;
	if (y==n-1) return true;
	if (map[x+1][y] < map[x][y+1]) {
		return true;
	}
	if (map[x+1][y] > map[x][y+1]) {
		return false;
	}
	return (solve(x+1, y) < solve(x, y+1));
}

string solve(int x, int y) {
	string r="";
	r+=map[x][y];
	while (!(x==n-1 && y==n-1)) {
		if (next(x, y)) {
			++x;
		}
		else {
			++y;
		}
		r+=map[x][y];
	}
	return r;
}


int main() {
	string temps;
	cin >> n;
        for (int i=0; i < n; i++) {
                cin >> temps;
                for (int q=0; q < n; ++q) {
                        map[i][q] = temps.at(q);
                }
        }

	cout << solve(0, 0) << 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: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

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