結果

問題 No.697 池の数はいくつか
ユーザー watarimaycry2watarimaycry2
提出日時 2020-08-22 00:42:50
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,589 ms / 6,000 ms
コード長 3,977 bytes
コンパイル時間 3,817 ms
コンパイル使用メモリ 81,112 KB
実行使用メモリ 86,176 KB
最終ジャッジ日時 2024-11-08 08:42:51
合計ジャッジ時間 20,908 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,276 KB
testcase_01 AC 54 ms
37,284 KB
testcase_02 AC 54 ms
37,296 KB
testcase_03 AC 53 ms
36,968 KB
testcase_04 AC 53 ms
37,348 KB
testcase_05 AC 54 ms
37,056 KB
testcase_06 AC 54 ms
37,248 KB
testcase_07 AC 54 ms
36,980 KB
testcase_08 AC 53 ms
37,456 KB
testcase_09 AC 53 ms
37,496 KB
testcase_10 AC 54 ms
36,948 KB
testcase_11 AC 53 ms
37,232 KB
testcase_12 AC 54 ms
37,284 KB
testcase_13 AC 53 ms
37,376 KB
testcase_14 AC 53 ms
37,180 KB
testcase_15 AC 54 ms
36,948 KB
testcase_16 AC 53 ms
37,420 KB
testcase_17 AC 54 ms
37,336 KB
testcase_18 AC 54 ms
37,316 KB
testcase_19 AC 54 ms
37,316 KB
testcase_20 AC 55 ms
37,276 KB
testcase_21 AC 53 ms
36,936 KB
testcase_22 AC 53 ms
37,256 KB
testcase_23 AC 55 ms
37,332 KB
testcase_24 AC 652 ms
50,304 KB
testcase_25 AC 665 ms
50,244 KB
testcase_26 AC 640 ms
50,348 KB
testcase_27 AC 665 ms
50,428 KB
testcase_28 AC 663 ms
50,572 KB
testcase_29 AC 1,539 ms
85,852 KB
testcase_30 AC 1,449 ms
86,048 KB
testcase_31 AC 1,589 ms
86,084 KB
testcase_32 AC 1,560 ms
85,408 KB
testcase_33 AC 1,455 ms
86,176 KB
testcase_34 AC 1,517 ms
85,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; import java.io.*; import java.math.*;
public class Main{
	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max; String read;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			try{
				while((read = br.readLine()) != null){
					inputLine.add(read);
				}
			}catch(IOException e){}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				return inputLine.get(index++);
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
	static HashMap<Integer, String> CONVSTR = new HashMap<Integer, String>();
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static boolean hasNext(){return ii.hasNext();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static ArrayList<String> nextStrArray(){return myconv(next(), 8);}
	static ArrayList<String> nextCharArray(){return myconv(next(), 0);}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Integer> ret = new ArrayList<Integer>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<String> input = nextStrArray(); ArrayList<Long> ret = new ArrayList<Long>(input.size());
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	static String myconv(Object list, int no){//only join
		String joinString = CONVSTR.get(no);
		if(list instanceof String[]){
			return String.join(joinString, (String[])list);
		}else if(list instanceof ArrayList){
			return String.join(joinString, (ArrayList)list);
		}else{
			throw new ClassCastException("Don't join");
		}
	}
	static ArrayList<String> myconv(String str, int no){//only split
		String splitString = CONVSTR.get(no);
		return new ArrayList<String>(Arrays.asList(str.split(splitString)));
	}
	public static void main(String[] args){
		CONVSTR.put(8, " "); CONVSTR.put(9, "\n"); CONVSTR.put(0, "");
		solve();flush();
	}
	//Don't have to see. end------------------------------------------
	static boolean[][] list;
	static int H;
	static int W;
	static void solve(){//Here is the main function
		ArrayList<Integer> one = nextIntArray();
		H = one.get(0);
		W = one.get(1);
		list = new boolean[H][W];
		for(int i = 0; i < H; i++){
			ArrayList<Integer> tmp = nextIntArray();
			for(int j = 0; j < W; j++){
				list[i][j] = (tmp.get(j) == 1) ? true : false;
			}
		}
		int count = 0;
		for(int i = 0; i < H; i++){
			for(int j = 0; j < W; j++){
				if(list[i][j]){
					bfs(i,j);
					count++;
				}
			}
		}
		myout(count);
	}
	//Method addition frame start

static void bfs(int y, int x){
	int[] dy = {-1,0,1,0};
	int[] dx = {0,-1,0,1};
	ArrayDeque<Node> queue = new ArrayDeque<Node>();
	list[y][x] = false;
	queue.add(new Node(y, x));
	while(queue.size() > 0){
		Node tmp = queue.pollFirst();
		int nowY = (int)tmp.getKey();
		int nowX = (int)tmp.getValue();
		for(int i = 0; i < 4; i++){
			int nextY = nowY + dy[i];
			int nextX = nowX + dx[i];
			if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W){
				if(list[nextY][nextX]){
					queue.addLast(new Node(nextY, nextX));
					list[nextY][nextX] = false;
				}
			}
		}
	}
}

static class Node{
	int y;
	int x;
	Node(int y, int x){
		this.y = y;
		this.x = x;
	}
	int getKey(){
		return y;
	}
	int getValue(){
		return x;
	}
}

	//Method addition frame end
}
0