题解 | 棋盘

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

int main() {
    int n;
    cin >> n;
    vector<vector<int>> map(n, vector<int>(n));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            cin >> map[i][j];
    
    int line;
    cin >> line;
    vector<vector<int>> area(line, vector<int>(4));
    for (int i = 0; i < line; i++)
        for (int j = 0; j < 4; j++)
            cin >> area[i][j];

    vector<vector<int>> point(line, vector<int>(2));

    for (int i = 0; i < line; i++) {
        int x = area[i][0];
        int y = area[i][1];
        int x_end = area[i][2];
        int y_end = area[i][3];

        while (x <= x_end && y <= y_end) {
            if (map[x-1][y-1] == 0)
                x += 1;
            else if (map[x-1][y-1] == 1)
                y += 1;
        }

        point[i][0] = (x > x_end ? x_end : x);
        point[i][1] = (y > y_end ? y_end : y);
    }

    for (int i = 0; i < line; i++)
        cout << point[i][0] << " " <<point[i][1] << endl;


    return 0;
}
// 64 位输出请用 printf("%lld")