Mission

input/code.cpp: In function 'int dist(int, int, int, int)':
input/code.cpp:68:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < z.size(); i++) {
                    ^
input/code.cpp: In function 'int main()':
input/code.cpp:105:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < v.size(); i++) {
                    ^
input/code.cpp:120:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < v.size(); j++) {
                     ^

#include <algorithm>
#include <iostream>
#include <iterator>
#include <numeric>
#include <sstream>
#include <fstream>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cstdio>
#include <vector>
#include <bitset>
#include <cmath>
#include <queue>
#include <deque>
#include <stack>
#include <list>
#include <map>
#include <set>

using namespace std;

#define ll long long
#define ld long double
#define ii pair<int,int>
#define si pair<string,int>
#define iii pair<int,ii>
#define vi vector<int>
#define vc vector<char>
#define vs vector<string>
#define msvs map<string,vs>
#define msi map<string,int>
#define mss map<string,int>
#define us unordered_set
#define um unordered_map
#define pq priority_queue
#define pb push_back
#define mp make_pair
#define forall(i,a,b) for (int i=a;i<b;i++)
#define foreach(v,c) for( typeof( (c).begin()) v = (c).begin();  v != (c).end(); ++v)
#define all(a) a.begin(), a.end()
#define in(a,b) ( (b).find(a) != (b).end())
#define fill(a,v) memset(a, v, sizeof a)
#define sz(a) ((int)(a.size()))
#define N (1<<17)
#define M 1000000007
#define I 500000004

int n,m,k;
char l[100][100];
char r[100][100];
pair<int,int> a;
pair<int,int> b;
vector<pair<int,int>> v;

int dist(int y1, int x1, int y2, int x2) {
	vector<pair<int,int>> z;
	int e[n][m];
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			e[i][j] = 0;
		}
	}
	z.push_back(make_pair(y1,x1));
	r[y1][x1] = '#';
	for (int i = 0; i < z.size(); i++) {
		int y = z[i].first;
		int x = z[i].second;
		static int dy[] = {1,0,-1,0};
		static int dx[] = {0,1,0,-1};
		for (int j = 0; j < 4; j++) {
			int uy = y+dy[j];
			int ux = x+dx[j];
			if (uy < 0 || ux < 0 || uy >= n || ux >= m || r[uy][ux] == '#') continue;
			z.push_back(make_pair(uy,ux));
			r[uy][ux] = '#';
			e[uy][ux] = e[y][x]+1;
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			r[i][j] = l[i][j];
		}
	}
	return e[y2][x2];
}

int main()
{
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> l[i][j];
			r[i][j] = l[i][j];
			if (l[i][j] == 'A') a = make_pair(i,j);
			else if (l[i][j] == 'B') b = make_pair(i,j);
			else if (l[i][j] == '*') v.push_back(make_pair(i,j));
		}
	}
	int path = 0;
	int min = 999999;
	int idx = 0;
	for (int i = 0; i < v.size(); i++) {
		int d = dist(a.first,a.second,v[i].first,v[i].second);
		if (d < min) {
			min = d;
			idx = i;
		}
	}
	path += min;
	int dx = v[idx].first;
	int dy = v[idx].second;
	l[dx][dy] = '.'; r[dx][dy] = '.';
	v.erase(v.begin() + idx);
	while (v.size() > 1) {
		min = 999999;
		idx = 0;
		for (int j = 0; j < v.size(); j++) {
			if (v[j].first != dx && v[j].second != dy) {
				int d = dist(dx,dy,v[j].first,v[j].second);
				if (d < min) {
					min = d;
					idx = j;
				}
			}
		}
		path += min;
		dx = v[idx].first;
		dy = v[idx].second;
		l[dx][dy] = '.'; r[dx][dy] = '.';
		v.erase(v.begin() + idx);
	}
	path += dist(dx,dy,v[0].first,v[0].second);
	path += dist(v[0].first,v[0].second,b.first,b.second);
	cout << path << "\n";
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: ACCEPTED

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: WRONG ANSWER

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: RUNTIME ERROR

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER

Test 16

Verdict: WRONG ANSWER

Test 17

Verdict: RUNTIME ERROR

Test 18

Verdict: WRONG ANSWER

Test 19

Verdict: ACCEPTED

Test 20

Verdict: WRONG ANSWER

Test 21

Verdict: ACCEPTED

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: WRONG ANSWER

Test 24

Verdict: WRONG ANSWER

Test 25

Verdict: WRONG ANSWER