Nearest Opposite Parity【Codeforces 1272 E】【SPFA】

Codeforces Round #605 (Div. 3) E

---

  简单的说，就是每个点可以从i这号点跳转至(i - a[i]) 或 (i + a[i])点，然后问的是从偶数点跳至奇数点，从奇数点跳至偶数点的最少次数是多少。

 很容易想到的是反向建边，然后去跑SPFA就可以了，因为这里的边特别的少，SPFA的O(NM)的复杂度是完全可以的。

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 100000000
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define MP(a, b) make_pair(a, b)
#define Min3(a, b, c) min(a, min(b, c))
using namespace std;
typedef unsigned long long ull;
typedef unsigned int uit;
typedef long long ll;
const int maxN = 2e5 + 7;
int N, head[maxN], cnt, a[maxN];
bool odd[maxN] = {false};
struct Eddge
{
    int nex, to;
    Eddge(int a=-1, int b=0):nex(a), to(b) {}
}edge[maxN << 1];
inline void addEddge(int u, int v)
{
    edge[cnt] = Eddge(head[u],  v);
    head[u] = cnt++;
}
int dp[maxN][2];
queue<int> Q;
bool inque[maxN];
void spfa()
{
    int u;
    while(!Q.empty())
    {
        u = Q.front(); Q.pop(); inque[u] = false;
        for(int i=head[u], v; ~i; i=edge[i].nex)
        {
            v = edge[i].to;
            if(dp[v][odd[u]] > dp[u][odd[u]] + 1)
            {
                dp[v][odd[u]] = dp[u][odd[u]] + 1;
                if(!inque[v])
                {
                    Q.push(v);
                    inque[v] = true;
                }
            }
            if(dp[v][!odd[u]] > dp[u][!odd[u]] + 1)
            {
                dp[v][!odd[u]] = dp[u][!odd[u]] + 1;
                if(!inque[v])
                {
                    Q.push(v);
                    inque[v] = true;
                }
            }
        }
    }
}
inline void init()
{
    cnt = 0;
    for(int i=1; i<=N; i++)
    {
        head[i] = -1;
        dp[i][0] = dp[i][1] = INF;
        inque[i] = true;
    }
}
int main()
{
    scanf("%d", &N);
    init();
    for(int i=1; i<=N; i++)
    {
        scanf("%d", &a[i]);
        odd[i] = a[i] & 1;
        dp[i][odd[i]] = 0;
        if(i - a[i] > 0) addEddge(i - a[i], i);
        if(i + a[i] <= N) addEddge(i + a[i], i);
        Q.push(i);
    }
    spfa();
    for(int i=1; i<=N; i++) printf("%d%c", dp[i][!odd[i]] >= INF ? -1 : dp[i][!odd[i]], i == N ? '\n' : ' ');
    return 0;
}