結果
問題 | No.2063 ±2^k operations (easy) |
ユーザー |
![]() |
提出日時 | 2022-09-02 21:32:08 |
言語 | JavaScript (node v23.5.0) |
結果 |
AC
|
実行時間 | 157 ms / 2,000 ms |
コード長 | 3,184 bytes |
コンパイル時間 | 116 ms |
コンパイル使用メモリ | 5,248 KB |
実行使用メモリ | 44,800 KB |
最終ジャッジ日時 | 2024-11-16 02:27:29 |
合計ジャッジ時間 | 5,423 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 21 |
ソースコード
//Don't have to see. start------------------------------------------var read = require('readline').createInterface({input: process.stdin, output: process.stdout});var obj; var inLine = []; var outputList = [];var retcode = new Set();read.on('line', function(input){var tmp = input.split(' ');for(var i = 0; i < tmp.length; i++){inLine.push(tmp[i]);if(i == tmp.length - 1){retcode.add(inLine.length);}}});read.on('close', function(){obj = init(inLine);console.error('\n↑入力 ↓出力');Main();console.log(myconv(outputList, 9));});function makeClone(obj){return (obj instanceof Set) ? new Set(Array.from(obj)) : JSON.parse(JSON.stringify(obj));}function nextArray(size, code){var ret = new Array(size);for(var i = 0; i < size; i++){if(code == 'int'){ret[i] = nextInt();}else if(code == 'long'){ret[i] = nextLong();}else if(code == 'double'){ret[i] = nextDouble();}else{ret[i] = next();}}return ret;}function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');} function nextLongArray(size){return nextArray(size, 'long');} function nextDoubleArray(size){return nextArray(size, 'double');}function nextCharArray(){return myconv(next(),6);}function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);} function nextLong(){returnBigInt(next());} function nextDouble(){return parseFloat(next());}function getCountMap(list){var map = {};for(var i = 0; i < list.length; i++){if(map[list[i]] == null){map[list[i]] = 0;}map[list[i]]++;}return map;}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';}},isReturn : function(){return retcode.has(this.index);}};}function myout(s){outputList.push(s);}function myerr(s){console.error('debug:' + require('util').inspect(s,false,null));}function isReturn(){return obj.isReturn();}//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 S = next();var c = 0;for(var i = 0; i < S.length; i++){c += myconv(S[i], 1);}if(c == 2){myout("Yes");return;}else if(c == 1){myout("No");return;}var one = false;var zero = false;for(var i = 0; i < S.length; i++){if(S[i] == "1"){one = true;if(zero){myout("No");return;}}else{zero = true;}}myout("Yes");}