結果
問題 | No.1367 文字列門松 |
ユーザー |
![]() |
提出日時 | 2021-01-29 21:55:46 |
言語 | JavaScript (node v23.5.0) |
結果 |
AC
|
実行時間 | 82 ms / 2,000 ms |
コード長 | 3,206 bytes |
コンパイル時間 | 207 ms |
コンパイル使用メモリ | 5,504 KB |
実行使用メモリ | 40,320 KB |
最終ジャッジ日時 | 2024-06-27 08:09:25 |
合計ジャッジ時間 | 4,548 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 27 |
ソースコード
//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 s = next();var map = {k : 0,a1 : 1,d : 2,o : 3,m : 4,a2 : 5,t : 6,s : 7,u : 8};var lastIndex = -1;for(var i = 0; i < s.length; i++){if(s[i] == "a"){if(map.a1 != -1){if(lastIndex < map.a1){lastIndex = map.a1;map.a1 = -1;}else if(lastIndex < map.a2){lastIndex = map.a2;map.a1 = -1;map.a2 = -1;}else{myout("No");return;}}else if(map.a2 != -1){if(lastIndex < map.a2){lastIndex = map.a2;map.a2 = -1;}else{myout("No");return;}}else{myout("No");return;}}else if(map[s[i]] == null){myout("No");return;}else{if(map[s[i]] != -1){if(lastIndex < map[s[i]]){lastIndex = map[s[i]];map[s[i]] = -1;}else{myout("No");return;}}else{myout("No");return;}}}myout("Yes");}