Mission

input/code.cpp: In function 'int main()':
input/code.cpp:96:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      for(int i = 1; i < ccc.size(); i++){
                       ^

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;


int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	int n, m, k;
	cin >> n >> m >> k;
	string t[101];
	vector<pii> coins;
	pii sta, end;
	unordered_map<int, unordered_map<int, int> > id; 
	vector<int> ccc;
	for(int i = 0; i < n; i++){
		cin >> t[i];
		for(int j = 0; j < m; j++){
			if(t[i][j] == '*'){
				coins.push_back({i, j});
				id[i][j] = coins.size();
				ccc.push_back(id[i][j]);
			}
			if(t[i][j] == 'A'){
				sta = {i, j};

			}
			if(t[i][j] == 'B'){
				end = {i, j};
			}
		}
	}
	int ids, ide;
	coins.push_back(sta);
	id[sta.first][sta.second] = coins.size();
	ids = coins.size();
	coins.push_back(end);
	id[end.first][end.second] = coins.size();
	ide = coins.size();
	i64 dist[101][101] = {0};
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(t[i][j] == '#' || t[i][j] == '.')
				continue;
			bool d[101][101] = {0};
			queue<pair<pii, i64> > q;
			q.push({{i, j}, 0});
			while(!q.empty()){
				int ci = q.front().first.first;
				int cj = q.front().first.second;
				i64 di = q.front().second;
				q.pop();
				if(ci >= n || ci < 0 || cj < 0 || cj >= m)
					continue;
				if(d[ci][cj])
					continue;
				if(t[ci][cj] == '#')
					continue;
				
				d[ci][cj] = true;
				dist[id[i][j]][id[ci][cj]] = di;
				q.push({{ci+1, cj}, di+1});
				q.push({{ci-1, cj}, di+1});
				q.push({{ci, cj+1}, di+1});
				q.push({{ci, cj-1}, di+1});

			}
			
		}
	}
	coins.pop_back();
	coins.pop_back();
	if(k == 0){
		cout << dist[ids][ide] << endl;
		return 0;
	}
	if(k == 1){
		cout << dist[ids][1] + dist[1][ide] << endl;
		return 0;
	}
	i64 re = 999999999999LL;
	do {
    	i64 cu = 0;
    	cu+=dist[ids][ccc[0]];
    	//cout << "jarjestys: " << endl;
    	//cout << ids << "->" << ccc[0] << " : " << dist[ids][ccc[0]] << endl;
    	for(int i = 1; i < ccc.size(); i++){
    		cu+=dist[ccc[i-1]][ccc[i]];
    		//cout << ccc[i-1] << "->" << ccc[i] << " : " << dist[ccc[i-1]][ccc[i-1]] << endl;
    	}
    	//cout << ccc[ccc.size()-1] << "->" << ide << " : " << dist[ccc[ccc.size()-1]][ide] << endl;
    	cu+=dist[ccc[ccc.size()-1]][ide];
    	re = min(re, cu);
  	} while ( std::next_permutation(ccc.begin(), ccc.end()) );
  	cout << re << endl;
	return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: ACCEPTED

Test 22

Verdict: ACCEPTED

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED