输出文字

状态	递交者	时间	内存	语言	代码	递交时间
AC	偽艺術家 (chenyanchi22006)	1ms	384 KiB		115 Bytes	2022-6-19 18:08:08
AC	钟元朗	1ms	384 KiB		97 Bytes	2022-9-3 20:11:26
AC	小忙果 (王昱杰)	1ms	384 KiB		111 Bytes	2023-2-7 19:16:16
AC	李树崑 (lishukun)	1ms	384 KiB		118 Bytes	2022-4-19 18:21:14
AC	ren (陈苡心)	1ms	384 KiB		114 Bytes	2023-5-7 15:35:56
AC	🐟<。)#)))≦、、鱼 (张馨月)	1ms	384 KiB		102 Bytes	2023-2-17 20:17:54
AC	李彭宋代诗人 (ljy123456)	1ms	384 KiB		126 Bytes	2023-4-5 21:06:55
AC	18523558128zcn	1ms	384 KiB		126 Bytes	2022-4-9 13:45:49
AC	zhaohaotong	1ms	384 KiB		116 Bytes	2022-5-23 19:24:05
AC	ymh	1ms	384 KiB		109 Bytes	2022-4-17 10:22:33
AC	余多多29	1ms	384 KiB		110 Bytes	2023-4-4 22:45:06
AC	yangbinyu	1ms	384 KiB		124 Bytes	2022-12-3 20:01:09
AC	经常消失 (小萝卜)	1ms	384 KiB		141 Bytes	2022-7-10 17:22:06
AC	zhangyh (张育菡)	1ms	384 KiB		110 Bytes	2022-5-1 9:23:54
AC	张桐玮	1ms	384 KiB		135 Bytes	2023-2-4 11:11:45
AC	龙吉先 (ljx)	1ms	384 KiB		108 Bytes	2023-2-4 11:23:33
AC	蓝色妖姬 (jiangpeiyu)	1ms	384 KiB		100 Bytes	2022-4-10 14:55:03
AC	李浩然	1ms	384 KiB		115 Bytes	2023-4-29 17:44:17
AC	ttz	1ms	384 KiB		131 Bytes	2022-3-13 9:16:15
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	384 KiB		116 Bytes	2022-6-24 19:02:35
AC	张雯皓 (zhangwenhao)	1ms	384 KiB		109 Bytes	2023-2-18 9:35:16
AC	马渝杭 (mayuhang)	1ms	384 KiB		119 Bytes	2023-3-6 19:12:40
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	1ms	384 KiB		115 Bytes	2022-4-9 19:04:05
AC	l;k (陈彬宾)	1ms	384 KiB		110 Bytes	2022-4-9 19:12:25
AC	dyp (hhy)	1ms	384 KiB		116 Bytes	2023-2-18 9:42:44
AC	时代一校林星宇 (lxy)	1ms	384 KiB		123 Bytes	2022-9-10 18:18:48
AC	余彦瑞	1ms	384 KiB		104 Bytes	2022-2-13 11:19:22
AC	詹宇航 (zyh7)	1ms	384 KiB		109 Bytes	2022-3-27 20:50:09
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)	1ms	384 KiB		125 Bytes	2023-5-20 11:23:26
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		112 Bytes	2022-4-28 6:49:32
AC	吴佳智 (AWM)	1ms	384 KiB		129 Bytes	2023-2-4 11:09:41
AC	(张洛诚)	1ms	384 KiB		121 Bytes	2022-5-23 21:22:42
AC	邓云恒	1ms	384 KiB		115 Bytes	2023-4-17 20:41:50
AC	徐子恩 (Cow)	1ms	384 KiB		164 Bytes	2022-3-10 19:50:58
AC	李旻轩	1ms	384 KiB		131 Bytes	2023-2-4 10:48:44
AC	顶尖轩崽	1ms	384 KiB		158 Bytes	2022-9-3 14:29:21
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:44
AC	王星皓	1ms	384 KiB		136 Bytes	2022-2-24 20:43:15
AC	付柏乐	1ms	384 KiB		129 Bytes	2023-5-18 22:02:03
AC	刘泽21	1ms	384 KiB		117 Bytes	2023-4-4 18:38:12
AC	魑归sama	1ms	384 KiB		109 Bytes	2022-7-12 16:55:30
AC	Randy Marsh (杨子腾)	1ms	384 KiB		133 Bytes	2022-4-17 11:31:43
AC	jinitaimei	1ms	384 KiB		107 Bytes	2022-8-18 11:16:44
AC	huyunyi23003	1ms	384 KiB		97 Bytes	2023-2-4 18:07:34
AC	1 (秦子栋)	1ms	384 KiB		122 Bytes	2023-5-7 15:40:06
AC	aoyu23003	1ms	384 KiB		94 Bytes	2023-2-4 18:02:39
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:51:39
AC	朱泽晟	1ms	384 KiB		113 Bytes	2022-3-10 20:31:35
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:51:05
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:10
AC	Nico	1ms	384 KiB		115 Bytes	2022-12-23 15:38:17
AC	黄px	1ms	7.2 MiB	C++11	108 Bytes	2024-6-2 14:43:11
AC	林小博	1ms	384 KiB		119 Bytes	2022-3-19 11:31:00
AC	任伊涵	1ms	7.2 MiB		140 Bytes	2023-6-10 17:18:40
AC	阮 (媚狐不吃道旁李)	1ms	7.1 MiB	C++98	121 Bytes	2024-5-18 11:17:33
AC	Guest	1ms	6.6 MiB	C++98(O2)	113 Bytes	2024-7-30 14:26:50
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:56:36
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:21
AC	xyc (谢雨宸)	1ms	384 KiB		114 Bytes	2022-11-28 11:58:40
AC	(俞伏羲)	1ms	384 KiB		103 Bytes	2023-2-5 15:20:02
AC	Guest	1ms	6.6 MiB	C++98(O2)	133 Bytes	2024-7-30 14:28:56
AC	神印王座	1ms	384 KiB		130 Bytes	2022-9-24 15:11:29
AC	摸鱼人的小仓库 http://www.staggeringbeauty.com/ 大虫子 https://www.ak-ioi.com/apps/oi-2048/ 华容道 chrome://dino/ 小恐龙 https://littlealchemy2.com/ 小小炼金师 https://2048game.com/ 数字组 https://dimit.me/Fe26/index_zh_CN.html 死铁 http://www.4399.com/ 4399 https://www.mazegenerator.net/ 迷宫 https://lewan.baidu.com/rankland?idfrom=5056&gameSource=mini&gameType=0 百度游戏 [https://deepmess.com/namerena/]名字竞技场 ev.io 枪战游戏https://www.crazygames.com/game/air-wars-2 飞机 https://www.crazygames.com/game/kirka-io 枪战 https://www.crazygames.com/game/ev-io (李承璋)	1ms	7.1 MiB		108 Bytes	2023-11-4 16:12:58
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:51:13
AC	吴佳智 (AWM)	1ms	384 KiB		129 Bytes	2023-2-4 11:09:43
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:56:45
AC	颜新雨3	1ms	384 KiB		125 Bytes	2022-4-9 14:09:56
AC	郑qr	1ms	6.9 MiB	C++11	103 Bytes	2024-6-2 14:35:12
AC	quzhibo	1ms	384 KiB		115 Bytes	2022-6-16 19:48:47
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:51:30
AC	贾博涵	1ms	384 KiB		129 Bytes	2023-2-4 11:07:09
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:53:48
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:55
AC	Guest	1ms	6.6 MiB	C++98(O2)	113 Bytes	2024-7-30 14:38:28
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7.1 MiB	C++11	103 Bytes	2024-6-2 14:56:51
AC	王禹程	1ms	6.9 MiB	C++11	104 Bytes	2024-6-2 14:37:57
AC	严斯扬1	1ms	6.9 MiB	C++11	108 Bytes	2024-6-10 17:17:51
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:35
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:56:09
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:55:19
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:54:05
AC	陶zx	1ms	6.8 MiB	C++11	104 Bytes	2024-6-2 14:33:57
AC	chenruoxi	1ms	6.7 MiB		113 Bytes	2023-11-7 19:46:25
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:54:30
AC	黄px	1ms	7.2 MiB	C++11	108 Bytes	2024-6-2 14:43:22
AC	罗一鸣	1ms	6.7 MiB		117 Bytes	2023-10-4 14:23:04
AC	郑qr	1ms	6.8 MiB	C++11	103 Bytes	2024-6-2 14:35:21
AC	接口规范的环境股份的改变风格更好官方发布交话费觉得UI个人福瑞呕吐更好玩二月份会哦工人物语合同融为UI呕吐也欧瑞特也日颙11计划的开始规划发热发忽而和1额外人让它发挥额UI挺符合瑞更好的好地方健康1给你计划润发百度很大差别发你发错饭你奶奶上次那就麻烦吧的风险环节几女华景新城换句话分解机 (余sy)	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:54:21
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:53:53
AC	郑qr	1ms	7 MiB	C++11	103 Bytes	2024-6-2 14:54:26
AC	郑qr	1ms	7.1 MiB	C++11	103 Bytes	2024-6-2 14:52:04
AC	时代一校蒋帛希 (13983392730)	1ms	384 KiB		115 Bytes	2022-8-17 17:55:21
AC	刘泽21	1ms	384 KiB		117 Bytes	2023-4-4 18:38:04
AC	黄px	1ms	7.2 MiB	C++11	109 Bytes	2024-6-2 14:43:32
AC	胡云杰	1ms	6.5 MiB		110 Bytes	2023-9-4 21:10:47
AC	黄梓轩 (huangzixuan)	1ms	384 KiB		116 Bytes	2022-6-11 17:27:57
AC	柳宗廷	1ms	6.6 MiB		107 Bytes	2023-9-23 13:28:45
AC	杨颂恩 (yangsongen)	1ms	384 KiB		119 Bytes	2023-2-18 9:31:54
AC	郑qr	1ms	6.7 MiB	C++11	103 Bytes	2024-6-2 14:57:18
AC	安闵煜 (anzai)	1ms	6.9 MiB	C++11	96 Bytes	2024-6-20 10:32:53