字符菱形

状态	递交者	时间	内存	语言	代码	递交时间
AC	繁星 (05c35-zzm)	13ms	392 KiB		294 Bytes	2022-8-18 11:23:46
AC	wangshuo	14ms	384 KiB		243 Bytes	2022-9-16 20:02:41
AC	chen (peter)	14ms	392 KiB		201 Bytes	2022-3-6 20:59:31
AC	zzzrrrxxx	14ms	7.1 MiB	C++98	212 Bytes	2024-6-16 14:41:54
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	432 KiB		236 Bytes	2022-6-23 20:28:25
AC	疯神芭芭脱丝 (李卓修)	14ms	396 KiB		256 Bytes	2022-1-21 17:49:33
AC	qwertyuiop	14ms	384 KiB		263 Bytes	2022-2-18 19:54:34
AC	旷山 (15213268688)	14ms	440 KiB		370 Bytes	2022-2-11 16:57:11
AC	呵呵呵 (陈思琦)	14ms	384 KiB		208 Bytes	2022-8-31 19:28:05
AC	田雨杨 (tianyuyang23010)	14ms	7.2 MiB	C++98	254 Bytes	2024-5-10 20:22:46
AC	靳博然 (jbr)	14ms	384 KiB		233 Bytes	2023-2-26 16:28:59
AC	任童(rentong)	14ms	384 KiB		296 Bytes	2022-3-19 16:19:49
AC	嗨害嗨 (CQ01_XYZ)	14ms	416 KiB		233 Bytes	2022-4-19 18:53:01
AC	呵呵呵 (陈思琦)	14ms	440 KiB		208 Bytes	2022-8-31 19:28:04
AC	嘉宝 (王淳恺)	14ms	6.7 MiB	C++98	255 Bytes	2024-8-2 10:23:29
AC	曾子墨	14ms	428 KiB		282 Bytes	2022-9-3 16:42:38
AC	ycy	14ms	448 KiB		281 Bytes	2022-4-23 16:03:42
AC	陈雨泽1	14ms	7 MiB	C++98	244 Bytes	2024-5-24 22:02:28
AC	潘佑实	14ms	428 KiB		236 Bytes	2023-2-19 16:42:47
AC	疯神芭芭脱丝 (李卓修)	14ms	444 KiB		245 Bytes	2022-6-10 6:42:15
AC	时代一校-王宥量 (wangyouliang)	14ms	512 KiB		213 Bytes	2022-9-14 20:56:35
AC	(05c35-cyd)	14ms	384 KiB		243 Bytes	2022-4-3 17:43:39
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	14ms	384 KiB		241 Bytes	2022-2-15 20:35:45
AC	qwq	14ms	384 KiB		272 Bytes	2022-7-4 19:05:15
AC	胡程禹	14ms	6.8 MiB	C++20	259 Bytes	2024-5-25 18:20:05
AC	谢靳骁 (XJX)	14ms	392 KiB		218 Bytes	2023-5-19 18:12:48
AC	朱柯羽	14ms	384 KiB		265 Bytes	2022-9-10 14:48:07
AC	胡熙景	14ms	512 KiB		265 Bytes	2022-9-8 21:36:10
AC	李树崑 (lishukun)	14ms	384 KiB		278 Bytes	2022-1-24 15:31:10
AC	李艾芯 (starry sky)	14ms	392 KiB		246 Bytes	2022-2-25 18:04:37
AC	马渝杭 (mayuhang)	14ms	448 KiB		224 Bytes	2022-8-20 12:40:48
AC	陌生人 (涂玉龙)	14ms	7.2 MiB	C++11	221 Bytes	2024-5-5 17:41:39
AC	(05c35-cyd)	14ms	436 KiB		255 Bytes	2022-3-10 18:26:10
AC	tad (OP AI)	14ms	6.9 MiB	C++98	331 Bytes	2024-6-9 19:03:55
AC	wangjunhan	14ms	512 KiB		254 Bytes	2022-6-29 18:43:41
AC	yangbinyu	14ms	512 KiB		222 Bytes	2022-8-31 21:51:39
AC	我很6 (zjj22031)	14ms	400 KiB		234 Bytes	2022-12-2 13:51:24
AC	朱老师 (zyp)	14ms	432 KiB		304 Bytes	2022-7-25 16:45:40
AC	向南地	14ms	512 KiB		219 Bytes	2022-2-19 9:40:20
AC	xiangsiyu	14ms	392 KiB		223 Bytes	2022-6-21 20:40:43
AC	新壹街-王俊博 (王俊博)	14ms	7 MiB	C++98	216 Bytes	2024-6-7 21:31:09
AC	炼狱杏寿郎（的粉粉粉粉粉） (sheijiangwohh)	14ms	420 KiB		330 Bytes	2022-3-2 17:50:43
AC	(05c35-cyd)	14ms	384 KiB		243 Bytes	2022-4-3 17:43:38
AC	songbingqi	14ms	7 MiB	C++11	246 Bytes	2024-5-30 19:37:25
AC	李山水	14ms	384 KiB		279 Bytes	2022-1-29 13:08:03
AC	李某人	14ms	400 KiB		259 Bytes	2022-1-25 18:31:12
AC	何煜琦	14ms	6.7 MiB	C++11	169 Bytes	2024-8-2 14:27:04
AC	李树崑 (lishukun)	14ms	384 KiB		278 Bytes	2022-3-19 15:22:42
AC	xzf	14ms	7 MiB	C++98	232 Bytes	2024-8-24 18:16:06
AC	U城校区-邓皓月 (邓皓月)	14ms	6.8 MiB	C++98	262 Bytes	2024-6-2 9:21:39
AC	高致远 (GZY)	14ms	444 KiB		224 Bytes	2022-7-6 14:08:29
AC	xuaonan	14ms	384 KiB		215 Bytes	2022-2-20 13:04:24
AC	彭崇鑫	14ms	392 KiB		238 Bytes	2022-8-31 19:32:21
AC	chaikexu	14ms	428 KiB		286 Bytes	2022-11-15 13:04:21
AC	_daa	14ms	412 KiB		234 Bytes	2022-3-9 21:25:17
AC	程子杰 (05c41-czj)	14ms	424 KiB		253 Bytes	2022-7-27 10:30:14
AC	05c41-hzs	14ms	384 KiB		251 Bytes	2022-3-13 11:03:39
AC	胡熙景	14ms	544 KiB		254 Bytes	2022-9-4 10:28:54
AC	史韵哲	14ms	436 KiB		228 Bytes	2023-3-5 12:03:25
AC	hulang	14ms	444 KiB		281 Bytes	2022-4-16 20:23:47
AC	wzzjnb2012	14ms	512 KiB		269 Bytes	2022-9-21 16:42:30
AC	赵鑫宸 (xiaoxiao721)	14ms	432 KiB		244 Bytes	2022-2-19 22:53:24
AC	wky	14ms	384 KiB		260 Bytes	2022-4-10 18:16:12
AC	陈奕瑾 (shenxiulinyue)	14ms	440 KiB		237 Bytes	2022-4-26 21:39:05
AC	cainuoyan	14ms	7.2 MiB	C++98	206 Bytes	2024-4-21 10:23:10
AC	冒牌陈杰晟【MOD】 (wed)	14ms	384 KiB		196 Bytes	2022-2-25 17:09:57
AC	杨瀚霖 (yanghanlin)	14ms	392 KiB		233 Bytes	2022-11-26 10:38:25
AC	heyi	14ms	6.8 MiB	C++98(O2)	232 Bytes	2024-8-6 14:48:37
AC	手搓STL stack 双向无环链表 _ 向量 2种实现方式: template <typename Map_Type> class Stack_l /* Stack _ List / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }Data; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }; public: unsigned int size(void) { return Data.List_Size; } Map_Type& top(void) { return Data.endp -> Node_Data; } void data(void) { return &Data; } bool empty(void) { return !((bool)Data.headp); } Stack_l<Map_Type>& push(Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type& push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(Map_Type* push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& push(const Map_Type push_data) { Node nodep = new Node(); nodep -> lastp = Data.endp; if (!Data.headp) { Data.headp = nodep; Data.endp = nodep; } else Data.endp -> nextp = nodep; Data.endp = nodep; nodep -> Node_Data = (Map_Type)push_data; ++Data.List_Size; return this; } Stack_l<Map_Type>& pop(void) { if (Data.headp) { if (Data.List_Size == 1u) { delete Data.headp; Data.List_Size = 0; Data.headp = 0; Data.endp = 0; } else { Data.endp = Data.endp -> lastp; delete Data.endp -> nextp; Data.endp -> nextp = 0; --Data.List_Size; } } return this; } Stack_l<Map_Type>& clear(void) { while (Data.List_Size) { pop(); } return this; } Stack_l<Map_Type>(void) { /* NULL / } Stack_l<Map_Type>(unsigned int data_size, Map_Type map_data) { Data.List_Size = data_size; while (data_size--) { Node nodep = new Node(); nodep -> Node_Data = map_data; if (Data.headp) { nodep -> lastp = Data.endp; Data.endp -> nextp = nodep; Data.endp = nodep; } else { Data.headp = nodep; Data.endp = nodep; } } } Stack_l<Map_Type>(Stack_l<Map_Type>& map_data) { if (!map_data.empty()) { List_Data listp = (List_Data)map_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; } } Stack_l<Map_Type>& operator=(Stack_l<Map_Type>& copy_data) { if (copy_data.empty()) return this; List_Data listp = (List_Data)copy_data.data(); Node nodep = listp -> headp, newp; for (unsigned int i = 0; i != listp -> List_Size; ++i, nodep = nodep -> nextp) { newp = new Node(); newp -> Node_Data = nodep -> Node_Data; if (Data.headp) { newp -> lastp = Data.endp; Data.endp -> nextp = newp; Data.endp = newp; } else { Data.headp = newp; Data.endp = newp; } } Data.List_Size = listp -> List_Size; return this; } bool operator==(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() != Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return true; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return false; } return true; } bool operator!=(Stack_l<Map_Type>& cmp_data) { if (cmp_data.size() == Data.List_Size) return false; else if (cmp_data.empty() && (!Data.List_Size)) return false; Node nodep1 = Data.headp, nodep2 = ((List_Data)cmp_data.data()) ->headp; for (unsigned int i = 0; i != Data.List_Size; ++i, nodep1 = nodep1 -> nextp, nodep2 = nodep2 ->nextp) { if (nodep1 -> Node_Data != nodep2 -> Node_Data) return true; } return true; } ~Stack_l<Map_Type>(void) { clear(); } }; /* Stack _ List / template <typename Map_Type> class Stack_v / Stack _ Vector / { private: struct Node { Map_Type Node_Data; Node nextp, lastp; Node(void) { nextp = 0; lastp = 0; } }; struct List_Data { unsigned int List_Size; Node headp, endp; List_Data(void) { List_Size = 0; headp = 0; endp = 0; } }; struct Vector_Data { Map_Type headp, lastp, endp; void resize(unsigned int data_size) { Map_Type newp = new Map_Type[data_size](); endp = newp + data_size - 1; lastp = newp + (data_size > lastp - headp ? lastp - headp : data_size); if (headp) delete[] headp; headp = newp; } Vector_Data(void) { headp = 0; lastp = 0; endp = 0; } }Data; public: unsigned int size(void) { return Data.lastp - Data.headp; } Map_Type& top(void) { return (Data.lastp - 1); } void* data(void) { return &Data; } bool full(void) { if (!Data.headp) return true; return Data.endp + 1 == Data.lastp; } bool empty(void) { if (!Data.headp) return true; return Data.headp == Data.lastp; } Stack_v<Map_Type>& push(Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type& push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(Map_Type* push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& push(const Map_Type push_data) { if (full()) Data.resize((unsigned int)((Data.lastp - Data.headp) * 1.5) + 1); Data.lastp = (Map_Type)push_data; ++Data.lastp; return this; } Stack_v<Map_Type>& pop(void) { if (empty()) { if (Data.lastp - Data.headp > 1) Data.resize((Data.lastp - Data.headp) >> 1); else return this; } else --Data.lastp; return this; } Stack_v<Map_Type>(void) { /* NULL / } Stack_v<Map_Type>(unsigned int data_size, Map_Type map_data) { while (data_size) { push(&map_data); --data_size; } } Stack_v<Map_Type>(Stack_v<Map_Type>& map_data) { Vector_Data datap = (Vector_Data)map_data.data(); for (unsigned int i = 0, k = map_data.size(); i != k; ++i) push(datap -> headp + i); } Stack_v<Map_Type>& operator=(Stack_v<Map_Type>& copy_data) { if (copy_data.empty()) clear(); else { Vector_Data datap = (Vector_Data)copy_data.data(); for (unsigned int i = 0, k = copy_data.size(); i != k; ++i) push(datap -> headp + i); } return this; } bool operator==(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return false; else if (empty() && cmp_data.empty()) return true; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap ->headp + i)) return false; } return true; } bool operator!=(Stack_v<Map_Type>& cmp_data) { if (size() != cmp_data.size()) return true; else if (empty() && cmp_data.empty()) return false; Vector_Data datap = (Vector_Data)cmp_data.data(); for (unsigned int i = 0, k = size(); i != k; ++i) { if ((Data.headp + i) != (datap -> headp + i)) return true; } return false; } Stack_v<Map_Type>& clear(void) { delete[] Data.headp; Data.headp = 0; Data.lastp = 0; Data.endp = 0; return this; } ~Stack_v<Map_Type>(void) { delete[] Data.headp; } }; / Stack _ Vector */ int main(void) { return 0; } (22029-xys)	14ms	440 KiB		333 Bytes	2022-11-30 18:48:31
AC	梦之泪伤	14ms	496 KiB		243 Bytes	2022-2-11 22:16:28
AC	PYMcn	14ms	7 MiB	C++11(O2)	288 Bytes	2024-5-25 18:28:53
AC	田雨杨 (tianyuyang23010)	14ms	7.2 MiB	C++98	254 Bytes	2024-5-10 20:22:52
AC	yixingyou	14ms	384 KiB		254 Bytes	2022-8-31 19:39:38
AC	新壹街——陈学彬 (BUG)	14ms	412 KiB		208 Bytes	2022-3-5 15:21:55
AC	何洋名 (heyangming)	14ms	512 KiB		222 Bytes	2022-3-11 19:13:15
AC	新壹街校区-吴鑫鹏 (吴鑫鹏)	14ms	384 KiB		279 Bytes	2022-12-2 20:31:20
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	14ms	6.6 MiB	C++98	195 Bytes	2024-7-29 15:09:08
AC	田信 (tianxincn1)	14ms	512 KiB		234 Bytes	2022-2-18 17:08:10
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	14ms	392 KiB		181 Bytes	2022-3-18 21:29:51
AC	l;k (陈彬宾)	14ms	392 KiB		221 Bytes	2022-4-9 18:50:38
AC	金沙校区-蓝祥与 (蓝祥与)	14ms	512 KiB		244 Bytes	2022-9-21 20:07:56
AC	. (Pig)	14ms	532 KiB		218 Bytes	2022-3-16 18:33:46
AC	林小博	14ms	436 KiB		233 Bytes	2022-7-1 9:01:32
AC	yanyuhan	14ms	6.4 MiB	C++98	253 Bytes	2024-7-4 19:35:27
AC	诸禹吉 (zhuyuji)	14ms	392 KiB		295 Bytes	2022-3-13 20:51:59
AC	lch (凌昌瀚)	14ms	432 KiB		201 Bytes	2022-4-23 9:05:12
AC	张子扬	14ms	512 KiB		272 Bytes	2022-2-28 12:26:03
AC	李彦臻	14ms	7.2 MiB	C++98	217 Bytes	2024-4-21 9:53:53
AC	谭懿轩 (yanyixuan)	14ms	384 KiB		242 Bytes	2022-1-16 16:18:56
AC	(05c35-cyd)	14ms	444 KiB		243 Bytes	2022-4-3 17:43:39
AC	缥 (王硕2012)	14ms	512 KiB		262 Bytes	2022-11-20 20:48:30
AC	王涵熙 (水煮大肠)	14ms	436 KiB		227 Bytes	2022-4-9 16:50:13
AC	luosifu22006	14ms	512 KiB		237 Bytes	2022-8-20 16:42:49
AC	宋坤霖	14ms	7 MiB	C++11	257 Bytes	2024-6-8 13:12:10
AC	余龙恩 (小码君)	14ms	436 KiB		227 Bytes	2022-8-14 11:24:47
AC	SHY20091224	14ms	512 KiB		209 Bytes	2022-8-15 15:48:03
AC	何星震 (Jacob)	14ms	452 KiB		219 Bytes	2023-2-17 20:13:46
AC	罗翌珂 (dangdang)	14ms	440 KiB		288 Bytes	2022-8-13 11:14:24
AC	陈杰晟	14ms	512 KiB		237 Bytes	2022-2-17 15:32:35
AC	杜俊宏	14ms	444 KiB		243 Bytes	2022-3-12 17:20:56