Codeforces GYM 100646E: Su-Su-Sudoku 题解

非常基础的搜索题

用位运算可以加速判重的过程

别忘了判断输入的部分是否有重复

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <utility>
#include <map>
#include <stack>
#include <set>
#include <vector>
#include <queue>
#include <deque>
#define x first
#define y second
#define mp make_pair
#define pb push_back
#define LL long long
#define Pair pair<int,int>
#define LOWBIT(x) x & (-x)
using namespace std;

const int INF=0x7ffffff;
inline int getk(int x,int y)
{
	int dr,dc;
	dr=(x+2)/3;dc=(y+2)/3;
	return (dr-1)*3+dc;
}

int rused[15],cused[15],kused[15];
vector<Pair> v;
int a[15][15];

bool dfs(int step)
{
	if (step==6) return true;
	int xx=v[step-1].x,yy=v[step-1].y;
	int used=rused[xx]|cused[yy]|kused[getk(xx,yy)];
	for (int i&#