-
Notifications
You must be signed in to change notification settings - Fork 4
/
rf.cpp
64 lines (55 loc) · 1.11 KB
/
rf.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
#include <fstream>
using namespace std;
struct Road {
unsigned distance;
unsigned steps;
};
Road operator+(const Road& a, const Road& b) {
return {a.distance+b.distance,a.steps+b.steps};
}
bool operator<(const Road& a, const Road& b) {
if(a.distance == b.distance) {
return a.steps > b.steps;
}
return a.distance < b.distance;
}
Road roads[256][256];
int main() {
ifstream in("rf.in");
unsigned n;
in >> n;
for(unsigned i = 0; i < n; ++i) {
for(unsigned j = 0; j < n; ++j) {
unsigned dist;
in >> dist;
if(i==j) {
roads[i][j] = {dist,0};
}
else {
roads[i][j] = {dist,1};
}
}
}
for(unsigned k = 0; k < n; ++k) {
for(unsigned i = 0; i < n; ++i) {
for(unsigned j = 0; j < n; ++j) {
if(roads[i][k] + roads[k][j] < roads[i][j]) {
roads[i][j] = roads[i][k] + roads[k][j];
}
}
}
}
ofstream out("rf.out");
for(unsigned i = 0; i < n; ++i) {
for(unsigned j = 0; j < n; ++j) {
out << roads[i][j].distance << ' ';
}
out << '\n';
}
for(unsigned i = 0; i < n; ++i) {
for(unsigned j = 0; j < n; ++j) {
out << roads[i][j].steps << ' ';
}
out << '\n';
}
}