蓝桥杯算法提高VIP-铺地毯-题解(C语言代码)

#include<stdio.h>
int carpet[10000][4];
int main()
{
    int n, a, b, result = -1;
    int x, y, dx, dy;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        scanf("%d%d%d%d", &x, &y, &dx, &dy);
        carpet[i][0] = x, carpet[i][1] = y, carpet[i][2] = x + dx, carpet[i][3] = y + dy;
    }
    scanf("%d%d", &a, &b);
    for (int i = 0; i < n; i++) {
        if (a >= carpet[i][0] && a <= carpet[i][2] && b >= carpet[i][1] && b <= carpet[i][3])
            result = i + 1;
    }
    printf("%d", result);
    return 0;
}