2118: 墨墨的等式 最短路

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define inf 10000000000000000ll
#define intinf 1000000007
#define N 500005
#define M 6000005
using namespace std;
int n,m,cnt,mn=intinf;
long long BMin,BMax;
long long dis
;
int head
,list[M],next[M],key[M],a[20];
bool vis
;
inline long long read()
{
long long a=0,f=1; char c=getchar();
while (c<'0'||c>'9') {if (c=='-') f=-1; c=getchar();}
while (c>='0'&&c<='9') {a=a*10+c-'0'; c=getchar();}
return a*f;
}
inline void insert(int x,int y,int z)
{
next[++cnt]=head[x];
head[x]=cnt;
list[cnt]=y;
key[cnt]=z;
}
inline void dijkstra()
{
priority_queue<pair<long long,int>,vector<pair<long long,int> >,greater<pair<long long,int> > > q;
for (int i=1;i<mn;i++) dis[i]=inf;
q.push(make_pair(0,0));
while (!q.empty())
{
int x=q.top().second; q.pop();
if (vis[x]) continue;
vis[x]=true;
for (int i=head[x];i;i=next[i])
if (dis[x]+key[i]<dis[list[i]])
{
dis[list[i]]=dis[x]+key[i];
q.push(make_pair(dis[list[i]],list[i]));
}
}
}
int main()
{
n=read(); BMin=read()-1; BMax=read();
for (int i=1;i<=n;i++)
a[i]=read(),mn=min(a[i],mn);
for (int i=0;i<mn;i++)
for (int j=1;j<=n;j++)
insert(i,(i+a[j])%mn,a[j]);
dijkstra();
long long ans=0;
for (int i=0;i<mn;i++)
{
if (dis[i]<=BMin) ans-=(BMin-dis[i])/mn+1;
if (dis[i]<=BMax) ans+=(BMax-dis[i])/mn+1;
}
cout << ans << endl;
return 0;
}