B. Eugeny and Play List

最新推荐文章于 2022-05-12 16:54:35 发布

原创最新推荐文章于 2022-05-12 16:54:35 发布 · 1.6k 阅读

0 ·

CC 4.0 BY-SA版权

本文为博主原创文章，未经博主允许不得转载。

AC路漫漫专栏收录该内容

1884 篇文章

订阅专栏

本文介绍了一个关于音乐播放列表的问题及解决方法。问题的核心是确定在指定时间点正在播放哪首歌曲，通过遍历歌曲列表并累计播放时间来定位当前播放的曲目。

Eugeny loves listening to music. He has n songs in his play list. We know that song number i has the duration of ti minutes. Eugeny listens to each song, perhaps more than once. He listens to song number i ci times. Eugeny's play list is organized as follows: first song number 1 plays c1 times, then song number 2 plays c2 times, ..., in the end the song number n plays cn 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 ≤ 105). The next n lines contain pairs of integers. The i-th line contains integers ci, ti(1 ≤ ci, ti ≤ 109) — the description of the play list. It is guaranteed that the play list's total duration doesn't exceed 109 $\text{[math]}$ .

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

The moment of time vi means that Eugeny wants to know which song was playing during the vi-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 vi-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

解题说明：此题虽然是一道歌曲播放问题，但是实际是判断某个数落在哪个区间段内。mp3中的歌曲播放的时间就是一段段区间，而给出的时刻就是一个数。

#include <iostream>
#include<algorithm>
#include<fstream>
#include<cstdio>
#include<cstring>
using namespace std;

long i,j,k,n,m,a[100002];

int main()
{
	scanf("%ld %ld",&n,&m);
	for(i=0;i<n;i++)
	{ 
		scanf("%ld %ld",&j,&k); 
		a[i]=j*k; 
	}
	for(i=0,j=0,n=0;i<m;i++)
	{
		scanf("%ld",&k);
		while(n<k)
		{ 
			n+=a[j]; 
			j++; 
		}
		printf("%ld\n",j);
	}
	return 0;
}