luogu试练场の简单的模拟

P1 铺地毯

思路：以前一直是想用二维数组存了直接覆盖最后直接读后来发现直接判断坐标位置就可以了

#include<iostream>#include<cstdio>#include<cstring>using namespace std;int xi[10001],yi[10001],xx[10001],yy[10001];int nx,ny,n;int check(int a,int b,int c,int d){if (nx>=a&&ny>=b&&nx<=c&&ny<=d)//直接判断点是否在所选区域内 {return 1;}return 0;}int main (){cin>>n;for (int i=1;i<=n;i++){cin>>xi[i]>>yi[i]>>xx[i]>>yy[i];}cin>>nx>>ny;int result=-1;for (int i=1;i<=n;i++){if (check(xi[i],yi[i],xx[i],yy[i])){result=i;}}cout<<result;return 0;}

P2 排座椅写过不贴代码了

P3 笨小猴同上