IDA* POJ 2331

估计函数A*,   就是把当前信息，以及启发式信息找到。

IDA*，就是迭代进行递推，知道找到答案值，对出。

ID 就是迭代的意思，就是有层次的搜索，在本题中，

预处理每一个状态的启发值，然后再把横竖连贯

显然次数用h函数可以把到不了的多余状态剪掉

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<queue>
#define rep(i,a,b) for(int i=a; i<=b; ++i)
#define per(i,a,b) for(int i=a; i>=b; --i)
#define read(a) scanf("%d",&a)
#include<algorithm>
#define M 1000+100
#define S 10+10
int sx, sy, tx, ty, n;
int hx[M], hy[M];
struct node {int len; int sum;}; struct node p[S];
using namespace std;
void star(int x,int *h)
{
  queue<int> q;
  q.push(x);
  h[x] = 0;
  while(!q.empty())
  {
    int k = q.front(); q.pop();
    for(int i=1; i<=n; ++i)
    {
      int t = k - p[i].len;
      if( t >= 1 && h[t] == -1) 
      {
      	h[t] = h[k] + 1;
      	q.push(t);
      }
      t = k + p[i].len;
      if( t <= 1000 && h[t] == -1)
      {
      	h[t] = h[k] + 1;
      	q.push(t);
      }
	}
  }
  return;
}

bool check(struct node *t,int x,int deep,int tot_deep,int statu)
{
  struct node tmp[S]; int inc;
  if (statu == 0) inc = hx[x]; else inc = hy[x];
  if (inc == -1 || deep + inc > tot_deep) return 0;
  if (inc == 0) {if(statu == 0) return check(t,sy,deep,tot_deep,1); else return 1;} 
  
  rep(i,1,n) tmp[i].len = t[i].len , tmp[i].sum = t[i].sum;
  rep(i,1,n) 
  { 
  	if(tmp[i].sum <= 0) continue;
    --tmp[i].sum;   	
    if( x - tmp[i].len >= 1) if(check(tmp, x - tmp[i].len, deep+1, tot_deep, statu)) return 1;
    if( x + tmp[i].len <= 1000) if(check(tmp, x + tmp[i].len, deep+1 ,tot_deep,statu)) return 1;
    ++tmp[i].sum;
  }
  return 0;
}

void IDA(int sum)
{
  int flag = 0;
  int ans;
  for(ans = 1; ans <= sum; ++ans){if(check(p,sx,0,ans,0)) {flag = 1; break;}}
  if(flag) printf("%d\n",ans); else puts("-1");
}

int main()
{
  int sum = 0;
  read(sx),read(sy),read(tx),read(ty),read(n);
  rep(i,1,n) read(p[i].len);
  rep(i,1,n) read(p[i].sum), sum += p[i].sum;
  if (sx == tx && sy == ty) { puts("0"); return 0;}
  memset(hx, -1 ,sizeof(hx));
  memset(hy, -1 ,sizeof(hy));
  star(tx, hx);
  star(ty, hy); 
  IDA(sum);
}