https://codeforces.com/gym/100753/problem/M
经典做过模板题想不起来https://blog.csdn.net/liufengwei1/article/details/103997675
这题比那题更模板,然而这题的复杂度是O(ailogai+ai*n)的,n=5e4就显然不太能过的样子,结果assert了一下发现n<=5e3.。。。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxl=5e4+10;
const ll inf=1ll<<60;
int n,m;
//struct ed{int v,l;};
//vector<ed>e[maxl];
int a[maxl];ll dis[maxl];
typedef pair<ll,int> p;
priority_queue<p,vector<p>,greater<p> >q;
inline void prework()
{
scanf("%d",&n);
assert(n<=5000);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
sort(a+1,a+1+n);
}
inline void mainwork()
{
for(int i=1;i<a[1];i++)
dis[i]=inf;
dis[0]=0;q.push({dis[0],0});
while(!q.empty())
{
p d=q.top();q.pop();
int u=d.second;
if(dis[u]!=d.first)
continue;
for(int i=2;i<=n;i++)
{
int v=(u+a[i])%a[1];
if(dis[v]>dis[u]+a[i])
{
dis[v]=dis[u]+a[i];
q.push({dis[v],v});
}
}
}
}
inline void print()
{
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
int b;
scanf("%d",&b);
puts((dis[b%a[1]]<=b)?"TAK":"NIE");
}
}
int main()
{
prework();
mainwork();
print();
return 0;
}