打暴力90.9分!!!
吓得我哈哈大笑
正解dfs即可。
#include<cstdio>
using namespace std;
int a[1010][5],area[1010],n;
void dfs(int x1,int y1,int x2,int y2,int color,int deep)
{
while (deep<=n && (x1>=a[deep][2] || y1>=a[deep][3] || x2<=a[deep][0] || y2<=a[deep][1])) deep++;
if (de