Abandoned warehouse

input/code.cpp: In function 'bool dl(Mapa&, int, int)':
input/code.cpp:13:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<char> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         return not (x < 0 or x >= m.size() or y < 0 or y >= m[0].size() );
      |                              ~~^~~~~~~~~~~
input/code.cpp:13:58: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |         return not (x < 0 or x >= m.size() or y < 0 or y >= m[0].size() );
      |                                                        ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int found(Mapa&, int, int)':
input/code.cpp:17:13: warning: unused variable 'rows' [-Wunused-variable]
   17 |         int rows        = m.size();
      |             ^~~~
input/code.cpp:18:13: warning: unused variable 'columns' [-Wunused-variable]
   18 |...

#include <iostream>
#include <vector>
#include <queue>
#include <string>
using namespace std;
typedef vector< vector<char> > Mapa;
typedef pair<int,int> par;
typedef pair<par,int> Coord;

#define inf 0x7fffffff

bool dl(Mapa& m,int x, int y){
	return not (x < 0 or x >= m.size() or y < 0 or y >= m[0].size() );
}

int found(Mapa& m,int x,int y){
	int rows 	= m.size();
	int columns	= m[0].size();	
	queue<Coord> Q;
    queue<string> Camins;
    Camins.push("");
	Q.push( Coord(par(x,y),0) );
    pair<int, string> ret;
    ret.first = inf;
    ret.second = "";
	while( not Q.empty() ){
		Coord v = Q.front();
        string cami = Camins.front();
        Camins.pop();
		Q.pop();
		if(v.second > ret.first) break;
		if(m[v.first.first][v.first.second] == 'B') if(v.second<ret.first) {
            ret.first = v.second;
            ret.second = cami;
        }
		m[v.first.first][v.first.second]='#';
		int esq = v.first.first-1;
		int dre = v.first.first+1;
		int ada = v.first.second-1;
		int aba = v.first.second+1;

		if(dl(m,esq,v.first.second) ) if(m[esq][v.first.second]!='#'){
            Q.push( Coord( par(esq,v.first.second), v.second+1 ) );
            Camins.push(cami+"L");
        }
		if(dl(m,dre,v.first.second) ) if(m[dre][v.first.second]!='#'){
            Q.push( Coord( par(dre,v.first.second), v.second+1 ) );
            Camins.push(cami+"R");


        }
		if(dl(m,v.first.first,ada) )  if(m[v.first.first][ada]!='#'){
            Q.push( Coord( par(v.first.first,ada), v.second+1 ) );
            Camins.push(cami+"U");

        }
		if(dl(m,v.first.first,aba) )  if(m[v.first.first][aba]!='#'){
            Q.push( Coord( par(v.first.first,aba), v.second+1 ) );
            Camins.push(cami+"D");
        }

	}
	return ret.first;
}

int main(){

	int n,m;
    int f,c;
	cin >> n >> m;
	Mapa mapt(n, vector<char>(m) );
	for(int i = 0; i < n ; ++i)
		for(int j = 0; j < m; ++j){
			cin >> mapt[i][j];
            if(mapt[i][j] == 'A'){
                f = i;
                c = j;
            }
        }
        
	int dmin = found(mapt,f,c);
	if( dmin != inf )
		cout << "distancia minima: " << dmin << endl;
	else
		cout << "no es pot arribar a cap tresor" << endl;
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: TIME LIMIT EXCEEDED

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: TIME LIMIT EXCEEDED