forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnpuzzle.cpp
73 lines (69 loc) · 1.65 KB
/
npuzzle.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
#include <iostream>
#include <vector>
#include <cmath>
using namespace std;
int manhattan(int x1, int y1, int x2, int y2) {
return abs(x1-x2) + abs(y1-y2);
}
int getDistance(char c, int i, int j) {
switch(c) {
case 'A':
return manhattan(0, 0, i, j);
break;
case 'B':
return manhattan(1, 0, i, j);
break;
case 'C':
return manhattan(2, 0, i, j);
break;
case 'D':
return manhattan(3, 0, i, j);
break;
case 'E':
return manhattan(0, 1, i, j);
break;
case 'F':
return manhattan(1, 1, i, j);
break;
case 'G':
return manhattan(2, 1, i, j);
break;
case 'H':
return manhattan(3, 1, i, j);
break;
case 'I':
return manhattan(0, 2, i, j);
break;
case 'J':
return manhattan(1, 2, i, j);
break;
case 'K':
return manhattan(2, 2, i, j);
break;
case 'L':
return manhattan(3, 2, i, j);
break;
case 'M':
return manhattan(0, 3, i, j);
break;
case 'N':
return manhattan(1, 3, i, j);
break;
case 'O':
return manhattan(2, 3, i, j);
break;
}
}
int main() {
int sum = 0;
for(int i = 0; i < 4; i++) {
for(int j = 0; j < 4; j++) {
char c;
cin >> c;
if(c != '.') {
sum += getDistance(c, j, i);
}
}
}
cout << sum << endl;
}