CCF CSP 201909-3 字符画

调试字符串模拟的代码可 太虚了。。

#include <bits/stdc++.h>
using namespace std;
const string ESC(1, char(27));
int n, m, p, q;
struct node{
	int r, g, b;
	bool operator!=(const node &y)const
	{
		return r != y.r || g != y.g || b != y.b;
	}
}RGB[2000][2000];

int dec(string s)
{
	int res = 0;
	for(int i = 0; i < s.size(); ++i)
	{
		char c = tolower(s[i]);
		if(isalpha(c)) res = res * 16 + c - 'a' + 10;
		else res = res * 16 + c - '0';
	}
	return res;
}
void deal(int x,int y,string s)
{
	if(s.size() == 1) s = string(6, s[0]);
	else if(s.size() == 3) s = string(2, s[0]) + string(2, s[1]) + string(2, s[2]);
	int r, g, b;
	r = dec(s.substr(0, 2));
	g = dec(s.substr(2, 2));
	b = dec(s.substr(4, 2)); 
	RGB[x][y] = {r, g, b};
	//printf("%d %d %d\n", r, g, b);
}

void print(string s)
{
	for(int i = 0; i < s.size(); ++i) cout <&