Ruudukko

/* ALSO CRASH SOMETIMES */
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
 
using namespace std;
 
char map[500][500];
int n;
 
 
 
 
string findp(int cursor_x, int cursor_y) {
	string path="";
 
	path += map[cursor_x][cursor_y];
 
	while (cursor_x < n-1 && cursor_y < n-1) {
		if (map[cursor_x+1][cursor_y] < map[cursor_x][cursor_y+1]) {
			cursor_x+=1;
		}
		else if (map[cursor_x+1][cursor_y] > map[cursor_x][cursor_y+1]) {
			cursor_y+=1;
		}
		else {
			if (findp(cursor_x+1, cursor_y) < findp(cursor_x, cursor_y+1)) {
				cursor_x+=1;
			}
			else {
				cursor_y+=1;
			}
		}
		path += map[cursor_x][cursor_y];
	}
 
	if (cursor_x == n-1) {
		while (cursor_y < n) {
			++cursor_y;
			path += map[cursor_x][cursor_y];
		}
	}
	if (cursor_y == n-1) {
		while (cursor_x < n) {
			++cursor_x;
			path += map[cursor_x][cursor_y];
		}
	}
	path += map[cursor_x][cursor_y];
 
	return path;
}
 
int main() {
	string temps;
	cin >> n;
	int cursor_x = 0;
	int cursor_y = 0;
 
 
	for (int i=0; i < n; i++) {
		cin >> temps;
		for (int q=0; q < n; ++q) {
			map[i][q] = temps.at(q);
		}
	}
 
	cout << findp(cursor_x, cursor_y) << endl;
 
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

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