Code/earth_crack.cpp at master · nutmos/Code · GitHub

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
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <climits>

using namespace std;

int minOf (int a, int b) {
	return (a < b)?b:a;
}

int main() {
	int n,m;
	scanf("%d %d",&n,&m);
	int array[2][m];
	int cur = 0;
	int next = 1;
	scanf("%d",&array[cur][0]);
	array[next][0] = array[cur][0];
	array[next][1] = array[cur][0];
	for (int i = 1; i < m-1; ++i) {
		scanf("%d",&array[cur][i]);
		array[next][i-1] = min(array[next][i-1], array[cur][i]);
		array[next][i] = min(array[next][i], array[cur][i]);
		array[next][i+1] = array[cur][i];
	}
	scanf("%d",&array[cur][m-1]);
	array[next][m-2] = min(array[next][m-2], array[cur][m-1]);
	array[next][m-1] = min(array[next][m-1], array[cur][m-1]);
	int tmp;
	cur = next;
	next = 1-next;
	for (int i = 1; i < n-1; ++i) {
		scanf("%d",&tmp);
        array[cur][0] += tmp;
		array[next][0] = array[cur][0];
		array[next][1] = array[cur][0];
		for (int j = 1; j < m-1; ++j) {
			scanf("%d",&tmp);
            array[cur][j] += tmp;
			array[next][j-1] = min(array[next][j-1], array[cur][j]);
			array[next][j] = min(array[next][j], array[cur][j]);
			array[next][j+1] = array[cur][j];
		}
		scanf("%d",&tmp);
        array[cur][m-1] += tmp;
        array[next][m-2] = min(array[next][m-2], array[cur][m-1]);
        array[next][m-1] = min(array[next][m-1], array[cur][m-1]);
        cur = next;
        next = 1-next;
	}
    scanf("%d",&tmp);
    array[cur][0] += tmp;
    array[next][0] = array[cur][0];
    array[next][1] = array[cur][0];
    for (int j = 1; j < m-1; ++j) {
        scanf("%d",&tmp);
        array[cur][j] += tmp;
        array[next][j-1] = min(array[next][j-1], array[cur][j]);
        array[next][j] = min(array[next][j], array[cur][j]);
        array[next][j+1] = array[cur][j];
    }
    scanf("%d",&tmp);
    array[cur][m-1] += tmp;
    array[next][m-2] = min(array[next][m-2], array[cur][m-1]);
    array[next][m-1] = min(array[next][m-1], array[cur][m-1]);
    int min = INT_MAX;
    for (int i = 0; i < m; ++i) {
        if (array[next][i] < min) {
            min = array[cur][i];
        }
    }
    printf("%d",min);
}