1900分图论：Nearest Opposite Parity 建图+超级源点

1.为何建立反图

如果不建立反图，那么只能暴力每一个点A进行一遍最短路，筛选出符合条件距离最小的点。我们是要选出所有符合条件的点，距离A最小的点，可以考虑建立反图优化时间，一次性找出多个点

2.可以采用多源BFS或者建立超级源点再进行BFS

//#define LOCAL
#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DNF 0x7f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define pb push_back
#define p_queue priority_queue
#define CLOSE ios::sync_with_stdio(0); cin.tie(0)

void FileIO()
{
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("odata.out", "w", stdout);
#endif
}
ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
const int N = 200005;
int T;
int n , m , st, ed;
vector <int> edge[N];
int vis[N];
int a[N], d[N], ans[N];
queue <int> q;
void bfs(int root)
{
    vis[root] = 1;
    q.push(root);
    d[root] = 0;
    while(!q.empty())
    {
        int no = q.front();
        q.pop();
        for (auto v : edge[no])
        {
            if(!vis[v])
            {
                vis[v] = 1;
                d[v] = d[no] + 1;
                q.push(v);
            }
        }
    }
}
int main(void)
{
    CLOSE;
    cin >> n;
    for (int i = 1 ; i <= n ; i ++)
    {
        cin >> a[i];
        if(i + a[i] <= n)
            edge[i + a[i]].pb(i);
        if(i - a[i] >= 1)
            edge[i - a[i]].pb(i);
    }
    for (int i = 1 ; i <= n ; i ++)
        if(a[i] % 2)
            edge[n + 1].pb(i);
        else
            edge[n + 2].pb(i);
    bfs(n+1);
    for (int i = 1 ; i <= n ; i ++)
        if(a[i]%2 == 0) ans[i] = d[i]-1;
    mem(d,0), mem(vis,0);
    bfs(n+2);
    for (int i = 1 ; i <= n ; i ++)
        if(a[i]%2) ans[i] = d[i]-1;
    for (int i = 1 ; i <= n ; i ++)
        if(!a[i])
            cout << -1 << ' ';
        else
            cout << ans[i] << ' ';

}