B. Eugeny and Play List
2013-05-06 21:15
375 查看
B. Eugeny and Play List
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
.
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
output
input
output
这题还是比较简单,就是用一般的思路会超时,下面就说下题意吧,估计有些人和我一样看个题目都要半天,谁叫俺们英语差啊.......
题目大概意思是:Eugeny喜欢听歌,他听的歌有些不只听一次,他听的方式是这样的,第一首歌听 c1次而且每首歌听t1分钟,第二首歌听 c2次而且每首歌听t2分钟....第N首歌听 cn次而且每首歌听tn分钟,输入n,m下面跟着n行,每行有两个整数ci, ti意思前面说了然后下面一行有m个整数每个整数代表一个时刻,问在每个时刻,Eugeny在听第几首歌并且输出它.
估计题目懂了,你们也应该能敲出代码来,下面废话不多说,直接看代码吧
代码:
#include<iostream>
const int MAX=100001;
int x[MAX];
int y[MAX];
__int32 z[MAX]={0};//初始化0
using namespace std;
int main()
{
__int32 n,m,i,j,a,p;
cin>>n>>m;
p=1;
cin>>x[1]>>y[1];
z[1]=x[1]*y[1];
for(i=2;i<=n;i++)
{
cin>>x[i]>>y[i];
z[i]+=x[i]*y[i]+z[i-1];
}
for(j=1;j<=m;j++)
{
cin>>a;
while(a>z[p])
p++;
cout<<p<<endl;
}
return 0;
}//如果有问题,或有什么疑惑,可以在评论中提出,小子我看到一定尽力解答
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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
.
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 12
2
3
4
4
4
4
这题还是比较简单,就是用一般的思路会超时,下面就说下题意吧,估计有些人和我一样看个题目都要半天,谁叫俺们英语差啊.......
题目大概意思是:Eugeny喜欢听歌,他听的歌有些不只听一次,他听的方式是这样的,第一首歌听 c1次而且每首歌听t1分钟,第二首歌听 c2次而且每首歌听t2分钟....第N首歌听 cn次而且每首歌听tn分钟,输入n,m下面跟着n行,每行有两个整数ci, ti意思前面说了然后下面一行有m个整数每个整数代表一个时刻,问在每个时刻,Eugeny在听第几首歌并且输出它.
估计题目懂了,你们也应该能敲出代码来,下面废话不多说,直接看代码吧
代码:
#include<iostream>
const int MAX=100001;
int x[MAX];
int y[MAX];
__int32 z[MAX]={0};//初始化0
using namespace std;
int main()
{
__int32 n,m,i,j,a,p;
cin>>n>>m;
p=1;
cin>>x[1]>>y[1];
z[1]=x[1]*y[1];
for(i=2;i<=n;i++)
{
cin>>x[i]>>y[i];
z[i]+=x[i]*y[i]+z[i-1];
}
for(j=1;j<=m;j++)
{
cin>>a;
while(a>z[p])
p++;
cout<<p<<endl;
}
return 0;
}//如果有问题,或有什么疑惑,可以在评论中提出,小子我看到一定尽力解答
相关文章推荐
- B. Eugeny and Play List
- B. Eugeny and Play List
- codeforces 302 B. Eugeny and Play List
- codeforces 302 B. Eugeny and Play List
- Eugeny and Play List
- B. Eugeny and Play List
- codeforces 302B - Eugeny and Play List
- codeforces 302B - Eugeny and Play List
- M3U , PLSv2 and ASX Play List Specification
- M3U , PLSv2 and ASX Play List Specification
- Copy A Linked List With Next And Random Pointer
- SPOJ ADALIST Ada and List(双端队列)
- Recommended reading list: DB2 for Linux, UNIX, and Windows database administration
- List, Set, Vector and Map in Java
- (MFC Combo Box)Switch between drop-list and drop-down mode
- uva 10673 Play with Floor and Ceil(简单数论)
- List of maintainers and how to submit kernel changes
- Path Sum and Delete Node in a Linked List
- [SharePoint 2010] Copy list item with version history and attachment
- Difference between List View and DataGrid in WPF