結果
| 問題 |
No.1412 Super Ryuo
|
| コンテスト | |
| ユーザー |
watarimaycry2
|
| 提出日時 | 2021-02-28 21:24:34 |
| 言語 | JavaScript (node v23.5.0) |
| 結果 |
AC
|
| 実行時間 | 77 ms / 2,000 ms |
| コード長 | 2,745 bytes |
| コンパイル時間 | 48 ms |
| コンパイル使用メモリ | 6,816 KB |
| 実行使用メモリ | 40,320 KB |
| 最終ジャッジ日時 | 2024-10-02 22:04:29 |
| 合計ジャッジ時間 | 3,140 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 14 |
ソースコード
//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{
ret[i] = next();
}
}
return ret;
}
function nextIntArray(size){return nextArray(size, 'int');} function nextStrArray(size){return nextArray(size, 'str');}
function nextCharArray(){return myconv(next(),6);}
function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);}
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 A = nextInt();
var B = nextInt();
var C = nextInt();
var D = nextInt();
if(A == C && B == D){
myout(0);
return;
}
var d = [[-1,-2],[-1,-1],[-2,-1], [1,-2],[1,-1],[2,-1],
[-1,2],[-1,1],[-2,1], [1,2],[1,1],[2,1]];
for(var i = 0; i < d.length; i++){
var nextX = A + d[i][0];
var nextY = B + d[i][1];
if(C == nextX && D == nextY){
myout(1);
return;
}
}
if(A == C || B == D){
myout(1);
}else{
myout(2);
}
}
watarimaycry2