https://codeforces.com/problemset/problem/1272/E
思路:对于每个点1/0暴力去跑肯定超时。
奇偶分开,以偶数为例。
对于奇数的答案考虑建边后所有偶数跑完最短路的时候dis[]的答案,由于偶数很多,且以偶数作为开头,可以把所有的偶数连到一个虚拟源上去,边权为0.此时再对于能到达的点反向建边跑两个最短路就好。由于边权为0,1.bfs就好
#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2e5+1000;
typedef int LL;
typedef pair<LL,LL>P;
inline LL read(){LL x=0,f=1;char ch=getchar(); while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
vector<LL>g1[maxn],g2[maxn];
LL a[maxn];
LL dis[maxn],ans1[maxn],ans2[maxn];
bool vis[maxn];
///0为连偶数的超级源
///n+1为连奇数的超级源
void bfs(vector<LL>g[],LL st){
memset(vis,0,sizeof(vis));
memset(dis,0x3f,sizeof(dis));
queue<P>que;
vis[st]=true;
dis[st]=0;
for(LL i=0;i<g[st].size();i++){
LL v=g[st][i];
vis[v]=true;
dis[v]=0;
que.push({dis[v],v});
}
while(!que.empty()){
P now=que.front();que.pop();
LL cost=now.first;LL u=now.second;
dis[u]=cost;
for(LL i=0;i<g[u].size();i++){
LL v=g[u][i];
if(vis[v]) continue;
vis[v]=true;
que.push({cost+1,v});
}
}
}
int main(void){
cin.tie(0);std::ios::sync_with_stdio(false);
LL n;cin>>n;
for(LL i=1;i<=n;i++){
cin>>a[i];
}
for(LL i=1;i<=n;i++){
if(a[i]%2==0){
g1[0].push_back(i);
}
if(i+a[i]<=n) g1[i+a[i]].push_back(i);
if(i-a[i]>=1) g1[i-a[i]].push_back(i);
}
bfs(g1,0);
for(LL i=1;i<=n;i++){
if(a[i]&1){
if(!vis[i]) ans1[i]=-1;
else ans1[i]=dis[i];
}
}
for(LL i=1;i<=n;i++){
if(a[i]&1){
g2[n+1].push_back(i);
}
if(i+a[i]<=n) g2[i+a[i]].push_back(i);
if(i-a[i]>=1) g2[i-a[i]].push_back(i);
}
bfs(g2,n+1);
for(LL i=1;i<=n;i++){
if(a[i]%2==0){
if(dis[i]==0x3f3f3f3f) ans2[i]=-1;
else ans2[i]=dis[i];
}
}
for(LL i=1;i<=n;i++){
if(a[i]&1){
cout<<ans1[i]<<" ";
}
else if(a[i]%2==0){
cout<<ans2[i]<<" ";
}
}
cout<<"\n";
return 0;
}