Ruudukko

input/code.cpp: In function 'std::vector<std::tuple<int, int, char> > mahdolliset(std::vector<std::basic_string<char> >, int, int)':
input/code.cpp:24:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (y < r.size() - 1)
        ^
input/code.cpp:32:8: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (x < r[y].size() - 1)
        ^
input/code.cpp: In function 'void reitti(std::vector<std::basic_string<char> >, std::string&, int, int)':
input/code.cpp:46:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (currentY == r.size() - 1 && currentX == r.size() - 1)
               ^
input/code.cpp:46:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (currentY == r.size() - 1 && currentX == r.size() - 1)
                                           ^
input/code.cpp:55:21: warning: comparison between signed and unsigned integer...

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

using namespace std;

int score(char current, char next)
{
	string s = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";

	if (current == next) return 0;

	return abs((int)current - (int)next);
}

// y   x   char
vector<tuple<int, int, char>> mahdolliset(vector<string> r, int y, int x)
{
	vector<tuple<int, int, char>> v;

	if (y < r.size() - 1)
		// y+1
		v.push_back(make_tuple(y+1, x, r[y+1][x]));

	/*if (y > 1)
		// y-1
		v.push_back(make_tuple(y-1, x, r[y-1][x]));*/

	if (x < r[y].size() - 1)
		// x+1
		v.push_back(make_tuple(y, x+1, r[y][x+1]));

	/*if (x > 1)
		v.push_back(make_tuple(y, x-1, r[y][x-1]));*/

	return v;
}

void reitti(vector<string> r, string& currentPath, int currentY, int currentX)
{
	currentPath += r[currentY][currentX];

	if (currentY == r.size() - 1 && currentX == r.size() - 1)
		return;

	vector<tuple<int, int, char>> v = mahdolliset(r, currentY, currentX);

	if (v.size() > 0)
	{
		int pieninScore = score(r[currentY][currentX], get<2>(v[0]));
		tuple<int, int, char> pienin = v[0];
		for (int i = 0; i < v.size(); i++)
		{
			int y = get<0>(v[i]);
			int x = get<1>(v[i]);
			char c = get<2>(v[i]);

			int sco = score(r[currentY][currentX], c);

			if (sco < pieninScore) {
				pieninScore = sco;
				pienin = v[i];
			}

			//cout << c << ": " << sco << endl;
		}

		int y = get<0>(pienin);
		int x = get<1>(pienin);

		reitti(r, currentPath, y, x);
	}
}

int main()
{
	int n;
	cin >> n;

	vector<string> ruudukko;

	for (int i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		ruudukko.push_back(s);
	}

	vector<tuple<int, int, char>> m = mahdolliset(ruudukko, 1, 1);

	

	string path = ""; //to_string(ruudukko[0][0]);

	reitti(ruudukko, path, 0, 0);

	cout << path << endl;

	system("pause");
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 2

Group: 1

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 3

Group: 1

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 4

Group: 1

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 5

Group: 1

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 6

Group: 2

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 7

Group: 2

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 8

Group: 2

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 9

Group: 2

Verdict: WRONG ANSWER

sh: 1: pause: not found

Test 10

Group: 2

Verdict: WRONG ANSWER

sh: 1: pause: not found

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