2991. 鞍点

#include<iostream>

void solve();
using namespace std;

int main() {
    int t;
    cin >> t;

    for (int i = 0; i != t; ++i) {
        cout << "case #" << i << ":\n";
        solve();
    }
}

void solve() {
    // Read matrix.
    int matrix[5][5];
    for (int i = 0; i != 5; ++i) {
        for (int j = 0; j != 5; ++j) {
            cin >> matrix[i][j];
        }
    }

    // Calculate the minimal value of each column.
    int min_of_column[5];
    for (int i = 0; i != 5; ++i) {
        min_of_column[i] = matrix[0][i];
        for (int j = 1; j != 5; ++j) {
            if (min_of_column[i] > matrix[j][i]) {
                min_of_column[i] = matrix[j][i];
            }
        }
    }

    // Calculate the maximal value of each row.
    int max_of_row[5];
    for (int i = 0; i != 5; ++i) {
        max_of_row[i] = matrix[i][0];
        for (int j = 1; j != 5; ++j) {
            if (max_of_row[i] < matrix[i][j]) {
                max_of_row[i] = matrix[i][j];
            }
        }
    }

    // find every saddle point. Note that they are *in order* for we iterate with i in 0..5 and j in 0..5.
    int saddle_points[25][2];
    int cnt = 0; // count of saddle_points.
    for (int i = 0; i != 5; ++i) {
        for (int j = 0; j != 5; ++j) {
            int val = matrix[i][j];
            if (val == max_of_row[i] && val == min_of_column[j]) {
                saddle_points[cnt][0] = i;
                saddle_points[cnt][1] = j;
                cnt += 1;
            }
        }
    }

    // output each.
    if (cnt == 0) {
        cout << "-1 -1\n";
    } else {
        for (int i = 0; i != cnt; ++i) {
            cout << saddle_points[i][0] << ' ' << saddle_points[i][1] << '\n';
        }
    }
}