洛谷P2371 [国家集训队]墨墨的等式

最新推荐文章于 2023-03-15 08:40:41 发布

*ACoder*

最新推荐文章于 2023-03-15 08:40:41 发布

阅读量150

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/FSAHFGSADHSAKNDAS/article/details/105176420

版权

数学专栏收录该内容

9 篇文章 0 订阅

订阅专栏

链接

点击跳转

题解

同余最短路裸题，详见这篇文章

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(i,a,b) for(i=a;i<=b;i++)
#define drep(i,a,b) for(i=a;i>=b;i--)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ull x, y, z, dis[maxn], p;
void dijkstra(vector<ull> v)
{
    priority_queue< pair<ull,ull>, vector< pair<ull,ull> >, greater< pair<ull,ull> > > heap;
    ull i;
    rep(i,1,p-1)dis[i]=-1;
    heap.em( make_pair( dis[0], ull(0) ) );
    while(!heap.empty())
    {
        auto pr = heap.top(); heap.pop();
        if(pr.fi>dis[pr.se])continue;
        for(auto x:v)
        {
            auto to = (pr.se+x)%p;
            if(dis[to]>pr.fi+x)
            {
                dis[to] = pr.fi+x;
                heap.em( make_pair(dis[to],to) );
            }
        }
    }
}
int main()
{
    ull ans(0), i, n, l, r;
    cin >> n >> l >> r;
    vector<ull> v;
    rep(i,1,n)
    {
        ull x; cin>>x;
        v.emb(x);
    }
    p = v.back();
    dijkstra(v);
    rep(i,0,p-1)
    {
        if(dis[i]<=r)ans += (r-dis[i]+1)/p+!!((r-dis[i]+1)%p);
        if(dis[i]<l)ans -= (l-dis[i])/p+!!((l-dis[i])%p);
    }
    cout << ans << endl;
    return 0;
}