結果

問題 No.1439 Let's Compare!!!!
コンテスト
ユーザー watarimaycry2
提出日時 2021-03-26 21:45:07
言語 JavaScript
(node v23.5.0)
結果
TLE  
実行時間 -
コード長 3,793 bytes
コンパイル時間 186 ms
コンパイル使用メモリ 6,820 KB
実行使用メモリ 142,128 KB
最終ジャッジ日時 2024-11-28 22:32:06
合計ジャッジ時間 33,033 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 8 TLE * 9
権限があれば一括ダウンロードができます

ソースコード

diff # 

//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 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 S = nextCharArray();
	var T = nextCharArray();
	var index = 0;
	var b = "=";
	for(var i = 0; i < N; i++){
		if(S[i] != T[i]){
			index = i;
			if(myconv(S[i], 1) > myconv(T[i], 1)){
				b = ">";
			}else{
				b = "<";
			}
			break;
		}
	}
	if(b == "="){
		index = N - 1;
	}
	var Q = nextInt();
	for(var i = 0; i < Q; i++){
		var ci = next();
		var xi = nextInt() - 1;
		var yi = nextInt();
		if(ci == "S"){
			if(S[xi] == yi){
				myout(b);
				continue;
			}else{
				S[xi] = yi;
			}
		}else{
			if(T[xi] == yi){
				myout(b);
				continue;
			}else{
				T[xi] = yi;
			}
		}
		var tmpS = myconv(S, 0);
		var tmpT = myconv(T, 0);
		if(xi == index){
			if(myconv(S[xi], 1) > myconv(T[xi], 1)){
				b = ">";
			}else if(myconv(S[xi], 1) < myconv(T[xi], 1)){
				b = "<";
			}else{
				b = "=";
				for(var j = xi + 1; j < N; j++){
					if(S[j] != T[j]){
						index = j;
						if(myconv(S[j], 1) > myconv(T[j], 1)){
							b = ">";
						}else{
							b = "<";
						}
						break;
					}
				}
				if(b == "="){
					index = N - 1;
				}
			}
			myout(b);
			continue;
		}
		if(index < xi){
			myout(b);
		}else{
			if(myconv(S[xi], 1) > myconv(T[xi], 1)){
				b = ">";
				index = xi;
			}else if(myconv(S[xi], 1) < myconv(T[xi], 1)){
				b = "<";
				index = xi;
			}
			myout(b);
		}
	}
}
0