【CCF CSP 201909-3 字符画 C++ 100分】

 

试题编号:201909-3
试题名称:字符画
时间限制:5.0s
内存限制:512.0MB

题意描述模糊,坑题。

思路:正常模拟,核心函数是calc_avg_rgb(),逻辑理顺即可。

 

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int m, n, p, q, num_pixel_blocks;
vector <string> vec_pixels;
vector <int> current_state(3, 0), zero_rgb(3, 0);
vector <vector <int> > vec_avg_block_rgb;
string res = "", reset_sequence = "\\x1B\\x5B\\x30\\x6D";

void get_input() {
	string tmp_str, ipt;
	cin >> m >> n;
	cin >> p >> q;
	num_pixel_blocks = (m * n) / (p * q);
	for (int i = 0; i < num_pixel_blocks; i++) {
		vec_avg_block_rgb.push_back(zero_rgb);
	}
	for (int j = 0; j < m * n; j++) {
		tmp_str = "";
		cin >> ipt;
		vec_pixels.push_back(ipt.substr(1, ipt.length()));
		if (vec_pixels.back().length() == 3) {
			for (auto ch : vec_pixels.back()) {
				tmp_str += ch;
				tmp_str += ch;
			}
			vec_pixels.back() = tmp_str;
		}
		if (vec_pixels.back().length() == 1) {
			for (int k = 0; k < 5; k++) {
				vec_pixels.back() += vec_pixels.back()[0];
			}
		}
	}
}

void calc_avg_rgb() {
	vector <vector <string> > matrix_pixels(n);
	for (int i = 0; i < n; i++) {
		for (int j = i * m; j < (i + 1) * m; j++) {
			matrix_pixels[i].push_back(vec_pixels[j]);
		}
	}
	for (int row = 0; row < n; row++) {
		for (int col = 0; col < m; col++) {
			vec_avg_block_rgb[(row / q) * (m / p) + col / p][0] += stoi(matrix_pixels[row][col].substr(0, 2), nullptr, 16);
			vec_avg_block_rgb[(row / q) * (m / p) + col / p][1] += stoi(matrix_pixels[row][col].substr(2, 2), nullptr, 16);
			vec_avg_block_rgb[(row / q) * (m / p) + col / p][2] += stoi(matrix_pixels[row][col].substr(4, 2), nullptr, 16);
		}
	}
	for (int i = 0; i < (int)vec_avg_block_rgb.size(); i++) {
		for (int j = 0; j < (int)vec_avg_block_rgb[i].size(); j++) {
			vec_avg_block_rgb[i][j] = (int)(vec_avg_block_rgb[i][j] / (p * q));
		}
	}
}

string generate_sequence(vector <int> rgb) {
	char hex_value[10];
	string sequence_str = "[48;2;" + to_string(rgb[0]) + ';' + to_string(rgb[1]) + ';' + to_string(rgb[2]) + "m ";
	string sequence_str_hex = "\\x1B";
	for (char ch : sequence_str) {
		sprintf(hex_value, "%X", (int)ch);
		sequence_str_hex += ("\\x" + string(hex_value));
	}
	return sequence_str_hex;
}

/* check if the current color of terminal is set to default when one line ends */
void additional_procedure(int idx) {
	if ((idx + 1) % (m / p) == 0) {
		if (vec_avg_block_rgb[idx] != zero_rgb) {
			res += reset_sequence;
			current_state = zero_rgb;
		}
		res += "\\x0A";
	}
}

int main() {
	get_input();
	calc_avg_rgb();
	for (int i = 0; i < (int)vec_avg_block_rgb.size(); i++) {
		if (vec_avg_block_rgb[i] == current_state) {
			res += "\\x20";
			additional_procedure(i);
			continue;
		}
		if (vec_avg_block_rgb[i] == zero_rgb) {
			res += (reset_sequence + "\\x20");
			current_state = zero_rgb;
		}
		else {
			res += generate_sequence(vec_avg_block_rgb[i]);
			current_state = vec_avg_block_rgb[i];
		}
		additional_procedure(i);
	}
	cout << res;
	return 0;
}

 

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值