震惊，你谷这么多标题党！
by Joeywu_1101 @ 2019-07-03 10:26:00
~~明显的吸氧中毒~~
by charliegong @ 2019-07-03 10:27:40
震惊！
by 4biu @ 2019-07-03 10:52:50
@[Ofnoname](/space/show?uid=73489) O2优化并不是什么时候都起到优化作用
by ShineEternal @ 2019-07-03 11:07:54
没有
>return 0；
开$O_2$会错
by _lcy_ @ 2019-07-03 11:09:08
@[Ofnoname](/space/show?uid=73489)
by _lcy_ @ 2019-07-03 11:09:21
@[_lcy_](/space/show?uid=55812) 真的?
by xh39 @ 2019-07-03 11:11:21
@[hzdxbh139qhakj](/space/show?uid=87799)
```cpp
// luogu-judger-enable-o2
#include<iostream>
using namespace std;
struct carpet{
int a,b,g,k;
};
carpet a[10005];
int main(){
//cout<<"54789357485"<<endl;
int n,i,x,y,max=-1;
cin>>n;
for(i=0;i<n;i++){
cin>>a[i].a>>a[i].b>>a[i].g>>a[i].k;
//a[i].g+=a[i].a;
//a[i].k+=a[i].b;
}
cin>>x>>y;
for(i=0;i<n;i++){
//cout<<"i="<<i<<endl;
//cout<<"x="<<x<<endl;
//printf("a[%d]. a,%d b,%d g,%d k,%d\n",i,a[i].a,a[i].b,a[i].g,a[i].k);
if(((x>=a[i].a)&&x<=(a[i].a+a[i].g))&&((y>=a[i].b)&&(y<=(a[i].b+a[i].k)))){
max=i+1; //的爽肤水收到防守打法是电风扇的飞
}
}
cout<<max;
}
```
这是我p1003的答案,没有return 0;开了o2,也对。
by xh39 @ 2019-07-03 11:12:45
有几率
by _lcy_ @ 2019-07-03 11:16:47
你可以加上
```
return 0;
```
在$luoguIDE$上试试
by _lcy_ @ 2019-07-03 11:18:00