#include <stdio.h> int main() { int i,n,x[10005],y[10005],a[10005],b[10005],x1,y1,k=1; scanf("%d",&n); for(i=0;i<n;i++) scanf("%d%d%d%d",&x[i],&y[i],&a[i],&b[i]); scanf("%d%d",&x1,&y1); for(i=n-1;i>=0;i--) { if((x1>=x[i]&&x1<=x[i]+a[i])&&(y1>=y[i]&&y1<=y[i]+b[i])) { printf("%d\n",i+1); k*=0;} else continue; if((x1>=x[i]&&x1<=x[i]+a[i])&&(y1>=y[i]&&y1<=y[i]+b[i])) break; } if(k==1) printf("-1\n"); return 0; }

用两个数组存每张地毯的左下角和右上角，再从后向前一张一张推，遇到要求的点在地毯内就输出并退出。

#include <bits/stdc++.h> using namespace std; const int N=1e5; int a[N],b[N],g[N],k[N]; int x,y,n; int main() { cin>>n; for(int i=1;i<=n;++i) cin>>a[i]>>b[i]>>g[i]>>k[i]; cin>>x>>y; for(int i=n;i>=1;--i) { if(x>=a[i] and x<=a[i]+g[i] and y>=b[i] and y<=b[i]+k[i]) { cout<<i<<endl; return 0; } } cout<<"-1"; return 0; }打不过史瓦罗

#include <bits/stdc++.h> #define debug freopen("in.txt","r",stdin);freopen("out.txt","w",stdout) using namespace std; const int N=10000+5; int a[N],b[N],g[N],k[N]; int n,x,y; int ans=-1; void work() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d%d%d%d",&a[i],&b[i],&g[i],&k[i]); scanf("%d%d",&x,&y); for(int i=1;i<=n;i++) if(x>=a[i]&&y>=b[i]&&x<=a[i]+g[i]&&y<=b[i]+k[i]) ans=i; printf("%d",ans); } int main() { //debug; work(); return 0; }

#include <bits/stdc++.h> using namespace std; const int N=1e5; int a[N],b[N],g[N],k[N]; int x,y,n; int main() { cin>>n; for(int i=1;i<=n;++i) cin>>a[i]>>b[i]>>g[i]>>k[i]; cin>>x>>y; for(int i=n;i>=1;--i) { if(x>=a[i] and x<=a[i]+g[i] and y>=b[i] and y<=b[i]+k[i]) { cout<<i<<endl; return 0; } } cout<<"-1"; return 0; }打不过史瓦罗