Submission #1800791

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) FOR(i,0,n)
#define FOR(i,a,b) for(ll i=a;i<b;i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define US unordered_set
#define ALL(a) (a).begin(),(a).end()
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef vector<vvi> vvvi;
const ll INF = (1ll << 60);
typedef pair<ll,ll> pii;

int main() {
  ll R,C,D; cin>>R>>C>>D;
  vvi A(R,vi(C));
  REP(i,R) REP(j,C) cin>>A[i][j];
  ll ans=0;
  REP(i,R) REP(j,C) {
    if(abs(i+j)<=D&&(i+j)%2==D%2) ans=max(ans,A[i][j]);
  }
  cout<<ans<<endl;
}

Submission Info

Judge Result