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

11969번 - Breed Counting 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 512 MB17691192101268.703%

문제

Farmer John's \(N\) cows, conveniently numbered \(1 \ldots N\), are all standing in a row (they seem to do so often that it now takes very little prompting from Farmer John to line them up). Each cow has a breed ID: 1 for Holsteins, 2 for Guernseys, and 3 for Jerseys. Farmer John would like your help counting the number of cows of each breed that lie within certain intervals of the ordering.

입력

The first line of input contains \(N\) and \(Q\) (\(1 \leq N \leq 100,000\), \(1 \leq Q \leq 100,000\)).

The next \(N\) lines contain an integer that is either 1, 2, or 3, giving the breed ID of a single cow in the ordering.

The next \(Q\) lines describe a query in the form of two integers \(a, b\) (\(a \leq b\)).

출력

For each of the \(Q\) queries \((a,b)\), print a line containing three numbers: the number of cows numbered \(a \ldots b\) that are Holsteins (breed 1), Guernseys (breed 2), and Jerseys (breed 3).

제한

예제 입력 1

6 3
2
1
1
3
2
1
1 6
3 3
2 4

예제 출력 1

3 2 1
1 0 0
2 0 1

힌트

출처

Olympiad > USA Computing Olympiad > 2015-2016 Season > USACO December 2015 Contest > Silver 3번

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

출처

대학교 대회

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

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