Submission #171681

---

Source Code Expand

#include <queue>
#include <map>
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <stack>
#include <algorithm>
#include <bitset>
#include <sstream>
#include <string>
#include <cmath>
#include <stack>
#include <math.h>
#include <list>
#include <set>
#include <complex>
#include <string.h>

#define INF (1 << 29)
#define rep2(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) rep2(i,0,n)
#define squere(x) ((x)*(x))
#define EPS 1e-20

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;


int dx[4] = {-1,0,1,0};
int dy[4] = {0,1,0,-1};

int main()
{
    int R,C,D;
    cin >> R >> C >> D;

    int res = -1;
    rep(i,R) rep(j,C){
        int a;
        cin >> a;
        if(i+j<=D&&(D-i-j)%2==0) {
            res = max(a,res);
        }
    }
    cout << res << endl;
    return 0;
}

Submission Info

Judge Result