Logo
(追記) (追記ここまで)

6014번 - Shorter Musical Notes 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 128 MB26119914877.487%

문제

FJ is going to teach his cows how to play a song. The song consists of N (1 <= N <= 10,000) notes, and the i-th note lasts for B_i (1 <= B_i <= 120) beats (thus no song is longer than 1,200,000 beats). The cows will begin playing the song at time 0; thus, they will play note 1 from time 0 through just before time B_1, note 2 from time B_1 through just before time B_1 + B_2, etc.

However, recently the cows have lost interest in the song, as they feel that it is too long and boring. Thus, to make sure his cows are paying attention, he asks them Q (1 <= Q <= 50,000) questions of the form, "In the interval from time T through just before time T+1, which note should you be playing?" The cows need your help to answer these questions which are supplied as T_i (0 <= T_i <= end_of_song).

Consider this song with three notes of durations 2, 1, and 3 beats:

Beat: 0 1 2 3 4 5 6 ...
 |----|----|----|----|----|----|--- ...
 1111111111 : :
 22222: :
 333333333333333:

Here is a set of five queries along with the resulting answer:

 Query Note
 2 2
 3 3
 4 3
 0 1
 1 1

입력

  • Line 1: Two space-separated integers: N and Q
  • Lines 2..N+1: Line i+1 contains the single integer: B_i
  • Lines N+2..N+Q+1: Line N+i+1 contains a single integer: T_i

출력

  • Lines 1..Q: Line i of the output contains the result of query i as a single integer.

제한

예제 입력 1

3 5
2
1
3
2
3
4
0
1

예제 출력 1

2
3
3
1
1

힌트

출처

Olympiad > USA Computing Olympiad > 2009-2010 Season > USACO December 2009 Contest > Bronze 3번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /