結果
問題 | No.1673 Lamps on a line |
ユーザー | watarimaycry2 |
提出日時 | 2021-09-10 23:25:18 |
言語 | JavaScript (node v21.7.1) |
結果 |
AC
|
実行時間 | 361 ms / 2,000 ms |
コード長 | 2,956 bytes |
コンパイル時間 | 88 ms |
コンパイル使用メモリ | 6,948 KB |
実行使用メモリ | 73,204 KB |
最終ジャッジ日時 | 2024-06-12 04:19:05 |
合計ジャッジ時間 | 4,274 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
40,192 KB |
testcase_01 | AC | 72 ms
42,196 KB |
testcase_02 | AC | 238 ms
55,320 KB |
testcase_03 | AC | 194 ms
59,804 KB |
testcase_04 | AC | 266 ms
63,564 KB |
testcase_05 | AC | 102 ms
46,952 KB |
testcase_06 | AC | 243 ms
63,924 KB |
testcase_07 | AC | 265 ms
63,884 KB |
testcase_08 | AC | 80 ms
42,624 KB |
testcase_09 | AC | 326 ms
73,204 KB |
testcase_10 | AC | 343 ms
73,080 KB |
testcase_11 | AC | 121 ms
51,544 KB |
testcase_12 | AC | 361 ms
71,496 KB |
ソースコード
//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] = BigInt(next()); }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 nextCharArray(){return myconv(next(),6);} function next(){return obj.next();} function hasNext(){return obj.hasNext();} function nextInt(){return myconv(next(),1);} function nextLong(){return BigInt(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 N = nextInt(); var Q = nextInt(); var list = new Array(N + 1).fill(0); var output = 0; for(var i = 0; i < Q; i++){ var L = nextInt(); var R = nextInt(); for(var j = L; j <= R; j++){ if(list[j] == 0){ list[j] = 1; output++; }else{ list[j] = 0; output--; } } myout(output); } }