P2371 [国家集训队]墨墨的等式 ——同余最短路

P2371

思路

同余最短路，自我感觉做这类题要注意两点。
1.虽然n的范围很小，但实际建图的点的数量为min{a_i} =5e5，边的数量为$n\ast a_i$即12*5e5。
2.和上篇文章的题目初始dis[1] = 1不同，这道题目初始值即为dis[0] = 0,表示a mod a_i = 0 中a的最小值可以取到0。

代码

//
//
#include <bits/stdc++.h>
using namespace std;
//#define mp make_pair
#define pii pair<int,int>
#define pb push_back
#define ll long long
#define LL long long
#define ld long double
#define endl '\n'
#define RE0 return 0
#define For(i,j,k) for (int i=(int)(j);i<=(int)(k);i++)
#define Rep(i,j,k) for (int i=(int)(j);i>=(int)(k);i--)

//#define int long long
#define db double
const int maxn = 6e6 + 10;
const int maxm = 6e6 + 10;
const int P = 1e9 + 7;    //998244353
const int INF = 0x3f3f3f3f;
const double eps=1e-7;
int h ,x, y, z;
ll dis[maxn];
int head[maxn];
int incnt[maxn];
struct Edge {
    int to, dis, next;
}edge[maxm];
bool vis[maxn];
int n, cnt;
void add_edge(int u, int v, int w) {
    cnt++;
    edge[cnt].to = v;
    edge[cnt].dis = w;
    edge[cnt].next = head[u];
    head[u] = cnt;
}
bool spfa(int s) {
//    memset(dis, 0x3f, sizeof(dis));
//    memset(vis, 0, sizeof(vis));
    for(int i = 0; i < maxn; i++)
        dis[i] = (ll)1e14;
    dis[s] = 0;
    queue<int> q;
    q.push(s);
    vis[s] = true;
    while(!q.empty()) {
        int u = q.front();
        if(incnt[u] > n)
            return false;
        q.pop();
        vis[u] = false;
        for(int i = head[u]; i; i = edge[i].next) {
            int v = edge[i].to;
            if(dis[v] > dis[u] + edge[i].dis) {
                dis[v] = dis[u] + edge[i].dis;
                if(!vis[v]) {
                    vis[v] = true;
                    q.push(v);
                    incnt[v]++;
                }
            }
        }
    }
    return true;
}
ll l, r;
int a[maxn];
void solve() {
    cin >> n >> l >> r;
    l--;
    int minn = INF;
    int p = 0;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        if(a[i] < minn) {
            minn = a[i];
            p = i;
        }
    }
    for(int i = 0; i < minn; i++) {
        for(int j = 1; j <= n; j++) {
            if(j == p) continue;
            add_edge(i, (i + a[j]) % minn, a[j]);
        }
    }
    spfa(0);
    ll ans = 0;
    for(int i = 0; i < minn; i++) {
        if(dis[i] <= r) {
            ans += (r - dis[i])/minn + 1;
        }
        if(dis[i] <= l)
            ans = ans - ((l - dis[i])/minn + 1);
    }
    cout << ans << endl;
    
}