Submission #172040

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cfloat>
#include <climits>
#include <cstdio>
#include <complex>
#include <cstdlib>
#include <functional>
#include <map>
#include <memory>
#include <iomanip>
#include <queue>
#include <deque>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <cstring>
#include <utility>
#include <vector>
#include <bitset>
#include <list>
#include <numeric>

#define INF 2147483647
#define INF_LL 9223372036854775807
#define MOD 1000000007

#define zeroFill(arr) memset(arr,0,sizeof(arr))
#define minusOneFill(arr) memset(arr,-1,sizeof(arr))
#define sizev(vec)  (int)vec.size()
#define sizea(array)  (sizeof(array)/sizeof((array)[0]))
#define sizes(string)  (int)string.length()
#define all(vec) (vec).begin(), (vec).end()

#define debug(var) cout<<#var" = "<<var<<", "
#define debugln(var) cout<<#var" = "<<var<<endl

using namespace std;

typedef vector<int> VI;
typedef vector<double> VD;
typedef vector<string> VS;
typedef long long LL;
typedef unsigned long long ULL;

int main() {
	int r, c, d;
	cin >> r >> c >> d;

	bool dp[2][1000][1000];
	zeroFill(dp);

	int now = 0, nx = 1;
	dp[now][0][0] = true;

	for (int i = 0; i < d; i++) {
		for (int j = 0; j < r; j++) {
			for (int k = 0; k < c; k++) {
				if (dp[now][j][k]) {
					if (j-1 >= 0)
						dp[nx][j-1][k] = true;
					if (k-1 >= 0)
						dp[nx][j][k-1] = true;
					if (j+1 < r)
						dp[nx][j+1][k] = true;
					if (k+1 < c)
						dp[nx][j][k+1] = true;
				}
			}
		}
		zeroFill(dp[now]);
		swap(now, nx);
	}

	int ans = 0;
	int t;
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cin >> t;
			if (dp[now][i][j]) {
				ans = max(ans, t);
			}
		}
	}

	std::cout << ans << std::endl;

	return 0;
}

Submission Info

Judge Result