Submission #171925

---

Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define mp       make_pair
#define pb       push_back
#define all(x)   (x).begin(),(x).end()
#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

typedef    long long          ll;
typedef    unsigned long long ull;
typedef    vector<bool>       vb;
typedef    vector<int>        vi;
typedef    vector<vb>         vvb;
typedef    vector<vi>         vvi;
typedef    pair<int,int>      pii;

const int INF=1<<29;
const double EPS=1e-9;

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

int main(){
	int R,C,D;
	cin>>R>>C>>D;
	vector<pair<int,pii> >  data;
	for(int i = 1;i <= R;i++){
		for(int j = 1;j <= C;j++){
			int x;
			cin>>x;
			data.push_back(mp(x,mp(i,j)));
		}
	}
	sort(data.begin(),data.end());
	for(int i = 0;i < data.size();i++){
		int y = data[data.size() - 1 - i ].second.first;
		int x = data[data.size() - 1 - i ].second.second;
		if((D - (x + y - 2))>=0&&(D - (x + y - 2))%2 == 0){
			cout <<data[data.size() - 1 - i].first<<endl;
			return 0;
		}
	}
	return 0;
}

Submission Info

Judge Result