結果

問題 No.1279 Array Battle
ユーザー watarimaycry2watarimaycry2
提出日時 2020-11-06 21:36:29
言語 JavaScript
(node v21.7.1)
結果
AC  
実行時間 1,287 ms / 2,000 ms
コード長 2,396 bytes
コンパイル時間 42 ms
コンパイル使用メモリ 5,212 KB
実行使用メモリ 47,868 KB
最終ジャッジ日時 2023-09-29 18:20:50
合計ジャッジ時間 9,577 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 83 ms
42,600 KB
testcase_01 AC 84 ms
44,416 KB
testcase_02 AC 84 ms
42,484 KB
testcase_03 AC 83 ms
42,496 KB
testcase_04 AC 84 ms
42,712 KB
testcase_05 AC 84 ms
42,384 KB
testcase_06 AC 83 ms
42,528 KB
testcase_07 AC 84 ms
44,220 KB
testcase_08 AC 84 ms
42,568 KB
testcase_09 AC 85 ms
42,976 KB
testcase_10 AC 85 ms
42,732 KB
testcase_11 AC 96 ms
47,084 KB
testcase_12 AC 118 ms
47,580 KB
testcase_13 AC 299 ms
47,564 KB
testcase_14 AC 299 ms
47,380 KB
testcase_15 AC 1,209 ms
47,124 KB
testcase_16 AC 1,206 ms
47,080 KB
testcase_17 AC 1,284 ms
47,868 KB
testcase_18 AC 1,287 ms
47,620 KB
testcase_19 AC 1,283 ms
47,736 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

//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 N = nextInt();
	var alist = nextIntArray();
	var blist = nextIntArray();
	var output = 0;
	var map = {};
	dfs([]);
	//myerr(map);
	var sums = Object.keys(map);
	sums.sort(function(a,b){
		return b - a;
	});
	myout(map[sums[0]]);
	function dfs(used){
		if(used.length == N){
			var sum = 0;
			for(var i = 0; i < N; i++){
				if(alist[used[i]] > blist[i]){
					sum += alist[used[i]] - blist[i];
				}
			}
			if(map[sum] == null){
				map[sum] = 0;
			}
			map[sum]++;
			return;
		}
		for(var i = 0; i < N; i++){
			if(used.indexOf(i) == -1){
				var tmp = makeClone(used);
				tmp.push(i);
				dfs(tmp);
			}
		}
	}
}
0