【玲珑学院OJ1058】Coco(记忆化搜索)

记录一个菜逼的成长。。

先排好序，只搜索比当前值小的b[i]，记录最小值
用vis[i]记忆化保存

//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <deque>
#include <cctype>
#include <bitset>
#include <cmath>
#include <cassert>
using namespace std;
#define ALL(v) (v).begin(),(v).end()
#define cl(a,b) memset(a,b,sizeof(a))
#define bp __builtin_popcount
#define pb push_back
#define mp make_pair
#define fin freopen("D://in.txt","r",stdin)
#define fout freopen("D://out.txt","w",stdout)
#define lson t<<1,l,mid
#define rson t<<1|1,mid+1,r
#define seglen(t) (node[t].r-node[t].l+1)
#define pi 3.1415926
#define exp  2.718281828459
#define lowbit(x) (x)&(-x)
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef vector<PII> VPII;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
template <typename T>
inline void read(T &x){
    T ans=0;
    char last=' ',ch=getchar();
    while(ch<'0' || ch>'9')last=ch,ch=getchar();
    while(ch>='0' && ch<='9')ans=ans*10+ch-'0',ch=getchar();
    if(last=='-')ans=-ans;
    x = ans;
}
const int maxn = 1000000 + 10;
int b[maxn],n,ans,vis[maxn];
void dfs(int res,int cnt)
{
    if(res == 0){
        ans = min(ans,cnt);
        return ;
    }
    for( int i = 1; i <= n && b[i] <= res; i++ ){
        if(!vis[res % b[i]]){
            vis[res % b[i]] = 1;
            dfs(res%b[i],cnt+1);
        }
    }
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--){
        int a;
        cl(vis,0);
        scanf("%d%d",&n,&a);
        for( int i = 1; i <= n; i++ )
            scanf("%d",b+i);
        sort(b+1,b+n+1);
        ans = INF;
        dfs(a,0);
        printf("%d\n",ans == INF ? -1 : ans);
    }
    return 0;
}