Ruudukko

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

#define ll long long

const char * sortstr(const char * v, int l) {
	int * j = new int[l];
	for (int i = 0; i < l; i++) {
		j[i] = int(v[i]);
	}
	sort(j,j+l);
	char * c = new char[l];
	for (int i = 0; i < l; i++) {
		c[i] = char(j[i]);
	}
	return c;
}
const char * pathfind(string * s, int x, int y, ll f) {
	string v = "";
	while (!((x==f) && (y==f))) {
		v = v + s[x][y];
		if (x == f)
			y++;
		else if (y == f)
			x++;
		else {
			int a = (int) s[x][y+1];
			int b = (int) s[x+1][y];
			if (a < b) {
				y++;
			} else if (a > b) {
				x++;
			} else {
				if (strcmp(pathfind(s,x+1,y,f), pathfind(s,x,y+1,f)) < 0) x++;
				else y++;
			}
		}
	}	
	return sortstr(v.c_str(),v.length());
}	

int main(int argc, char ** argv) {
	cin.sync_with_stdio(false);

	ll n;
	cin >> n;
	ll f = n - 1;
	int x = 0;
	int y = 0;
	string * s = new string[n];
	for (int i = 0; i < n; i++)
		cin >> s[i];
	
	string tulos = "";
	while (!((x==f) && (y==f))) {
		tulos = tulos + s[x][y];
		if (x == f)
			y++;
		else if (y == f)
			x++;
		else {
			int a = (int) s[x][y+1];
			int b = (int) s[x+1][y];
			
			if (a < b) {
				y++;
			} else if (a > b) {
				x++;
			} else {
				if (strcmp(pathfind(s,x+1,y,f), pathfind(s,x,y+1,f)) < 0) x++;
				else y++;
			}
		}
	}	
	tulos = tulos + s[x][y];
	
	cout << tulos << "\n";
	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: WRONG ANSWER

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