Submission #1612513

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;

int main(){
	int h,w,k;
	cin>>h>>w>>k;
	int ans=-1;
	lol(i,h){
		lol(j,w){
			int a;cin>>a;
			if(k%2==(i+j)%2&&i+j<=k){
				ans=max(ans,a);
			}
		}
	}
	cout<<ans<<endl;
	return 0;
}

Submission Info

Judge Result