P3403 跳楼机 同余最短路

P3403

思路

同余最短路
dis[i]表示仅通过2,3操作能够达到的 a mod x = i 的最小的a值
注意由于起始位置在1处，故dis[1] = 1

代码

//
//
#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 = 2e5 + 10;
const int maxm = 2e5 + 10;
const int P = 1e9 + 7;    //998244353
const int INF = 0x3f3f3f3f;
const double eps=1e-7;
int h ,x, y, z;
int 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));
    dis[s] = 1;
    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;
}
void solve() {
    cin >> h >> x >> y >> z;
    if(x == 1 || y == 1 || z == 1) {
        cout << h << endl;
        return;
    }
    for(int i = 0; i < x; i++) {
        add_edge(i, (i + y) % x, y);
        add_edge(i, (i + z) % x, z);
    }
    ll ans = 0;
    spfa(1);
    for(int i = 0; i < x; i++) {
        if(dis[i] <= h) {
            ans += (h-dis[i])/x + 1;
        }
    }
    cout << ans << endl;
}