-
Notifications
You must be signed in to change notification settings - Fork 0
/
1066.cpp
131 lines (96 loc) · 2.4 KB
/
1066.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define PI (acos(-1))
#define ct cout<<
#define cn cin>>
#define spc <<" "<<
#define nl puts("")
#define _fl(x) puts("FLAG " #x),fflush(stdout);
#define _(x) cout<< #x <<" is "<< x <<endl;
#define fs first
#define sc second
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define _109 (1000000000)
#define _0(arr) memset(arr,0,sizeof ( arr ) )
#define _1(arr) memset(arr,-1,sizeof ( arr ) )
#define _ninp(n,arr) for(int i=0; i<n;i++)cin>>arr[i];
#define _nout(n,arr) for(int i=0; i<n;i++)cout<<arr[i]<<" \n"[i==n-1];
double _eps=1e-6;
char grid[15][15];
bool vis[15][15];
int n,m;
using pi=pair<int,int>;
bool go(pi fr,int xp,int yp,pi &to){
fr.fs+=xp;
fr.sc+=yp;
if(fr.fs>0 && fr.fs<=n && fr.sc>0 && fr.sc<=m && grid[fr.fs][fr.sc]=='.' && !vis[fr.fs][fr.sc]){
to=fr;
return true;
}
return false;
}
int dst(pi a, pi b){
int dist[15][15];
for (int i = 0; i <15; ++i)
{
for (int j= 0; j< 15; ++j)
{
dist[i][j]=100000000;
}
}
_0(vis);
queue<pi>q;
q.push(a);
dist[a.fs][a.sc]=0;
while(!q.empty()){
pi u=q.front();
q.pop();
vis[u.fs][u.sc]=true;
pi to;
auto update=[&](){
q.push(to);
dist[to.fs][to.sc]=min(dist[to.fs][to.sc],1+dist[u.fs][u.sc]);
};
if(go(u,0,1,to))update();
if(go(u,0,-1,to))update();
if(go(u,1,0,to))update();
if(go(u,-1,0,to))update();
}
return (dist[b.fs][b.sc]==100000000?-1:dist[b.fs][b.sc]);
}
int main() {
int T;
cn T;
for(int caseno=1; caseno<=T ;caseno++){
cn n;
m=n;
pi arr[30];
int cnt=0;
for (int i = 1; i <=n; ++i)
for(int j=1; j<=n ; j++){
cn grid[i][j];
char c=grid[i][j];
if(c>='A' && c<='Z'){
arr[c-'A']={i,j};
cnt++;
}
}
int res=0;
pi from=arr[0];
grid[from.fs][from.sc]='.';
for (int i = 1; i <cnt; ++i)
{
grid[arr[i].fs][arr[i].sc]='.';
int tmp=dst(from,arr[i]);
if(tmp==-1){res=-1;break;}
res+=tmp;
from=arr[i];
}
if(res==-1)printf("Case %d: Impossible\n",caseno);
else printf("Case %d: %d\n",caseno,res);
}
return 0;
}