#PU572. USACO 2015 December Contest, Silver — Problem 3. Breed Counting

    ID: 1224 传统题 文件IO:bcount 2000ms 256MiB 尝试: 0 已通过: 0 难度: 提高 上传者: 标签>USACO赛事:dec15来源:usaco.orgscoring:equal_test_cases

USACO 2015 December Contest, Silver — Problem 3. Breed Counting

USACO 2015 December Contest, Silver — Problem 3. Breed Counting

题目描述

Farmer John's NN cows, conveniently numbered 1…N1 \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 (1≤N≤100,0001 \leq N \leq 100,000, 1≤Q≤100,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 (a≤ba \leq b).

输出格式

For each of the QQ queries (a,b)(a,b), print a line containing three numbers: the number of cows numbered a…ba \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
3 2 1
1 0 0
2 0 1
Problem credits: Nick Wu