Ruudukko

#include <bits/stdc++.h>
 
#define ll long long
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vpii vector<pii>
 
using namespace std;
 
char c[101][101];
int ns[101][101];
pair<int,int> ls[101][101];
 
int main() {
	cin.tie(0);
	
	int n; cin >> n;
	for(int y=0;y<n;y++) {
		for(int x=0;x<n;x++) {
			char a; cin >> a;
			c[x][y] = a;
			ns[x][y] = 999999;
		}
	}
	
	for(int y=0;y<n;y++) {
		for(int x=0;x<n;x++) {
		int n1=0,n2=0;
		if(y>0) { n1 = ns[x][y-1]; }
		if(x>0) { n2 = ns[x-1][y]; }
		int p = min(n1,n2)+(c[x][y]-'A'+1);
		if(p<ns[x][y]) {
			ns[x][y] = p;
			pair<int,int> from = mp(-1,-1);
			if(y==0&&x==0) from = mp(0,0);
			else if(y==0&&x>0) from=mp(x-1,y);
			else if(x==0&&y>0) from = mp(x,y-1);
			else if(n1<n2) from=mp(x,y-1);
			else from=mp(x-1,y); 
			ls[x][y] = from;
		}
		}
	}
	
	string fstring="";
	int x=n-1,y=n-1;
	int a=0;
	while(true) {;
		fstring += c[x][y];
		int tx = ls[x][y].first;
		int ty = ls[x][y].second;
		x=tx;y=ty;
		if(x==0&&y==0) a++;
		if(x==0&&y==0&&a>1) break;
	} 
	reverse(fstring.begin(), fstring.end());
	cout << fstring << endl;
	
	return 0;
}
 

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

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

Test 7

Group: 2

Verdict: WRONG ANSWER

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