[题目链接] https://www.luogu.org/problemnew/show/P1074 [算法] 搜索 + 剪枝 [代码] #include<bits/stdc++.h> using namespace std; const int INF = 2e9; struct point { int x,y; } a[]; int i,j,ans,n,Mask,t; ][]; ],num[]; ]; ],col[],grid[]; bool solved; ][] = { {,,,,,,…