-
Notifications
You must be signed in to change notification settings - Fork 0
/
083.cpp
84 lines (71 loc) · 1.92 KB
/
083.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
/****
* Problem 83 - Path sum: four ways
*/
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 80;
int g[N][N];
unsigned int m[N][N];
enum DIRECTION { LEFT = 1, RIGHT = 2, UP = 3, DOWN = 4};
#define MIN2(_a, _b) (_a > _b ? _b : _a)
int main()
{
freopen("081.in", "r", stdin);
for (int i = 0; i < N; i++)
for (int j = 0; j < N; j++)
{
cin >> g[i][j];
cin.ignore();
}
memset(m , -1, sizeof(m));
m[0][0] = g[0][0];
for (int i = 1; i < N; i++)
{
m[i][0] = m[i-1][0] + g[i][0];
m[0][i] = m[0][i-1] + g[0][i];
}
for (bool updated = true; updated; )
{
updated = false;
// UP
for (int j = 0; j < N; j++)
for (int i = 1; i < N; i++)
if (m[i][j] > m[i-1][j] + g[i][j])
{
m[i][j] = m[i-1][j] + g[i][j];
updated = true;
}
// LEFT
for (int j = 1; j < N; j++)
for (int i = 0; i < N; i++)
if (m[i][j] > m[i][j-1] + g[i][j])
{
m[i][j] = m[i][j-1] + g[i][j];
updated = true;
}
// DOWN
for (int j = 0; j < N; j++)
for (int i = N-2; i >= 0; i--)
if (m[i][j] > m[i+1][j] + g[i][j])
{
m[i][j] = m[i+1][j] + g[i][j];
updated = true;
}
// RIGHT
for (int j = N-2; j >= 0; j--)
for (int i = 0; i < N; i++)
if (m[i][j] > m[i][j+1] + g[i][j])
{
m[i][j] = m[i][j+1] + g[i][j];
updated = true;
}
}
cout << "The minimal path sum is " << m[N-1][N-1] << "." << endl;
return 0;
}