Ruudukko

input/code.cpp: In function 'void haku(int, int, std::string)':
input/code.cpp:12:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if(s.length() > minlen) return;
                ^
input/code.cpp:26:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(s.length() < minlen)
                 ^
input/code.cpp: In function 'int main()':
input/code.cpp:63:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i2 = 0; i2 < s.length(); i2++)
                      ^
input/code.cpp:50:15: warning: iteration 101010u invokes undefined behavior [-Waggressive-loop-optimizations]
   bip[i] = 'a';
               ^
input/code.cpp:48:19: note: containing loop
  for(int i = 0; i <= 101010; i++)
                   ^

#include<bits/stdc++.h>
using namespace std;
char t[2502][2502];
int n;
char bip[101010];
vector<string> poss;
long minlen = 1e9;
void haku(int x, int y, string s)
{
	char ch = t[x][y];
	s.push_back(ch);
	if(s.length() > minlen) return;
//	cout << s << "\n";
	if(bip[s.length()-1] < s[s.length()-2])
	{
		return;
	}
	else
	{
		bip[s.length()] = ch;
	}
//	cout << s << "\n";
	if(x == n && y == n)
	{
		poss.push_back(s);
		if(s.length() < minlen)
		{
			minlen = s.length();
		}
		return;
	}
	if(t[x+1][y] < t[x][y+1])
	{
		haku(x+1,y,s);
	}
	if(t[x][y+1] < t[x+1][y])
	{
		haku(x,y+1,s);
	}
	if(t[x][y+1] == t[x+1][y])
	{
		haku(x,y+1,s);
		haku(x+1,y,s);
	}
}
int main()
{
	for(int i = 0; i <= 101010; i++)
	{
		bip[i] = 'a';
	}
	for(int i = 0; i <= 2501; i++)
	{
		for(int i2 = 0; i2 <= 2501; i2++)
		{
			t[i][i2] = 'a';
		}
	}
	cin >> n;
	for(int i = 1; i <= n; i++)
	{
		string s; cin >> s;
		for(int i2 = 0; i2 < s.length(); i2++)
		{
			t[i][i2+1] = s[i2];
		}
	}
	haku(1, 1, "");
	sort(poss.begin(), poss.end());
	cout << poss[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: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

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