CF简单优化

Eugeny loves listening to music. He has n songs in his play list. We know that song number i has the duration of t_i minutes. Eugeny listens to each song, perhaps more than once. He listens to song number i c_i times. Eugeny's play list is organized as follows: first song number 1 plays c₁ times, then song number 2 plays c₂ times, ..., in the end the song number n plays c_n times.

Eugeny took a piece of paper and wrote out m moments of time when he liked a song. Now for each such moment he wants to know the number of the song that played at that moment. The moment x means that Eugeny wants to know which song was playing during the x-th minute of his listening to the play list.

Help Eugeny and calculate the required numbers of songs.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 10⁵). The next n lines contain pairs of integers. The i-th line contains integers c_i, t_i(1 ≤ c_i, t_i ≤ 10⁹) — the description of the play list. It is guaranteed that the play list's total duration doesn't exceed 10⁹ .

The next line contains m positive integers v₁, v₂, ..., v_m, that describe the moments Eugeny has written out. It is guaranteed that there isn't such moment of time v_i, when the music doesn't play any longer. It is guaranteed that v_i < v_i + 1 (i < m).

The moment of time v_i means that Eugeny wants to know which song was playing during the v_i-th munite from the start of listening to the playlist.

Output

Print m integers — the i-th number must equal the number of the song that was playing during the v_i-th minute after Eugeny started listening to the play list.

Sample test(s)

input

1 2
2 8
1 16

output

1
1

input

4 9
1 2
2 1
1 1
2 2
1 2 3 4 5 6 7 8 9

output

1
1
2
2
3
4
4
4
4

AC代码：

速度也还可以

302B - Eugeny and Play List

GNU C++

Accepted

125 ms

3100 KB

#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <sstream>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <iostream>
#include <stdlib.h>
#include <cctype>
#define rep1(i,s,e) for(int i = (s);i<(e);++i)
#define rep2(i,s,e) for(int i = (s);i<=(e);++i)
#define maxn 100100
#define INF 1000000007
#define ls (root<<1)
#define rs (root<<1|1)
#define M  L+(R-L)/2
using namespace std;

int n,m;
struct song
{
    long long c;
    long long t;
    long long start;
    long long  end;
}s[maxn];
//有一个简单的优化。。。
//因为题目告诉我们：It is guaranteed that vi < vi + 1 (i<m)
//所以我们每次没必要从第一首歌开始找start和end而是保存上一次查找的结果。。从上一次的结果处开始查找
int main()
{
    //freopen("in.txt","r",stdin);
    while(scanf("%d%d",&n,&m)==2)
    {
        int sum = 0;
        for(int i = 1;i<=n;++i)
        {
         s[i].start = sum;

         scanf("%I64d%I64d",&s[i].c,&s[i].t);
         sum +=  s[i].c*s[i].t;

         s[i].end = sum;
        }
        int b = 1;
        for(int i = 0;i<m;++i)
        {
            int time;
            scanf("%I64d",&time);
            for(int j = b;j<=n;++j)
            {
                if(time>=s[j].start&&time<=s[j].end)
                {
                    b = j;
                    printf("%d\n",j);
                    break;
                }
            }

        }
    }
    return 0;
}