結果
問題 | No.697 池の数はいくつか |
ユーザー | watarimaycry2 |
提出日時 | 2020-08-22 00:27:02 |
言語 | JavaScript (node v21.7.1) |
結果 |
AC
|
実行時間 | 3,250 ms / 6,000 ms |
コード長 | 2,740 bytes |
コンパイル時間 | 200 ms |
コンパイル使用メモリ | 7,068 KB |
実行使用メモリ | 146,648 KB |
最終ジャッジ日時 | 2024-04-25 20:49:48 |
合計ジャッジ時間 | 17,991 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 66 ms
42,572 KB |
testcase_01 | AC | 69 ms
40,192 KB |
testcase_02 | AC | 68 ms
40,192 KB |
testcase_03 | AC | 64 ms
40,448 KB |
testcase_04 | AC | 65 ms
40,320 KB |
testcase_05 | AC | 68 ms
40,448 KB |
testcase_06 | AC | 67 ms
40,192 KB |
testcase_07 | AC | 67 ms
40,448 KB |
testcase_08 | AC | 66 ms
40,192 KB |
testcase_09 | AC | 68 ms
42,452 KB |
testcase_10 | AC | 68 ms
40,192 KB |
testcase_11 | AC | 67 ms
40,192 KB |
testcase_12 | AC | 71 ms
42,096 KB |
testcase_13 | AC | 67 ms
40,448 KB |
testcase_14 | AC | 68 ms
42,228 KB |
testcase_15 | AC | 68 ms
40,192 KB |
testcase_16 | AC | 69 ms
40,192 KB |
testcase_17 | AC | 67 ms
40,192 KB |
testcase_18 | AC | 62 ms
40,064 KB |
testcase_19 | AC | 68 ms
40,192 KB |
testcase_20 | AC | 70 ms
40,064 KB |
testcase_21 | AC | 70 ms
42,184 KB |
testcase_22 | AC | 71 ms
40,448 KB |
testcase_23 | AC | 74 ms
40,448 KB |
testcase_24 | AC | 319 ms
63,208 KB |
testcase_25 | AC | 316 ms
63,204 KB |
testcase_26 | AC | 315 ms
65,108 KB |
testcase_27 | AC | 307 ms
63,204 KB |
testcase_28 | AC | 325 ms
65,240 KB |
testcase_29 | AC | 3,133 ms
144,676 KB |
testcase_30 | AC | 1,369 ms
144,756 KB |
testcase_31 | AC | 3,250 ms
144,892 KB |
testcase_32 | AC | 1,336 ms
144,728 KB |
testcase_33 | AC | 1,319 ms
146,648 KB |
testcase_34 | AC | 1,318 ms
144,816 KB |
ソースコード
//Don't have to see. start------------------------------------------ var read = require('readline').createInterface({ input: process.stdin, output: process.stdout }); var obj; var inLine = []; read.on('line', function(input){inLine.push(input);}); read.on('close', function(){ obj = init(inLine); console.error('\n↑入力 ↓出力'); Main(); }); function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));} function nextInt(){return myconv(next(),1);} function nextStrArray(){return myconv(next(),2);} function nextIntArray(){return myconv(next(),4);} function nextCharArray(){return myconv(next(),6);} function next(){return obj.next();} function hasNext(){return obj.hasNext();} function init(input){ return { list : input, index : 0, max : input.length, hasNext : function(){return (this.index < this.max);}, next : function(){if(this.hasNext()){return this.list[this.index++];}else{throw 'ArrayIndexOutOfBoundsException ‚There is no more input';}} }; } function myout(s){console.log(s);} function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));} //param "no" is //unknown or outlier : return i. 1: parseInt. //2: split space. 4: split space and parseInt. //6: split 1 character. 7: split 1 character and parseInt. //8: join space. 9: join nextline. 0: join no character. function myconv(i,no){try{switch(no){case 1:return parseInt(i);case 2:return i.split(' ');case 4:return i.split(' ').map(Number);case 6:return i.split('');case 7:return i.split('').map(Number);case 8:return i.join(' ');case 9:return i.join('\n');case 0:return i.join('');default:return i;}}catch(e){return i;}} //Don't have to see. end------------------------------------------ function Main(){ var one = nextIntArray(); var H = one[0]; var W = one[1]; var list = new Array(H); for(var i = 0; i < H; i++){ var tmp = nextStrArray(); list[i] = new Array(W); for(var j = 0; j < W; j++){ list[i][j] = (tmp[j] == "1") ? true : false; } } var count = 0; var dy = [-1,0,1,0]; var dx = [0,-1,0,1]; for(var i = 0; i < H; i++){ for(var j = 0; j < W; j++){ if(list[i][j]){ bfs(i,j); count++; } } } list = null; myout(count); function bfs(y,x){ var queue = [[y,x]]; list[y][x] = false; while(queue.length > 0){ var tmp = queue.shift(); for(var i = 0; i < 4; i++){ var nextY = tmp[0] + dy[i]; var nextX = tmp[1] + dx[i]; if(nextY >= 0 && nextY < H && nextX >= 0 && nextX < W){ if(list[nextY][nextX]){ queue.push([nextY,nextX]); list[nextY][nextX] = false; } } } } } }