Jumping Gym - 101147E

版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。

本文链接： https://blog.csdn.net/weixin_39132605/article/details/100587228

https://vjudge.net/problem/Gym-101147E 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------

const int maxn=1e5+9;
const int maxm=3e6+9;
const int mod=1e9+7;

int a[maxn];
int d[maxn];
bool vis[maxn];
vector<int>g[maxn];

void bfs(int s)
{
    d[s]=0;

    queue<pair<int,int> > q;

    q.push({s,0});

    while(!q.empty())
    {
        pair<int,int> tmp;
        tmp=q.front();
        q.pop();
        int u=tmp.first;
        int step=tmp.second;
        if(vis[u]) continue;
        vis[u]=1;
        for(int i=0;i<g[u].size();i++)
        {
            int v=g[u][i];
            d[v]=min(d[v],step+1);
            q.push({v,step+1});
        }
    }

}
int main()
{
    FAST_IO;
    //freopen("input.txt","r",stdin);



    freopen("jumping.in","r",stdin);
    int T;
    //sfi(T);
    cin>>T;
    while(T--)
    {
        int n;
        cin>>n;
        for(int i=1;i<=n;i++) g[i].clear(),d[i]=INF,vis[i]=0;
        for(int i=1;i<=n;i++)
        {
            cin>>a[i];
            if(i-a[i]>0)
            {
                g[i-a[i]].pb(i);
            }
            if(i+a[i]<=n)
            {
                g[i+a[i]].pb(i);
            }
        }

        bfs(n);

        for(int i=1;i<=n;i++)
        {
            if(d[i]==INF) cout<<-1<<endl;
            else
                cout<<d[i]<<endl;
        }

    }

    return 0;
}