Run ID 作者 问题 语言 测评结果 时间 内存 代码长度 提交时间
86919 sh25_zhoumy 铺地毯 C++ 通过 0 MS 252 KB 613 2026-04-10 14:45:38

Tests(1/1):


#include <iostream> using namespace std; struct Carpet { int a, b, g, k; }; int main() { int n; cin >> n; Carpet car[10005]; for (int i = 1; i <= n; i++) { cin >> car[i].a >> car[i].b >> car[i].g >> car[i].k; } int x, y; cin >> x >> y; for (int i = n; i >= 1; i--) { int a = car[i].a; int b = car[i].b; int g = car[i].g; int k = car[i].k; if (x >= a && x <= a + g && y >= b && y <= b + k) { cout << i << endl; return 0; } } cout << -1 << endl; return 0; }


测评信息: