import java.util.Scanner; public class Main{ public static void main(String[] args){ Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] row = new int[n]; int[] col = new int[n]; for(int i = 0;i<n;i++){ row[i] = in.nextInt(); col[i] = in.nextInt(); } //表示评分为0,1,2,3,4的垃圾点的个数 int num0=0,num1=0,num2=0,num3=0,num4=0; for(int i = 0;i < n;i++){ //检测该垃圾点的上下左右 都是垃圾点才满足 if(search(row,col,row[i]-1,col[i])&& search(row,col,row[i]+1,col[i])&& search(row,col,row[i],col[i]-1)&& search(row,col,row[i],col[i]+1)){ //是垃圾点 对它评分 int temp = 0; if(search(row,col,row[i]-1,col[i]-1)){ temp++; } if(search(row,col,row[i]+1,col[i]-1)){ temp++; } if(search(row,col,row[i]-1,col[i]+1)){ temp++; } if(search(row,col,row[i]+1,col[i]+1)){ temp++; } switch (temp){ case 0:num0++;break; case 1:num1++;break; case 2:num2++;break; case 3:num3++;break; case 4:num4++;break; } } } //输出结果 System.out.println(num0); System.out.println(num1); System.out.println(num2); System.out.println(num3); System.out.println(num4); } //查找r,c位置是否是垃圾点 static boolean search(int[] row,int[] col,int r,int c){ for(int i=0;i<row.length;i++){ if(row[i] == r && col[i] == c){ return true; } } return false; } }
CSP 201912-2 回收站选址
猜你喜欢
转载自blog.csdn.net/qq_18287147/article/details/106595721
今日推荐
周排行