Submission #172303

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;

int search_max(vector<vector<int>> const& square_, int& x, int& y, int exc) {
    int max = 0;
    x = 0, y = 0;
    int tx = 0, ty = 0;
    for (auto v : square_) {
        for (auto n : v) {
            if (n > max && n < exc) {
                max = n;
                x = tx;
                y = ty;
            }
            tx++;
        }
        tx = 0;
        ty++;
    }
    return max;
}

int main() {
    int r, c, d;
    cin >> r >> c >> d;
    
    vector<vector<int>> square_;
    vector<int> v_tmp;
    for (int i = 0; i < r; ++i) {
        int tmp;
        //vector<int> v_tmp;
        for (int j = 0; i < c; ++j) {
            cin >> tmp;
            v_tmp.push_back(tmp);
        }
        square_.push_back(v_tmp);
        v_tmp.clear();
    }
    
    int max, x, y;
    int exclude = 1000;
    while (true) {
        max = search_max(square_, x, y, exclude);
        if ((x+y)%2 == d%2 && (x+y+2) >= d) {
            cout << max << endl;
            break;
        }
        exclude = max;
    }
}

        

Submission Info

Judge Result