CF-E. Holes(区间分块，二分思想)

E. Holes

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

Little Petya likes to play a lot. Most of all he likes to play a game «Holes». This is a game for one person with following rules:

There are N holes located in a single row and numbered from left to right with numbers from 1 to N. Each hole has it's own power (hole number i has the power a_i). If you throw a ball into hole i it will immediately jump to hole i + a_i, then it will jump out of it and so on. If there is no hole with such number, the ball will just jump out of the row. On each of the M moves the player can perform one of two actions:

• Set the power of the hole a to value b.
• Throw a ball into the hole a and count the number of jumps of a ball before it jump out of the row and also write down the number of the hole from which it jumped out just before leaving the row.

Petya is not good at math, so, as you have already guessed, you are to perform all computations.

Input

The first line contains two integers N and M (1 ≤ N ≤ 10⁵, 1 ≤ M ≤ 10⁵) — the number of holes in a row and the number of moves. The second line contains N positive integers not exceeding N — initial values of holes power. The following M lines describe moves made by Petya. Each of these line can be one of the two types:

• 0 a b
• 1 a

Type 0 means that it is required to set the power of hole a to b, and type 1 means that it is required to throw a ball into the a-th hole. Numbers a and b are positive integers do not exceeding N.

Output

For each move of the type 1 output two space-separated numbers on a separate line — the number of the last hole the ball visited before leaving the row and the number of jumps it made.

Sample test(s)

Input

8 5
1 1 1 1 1 2 8 2
1 1
0 1 3
1 1
0 3 4
1 2

Output

8 7
8 5
7 3

 

思路：直接模拟询问次数乘以询问代价，更新代价为O（1）最坏N*N ，N<10^5有最坏数据直接爆了。

        所以应该分用区间，分多少区间呢？多少都行，但一般选择sqrt(N)比较合适。

       这样挑出大区间的值，就等于调出sqrt(N)个小区间的值之和。

       这样更新代价为O(sqrt(N)),询问代价也为O(sqrt(N)),总代价最坏为O(N*sqrt(N))可以差不多险过。

哎！当时比赛怎么没去看这题，一直第二道抠几何题，解决方法很简单就是向量的一些基本知识，可惜代码敲半死没敲出来。

->最后的题不一定是最难的题。

TLE代码:

#include<iostream>
using namespace std;
const int mm=100100;
int f[mm],s[mm];
int main()
{
  int m,n;
  int a,b,c;
  while(cin>>m>>n)
  {
    for(int i=1;i<=m;i++)
      cin>>f[i];
      int num,last;
    for(int i=0;i<n;i++)
    {
      cin>>a>>b;
      if(a)
      {
        num=0;
        while(b<=m)
        { last=b;
          b+=f[b];
          num++;
        }
        cout<<last<<" "<<num<<"\n";
      }
      else
      {
        cin>>c;f[b]=c;
      }
    }
  }
}

 

优化完的代码

 

#include<iostream>
#include<cmath>
using namespace std;
const int mm=100100;
int f[mm],num[mm],last[mm];
int k,m,n;
void fen(int x)///区间值更新
{
  if(x+f[x]>m||x/k!=(x+f[x])/k)///挑出区间了
    last[x]=x,num[x]=0;
  else last[x]=last[f[x]+x],num[x]=num[x+f[x]]+1;///在去间内正常模拟
}
int main()
{
  int a,b,c;
  while(cin>>m>>n)
  {
    for(int i=1;i<=m;i++)
      cin>>f[i];
    for(int i=1;i*i<m;i++)///分sqrt(m)个区间
      k=i;
    for(int i=m;i>0;i--)///预处理
      fen(i);
    for(int i=0;i<n;i++)
    {
      cin>>a>>b;
      if(a)
      {
       int _num=0,_last;
        while(b<=m)///模拟区间跳
        { _last=last[b];
          _num+=num[b]+1;
          b=_last+f[_last];
        }
        cout<<_last<<" "<<_num<<"\n";
      }
      else
      {
        cin>>c;f[b]=c;
        for(int i=b;i>0&&i/k==b/k;i--)///区间更新
          fen(i);
      }
    }
  }
}

 

 

 

 

 

 

转载于:https://www.cnblogs.com/nealgavin/archive/2013/01/13/3206188.html