|
| 1 | +//https://www.acmicpc.net/problem/11969 |
| 2 | +import java.io.BufferedReader; |
| 3 | +import java.io.IOException; |
| 4 | +import java.io.InputStreamReader; |
| 5 | +import java.util.StringTokenizer; |
| 6 | + |
| 7 | +public class BOJ_S3_11969_BreedCounting { |
| 8 | + public static void main(String[] args) throws IOException { |
| 9 | + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); |
| 10 | + StringBuilder sb = new StringBuilder(); |
| 11 | + StringTokenizer st = new StringTokenizer(br.readLine()); |
| 12 | + |
| 13 | + int N = Integer.parseInt(st.nextToken()); |
| 14 | + int Q = Integer.parseInt(st.nextToken()); |
| 15 | + |
| 16 | + int [][] sum = new int[N+1][3]; |
| 17 | + |
| 18 | + for (int i = 1; i <= N; i++) { |
| 19 | + for (int j = 0; j < 3; j++) { |
| 20 | + sum[i][j] = sum[i-1][j]; |
| 21 | + } |
| 22 | + |
| 23 | + int n = Integer.parseInt(br.readLine())-1; |
| 24 | + sum[i][n]++; |
| 25 | + } |
| 26 | + |
| 27 | + for (int i = 0; i < Q; i++) { |
| 28 | + st = new StringTokenizer(br.readLine()); |
| 29 | + int a = Integer.parseInt(st.nextToken()); |
| 30 | + int b = Integer.parseInt(st.nextToken()); |
| 31 | + |
| 32 | + int x = sum[b][0] - sum[a-1][0]; |
| 33 | + int y = sum[b][1] - sum[a-1][1]; |
| 34 | + int z = sum[b][2] - sum[a-1][2]; |
| 35 | + |
| 36 | + sb.append(x).append(" ").append(y).append(" ").append(z).append('\n'); |
| 37 | + } |
| 38 | + |
| 39 | + if(sb.length() > 0) sb.setLength(sb.length()-1); |
| 40 | + System.out.println(sb.toString()); |
| 41 | + |
| 42 | + } |
| 43 | +} |
0 commit comments