- 轰炸
- @ 2026-07-20 19:01:58
#include<bits/stdc++.h>
using namespace std;
int n,m,a,b;
struct hz
{
int num,last;
}imp[105][105];
int x[1005],y[1005];
int main()
{
cin>>n>>m>>a>>b;
for (int i=1;i<=a;i++)
{
int x1,x2,y1,y2;
cin>>x1>>y1>>x2>>y2;
for (int j=x1;j<=x2;j++)
{
for (int k=y1;k<=y2;k++)
{
imp[j][k].num++;
imp[j][k].last=i;
}
}
}
for (int i=1;i<=b;i++)
cin>>x[i]>>y[i];
for (int i=1;i<=b;i++)
{
if (imp[x[i]][y[i]].num>0)
cout<<"Y "<<imp[x[i]][y[i]].num<<" "<<imp[x[i]][y[i]].last<<endl;
else
cout<<"N";
}
return 0;
}
2 条评论
-
202607gj16张子瑞 (张子瑞) LV 9 @ 2026-07-21 18:47:22
?
-
@ 2026-07-21 12:30:32
#include<bits/stdc++.h> using namespace std; int n,m,a,b; struct hz { int num,last; }imp[105][105]; int x[1005],y[1005]; int main() { cin>>n>>m>>a>>b; for (int i=1;i<=a;i++) { int x1,x2,y1,y2; cin>>x1>>y1>>x2>>y2; for (int j=x1;j<=x2;j++) { for (int k=y1;k<=y2;k++) { imp[j][k].num++; imp[j][k].last=i; } } } for (int i=1;i<=b;i++) cin>>x[i]>>y[i]; for (int i=1;i<=b;i++) { if (imp[x[i]][y[i]].num>0) cout<<"Y "<<imp[x[i]][y[i]].num<<" "<<imp[x[i]][y[i]].last<<endl; else cout<<"N"<<endl; } return 0; }
- 1
信息
- ID
- 2920
- 难度
- 3
- 分类
- (无)
- 标签
- 递交数
- 55
- 已通过
- 26
- 通过率
- 47%
- 上传者