cf13E. Holes

链接

点击跳转

题解

$t{o}_x,ste{p}_x$分别记录从$x$跳出当前所在的块到的地方，以及步数

修改查询都是$O(\sqrt{n})$的

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 1000010
#define maxe 1000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
ll a[maxn], n, m, to[maxn], step[maxn], S=340, belong[maxn];
int main()
{
    ll i, j, type, x, y;
    n=read(), m=read();
    rep(i,n)a[i]=read(), belong[i]=i/S;
    for(i=n+1;i<=2*n;i++)belong[i]=belong[n]+1;
    for(i=n;i;i--)
    {
        if(belong[i+a[i]]>belong[i])step[i]=1, to[i]=i+a[i];
        else step[i]=step[i+a[i]]+1, to[i]=to[i+a[i]];
    }
    while(m--)
    {
        type=read();
        if(type==0)
        {
            x=read(), y=read();
            a[x]=y;
            for(i=x;i>=max(1ll,x-x%S);i--)
            {
                if(belong[i+a[i]]>belong[i])step[i]=1, to[i]=i+a[i];
                else step[i]=step[i+a[i]]+1, to[i]=to[i+a[i]];
            }
        }
        else
        {
            x=read();
            ll ans=0, pos=x;
            while(belong[to[x]]<belong[n])
            {
                ans+=step[x];
                pos=x;
                x=to[x];
            }
            while(x<=n)
            {
                ans++;
                pos=x;
                x=x+a[x];
            }
            printf("%lld %lld\n",pos,ans);
        }
    }
    return 0;
}