A1009.Breed Counting--Silver

普及/提高-

USACO

通过率:0%

时间限制:1.00s

内存限制:128MB

题目描述

Farmer John's NN cows, conveniently numbered 1N1 \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 NN and QQ (1N100,0001 \leq N \leq 100,000, 1Q100,0001 \leq Q \leq 100,000).
The next NN lines contain an integer that is either 1, 2, or 3, giving the
breed ID of a single cow in the ordering.
The next QQ lines describe a query in the form of two integers a,ba, b (aba \leq b).

输出格式

For each of the QQ queries (a,b)(a,b), print a line containing three numbers:
the number of cows numbered aba \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
    
首页