CCF-CSP准备

dfs序，unique vector

sort(que+1,que+1+cnt);

len = unique(que+1,que+cnt+1)-que-1;

for(int i = 1;i <= n;i ++){

s[i] = lower_bound(que + 1, que + len + 1, k[i]) - que;

}

int qpow(int x,int k){

int res = 1;

while (k){

if (k&1) (res *= x) %= mod;

(x *= x) %= mod;

k >>= 1;

}

return res % mod;

}

map的应用

include

include

include

include

include

include

include

include

include

include

define int long long

define O(x) cout<<#x<<" "<<x<<endl;

define B cout<<"Breakpoint"<<endl;

using namespace std;

int read(){

int x = 1,a = 0;char ch = getchar();

while (ch < '0'||ch > '9'){if (ch == '-') x = -1;ch = getchar();}

while (ch >= '0'&&ch <= '9'){a = a10+ch-'0';ch = getchar();}

return xa;

}

const int maxn = 1e3+5;

int n,L,S;

struct node{

int x = 0,y = 0;

bool operator < (const node &a)const{

if (x != a.x) return x < a.x;

return y < a.y;

}

}fig[maxn];

int m[maxn][maxn];

map<node,int> g;

signed main(){

n = read(),L = read(),S = read();

for (int i = 1;i <= n;i++){

fig[i].x = read(),fig[i].y = read();

g[fig[i]] = 1;

}

int ans = 0;

for (int i = S;i >= 0;i--) for (int j = 0;j <= S;j++) m[i][j] = read();

for (int i = 1;i <= n;i++){

bool flag = 1;

for (int j = 0;j <= S;j++){

for (int k = 0;k <= S;k++){

node x;

x.x = fig[i].x+j,x.y = fig[i].y+k;

if (x.x > L||x.y > L){flag = 0;break;}

if (m[j][k]){

if (!g[x]){flag = 0;break;}

}

else{

// cout<<j<<" "<<k<<" "<<x.x<<" "<<x.y<<" "<<g[x]<<endl;

if (g[x]){flag = 0;break;}

}

}

}

// cout<<"---";

if (flag) ans++;

}

cout<<ans<<endl;

}