P1498 南蛮图腾

// Problem: P1498 南蛮图腾
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/P1498
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// User: Pannnn
#include <bits/stdc++.h>
using namespace std;
template<class T>
void debugVector(const T &a) {
cout << "[ ";
for (size_t i = 0; i < a.size(); ++i) {
cout << a[i] << (i == a.size() - 1 ? " " : ", ");
}
cout << "]" << endl;
}
template<class T>
void debugMatrix2(const T &a) {
for (size_t i = 0; i < a.size(); ++i) {
debugVector(a[i]);
}
}
template<class T>
using matrix2 = vector<vector<T>>;
template<class T>
vector<vector<T>> getMatrix2(size_t n, size_t m, T init = T()) {
return vector<vector<T>>(n, vector<T>(m, init));
}
template<class T>
using matrix3 = vector<vector<vector<T>>>;
template<class T>
vector<vector<vector<T>>> getMatrix3(size_t x, size_t y, size_t z, T init = T()) {
return vector<vector<vector<T>>>(x, vector<vector<T>>(y, vector<T>(z, init)));
}
vector<int> genBigInteger(string a) {
vector<int> res;
for (int i = a.size() - 1; i >= 0; --i) {
res.push_back(a[i] - '0');
}
return res;
}
void printBigInteger(vector<int> a) {
for (size_t i = a.size() - 1; i >= 0; --i) {
cout << a[i];
}
}
vector<int> addBigInteger(vector<int> a, vector<int> b) {
vector<int> res;
int pre = 0;
for (size_t i = 0; i < a.size() || i < b.size() || pre; ++i) {
if (i < a.size()) pre += a[i];
if (i < b.size()) pre += b[i];
res.push_back(pre % 10);
pre /= 10;
}
return res;
}
void nextPic(matrix2<char> &info) {
matrix2<char> tmp = getMatrix2(info.size(), info[0].size(), ' ');
for (int i = 0; i < info.size(); ++i) {
tmp[i].insert(tmp[i].begin() + tmp[i].size() / 2, info[i].begin(), info[i].end());
vector<char> t(info[i]);
info[i].insert(info[i].end(), t.begin(), t.end());
// debugVector(tmp[i]);
}
info.insert(info.end(), tmp.begin(), tmp.end());
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// 原始图案倒序存储
// 每次向右复制一个,向下复制一个
// 最后倒序输出
matrix2<char> res = getMatrix2<char>(2, 4);
res[0] = {'/', '_', '_', '\\'};
res[1] = {' ', '/', '\\', ' '};
int n;
cin >> n;
while (--n) {
nextPic(res);
}
for (int i = res.size() - 1; i >= 0; --i) {
for (int j = 0; j < res[i].size(); ++j) {
cout << res[i][j];
}
cout << endl;
}
// debugVector(res[1]);
return 0;
}
posted @   Pannnn  阅读(56)  评论(0编辑  收藏  举报
相关博文:
阅读排行:
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
· 【自荐】一款简洁、开源的在线白板工具 Drawnix
· 园子的第一款AI主题卫衣上架——"HELLO! HOW CAN I ASSIST YOU TODAY
· Docker 太简单,K8s 太复杂?w7panel 让容器管理更轻松!
-->
点击右上角即可分享
微信分享提示