BZOJ 2612 [Poi2003]Sums（最短路）

#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue> 
using namespace std;
const int N=50010,INF=0x3f3f3f3f;
namespace DIJKSTRA{
    typedef pair<int,int>P;
    priority_queue<P,vector<P>,greater<P> >Q;
    int a[N],d[N],n,m;
    void Initialize(){
        int x,i;
        sort(a,a+n); m=a[0];
        for(i=1;i<m;i++)d[i]=INF;Q.push(P(0,0));
        while(!Q.empty()){
            P t=Q.top();Q.pop();
            if(d[t.second]<t.first)continue;
            for(x=t.second,i=1;i<n;i++){
                if(d[x]+a[i]<d[(x+a[i])%m])Q.push(P(d[(x+a[i])%m]=d[x]+a[i],(x+a[i])%m));
            }
        }
    }
    bool Check(int x){return d[x%m]<=x;}
    int Cal(int k){for(int i=0;i<m;i++)if(d[(k+i)%m]<=k+i)return k+i;}
}
int main(){
    using namespace DIJKSTRA;
    scanf("%d",&n);
    for(int i=0;i<n;i++)scanf("%d",&a[i]);
    Initialize(); int k;
    scanf("%d",&k);
    while(k--){
        int x;
        scanf("%d",&x);
        if(Check(x))puts("TAK");
        else puts("NIE");
    }return 0;
}