Hello World

状态	递交者	时间	内存	语言	代码	递交时间
AC	黎湘渝	1ms	8 MiB		93 Bytes	2023-2-28 18:18:09
AC	罗一鸣	1ms	6.7 MiB		103 Bytes	2023-10-4 14:01:26
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	1ms	7 MiB		90 Bytes	2022-9-22 20:06:39
AC	汪筱淞	1ms	6.6 MiB		94 Bytes	2022-7-1 17:39:36
AC	zhujingen	1ms	7.2 MiB	C++11	92 Bytes	2024-5-4 20:26:22
AC	sam20110826	1ms	7.8 MiB		93 Bytes	2022-4-16 21:08:25
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:28:02
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:08
AC	yuchenyi23017	1ms	6.7 MiB		116 Bytes	2023-9-2 20:24:58
AC	反恐鸡蛋	1ms	7.9 MiB		76 Bytes	2022-3-12 16:44:15
AC	renqingsen	1ms	8.2 MiB		79 Bytes	2023-4-30 17:25:30
AC	weiqi	1ms	6.9 MiB		78 Bytes	2023-8-22 8:59:05
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:15:08
AC	sxh1	1ms	6.5 MiB		97 Bytes	2023-9-16 18:53:05
AC	123456789012345678901234567890 (罗传智)	1ms	7 MiB		76 Bytes	2022-9-22 19:59:06
AC	13637782853	1ms	7.7 MiB		166 Bytes	2022-9-3 14:10:02
AC	甄一阳 (22016-zyy)	1ms	7.7 MiB		92 Bytes	2022-8-25 21:22:10
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:43
AC	陈睿泽	1ms	7 MiB	C++11	123 Bytes	2024-5-4 18:21:31
AC	王钧正	1ms	7.6 MiB		101 Bytes	2022-2-13 11:13:48
AC	杨佳葆	1ms	7.5 MiB		94 Bytes	2022-3-30 19:20:26
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	6.5 MiB		94 Bytes	2023-9-17 9:01:48
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:30
AC	max	1ms	6.7 MiB		94 Bytes	2023-9-3 17:27:59
AC	ymx	1ms	6.9 MiB	C++98(O2)	107 Bytes	2024-6-14 19:41:41
AC	王康瑞	1ms	6.8 MiB		88 Bytes	2023-9-30 10:03:02
AC	葛琮扬	1ms	8 MiB		57 Bytes	2023-2-16 19:52:33
AC	Mr_D	1ms	6.9 MiB		139 Bytes	2023-10-29 11:18:52
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:53
AC	罗竣瀚	1ms	7 MiB		87 Bytes	2022-9-24 15:16:30
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:48
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:10
AC	周子义	1ms	7 MiB	C++11	86 Bytes	2024-5-12 18:44:10
AC	李华峻 (willy)	1ms	8.2 MiB		92 Bytes	2022-11-7 17:27:52
AC	张峻尘 (zjc)	1ms	8 MiB		101 Bytes	2022-6-12 10:34:33
AC	林叙锦	1ms	6.6 MiB		96 Bytes	2022-6-30 14:56:05
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:40:00
AC	集合游戏账户	1ms	7 MiB		94 Bytes	2022-10-1 20:45:50
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:31
AC	张家赫	1ms	7.8 MiB		92 Bytes	2023-2-28 18:18:53
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:26
AC	lhr	1ms	6.7 MiB		85 Bytes	2023-10-12 18:27:55
AC	小土豆 (liuzirui2)	1ms	6.8 MiB		90 Bytes	2023-8-24 15:09:54
AC	陈廷恩	1ms	6.5 MiB		111 Bytes	2023-9-1 19:37:57
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	1ms	7.2 MiB		109 Bytes	2022-3-26 14:56:55
AC	杜俊宏	1ms	8 MiB		96 Bytes	2022-3-7 20:49:45
AC	天天happy	1ms	7.3 MiB		92 Bytes	2023-7-9 19:04:24
AC	愚人众第六席[散兵]	1ms	8 MiB		109 Bytes	2023-4-16 10:38:48
AC	李允昊	1ms	6.5 MiB		94 Bytes	2023-9-4 21:06:20
AC	lxj	1ms	8.1 MiB		91 Bytes	2023-5-13 21:20:55
AC	李yz	1ms	6.9 MiB	C++11	87 Bytes	2024-6-2 13:57:05
AC	youhonglin	1ms	8.2 MiB		87 Bytes	2023-5-5 19:14:45
AC	wuzhenghan	1ms	7.7 MiB		86 Bytes	2022-5-12 20:18:06
AC	向俊熙 (xiangjunxi23003)	1ms	7.5 MiB		85 Bytes	2023-2-4 17:55:16
AC	赵耘毅	1ms	8.1 MiB		89 Bytes	2023-5-13 20:07:43
AC	13883645777	1ms	7.7 MiB		162 Bytes	2022-9-3 14:14:36
AC	李宜帆	1ms	8 MiB		93 Bytes	2023-2-28 18:18:07
AC	小乌龟	1ms	7.6 MiB		99 Bytes	2022-5-14 21:28:33
AC	majinhui	1ms	7.4 MiB		91 Bytes	2022-9-12 20:44:43
AC	Microsoft (hu_moren)	1ms	7.1 MiB		137 Bytes	2023-7-12 9:05:51
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:22
AC	菠萝元帅 (sxh)	1ms	8 MiB		135 Bytes	2023-5-13 19:15:47
AC	车涌强	1ms	7.2 MiB		91 Bytes	2023-6-17 16:09:33
AC	贾鑫豪 (Mr Sam)	1ms	7.7 MiB		108 Bytes	2022-9-3 12:12:44
AC	Randy Marsh (杨子腾)	1ms	8.1 MiB		91 Bytes	2022-1-22 9:14:41
AC	陈荣添	1ms	8 MiB		86 Bytes	2023-5-13 19:16:57
AC	LiXY	1ms	6.9 MiB	C++98(O2)	97 Bytes	2024-6-4 19:32:09
AC	weiqi	1ms	7 MiB		78 Bytes	2023-8-22 8:46:40
AC	jcx008	1ms	6.6 MiB		98 Bytes	2022-7-2 14:14:22
AC	胡一瀚23025	1ms	6.5 MiB		119 Bytes	2023-9-3 14:01:57
AC	煞笔笔	1ms	8.2 MiB		134 Bytes	2023-5-5 19:10:30
AC	金沙校区-鲍钰森 (鲍钰森)	1ms	6.9 MiB		89 Bytes	2023-9-24 11:35:29
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:26
AC	希蒙 (zhengxingya)	1ms	6.5 MiB		79 Bytes	2023-8-26 21:26:58
AC	王科睿 (鲨凋的小鲨鱼)	1ms	8 MiB		76 Bytes	2022-2-26 18:09:08
AC	zyl	1ms	6.7 MiB		97 Bytes	2023-10-26 21:59:00
AC	qinlang	1ms	8.1 MiB		88 Bytes	2023-5-13 19:18:28
AC	yanglang	1ms	7.1 MiB		96 Bytes	2022-10-15 16:26:16
AC	Randy Marsh (杨子腾)	1ms	8.1 MiB		91 Bytes	2022-1-22 9:14:42
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:10:07
AC	吴桐	1ms	6.7 MiB		98 Bytes	2023-8-25 11:58:52
AC	stehpen_zuo	1ms	6.7 MiB	C++20	107 Bytes	2024-6-1 14:01:58
AC	反.恐.皮.蛋.	1ms	8.1 MiB		92 Bytes	2022-8-23 15:49:48
AC	贾璨玮 (马NB)	1ms	8.2 MiB		97 Bytes	2022-12-10 9:22:58
AC	罗竣瀚	1ms	7 MiB		87 Bytes	2022-9-24 15:16:32
AC	陈铭涛 (NEX)	1ms	7.1 MiB		97 Bytes	2022-10-6 16:57:14
AC	李铭瀚 (liminghan)	1ms	8.2 MiB		95 Bytes	2022-1-19 17:53:06
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.6 MiB		102 Bytes	2022-7-2 17:10:03
AC	ymh	1ms	7.1 MiB		86 Bytes	2022-3-26 16:24:13
AC	罗翊宸	1ms	6.7 MiB		93 Bytes	2023-9-2 10:26:22
AC	Stephen Stevenson	1ms	8.2 MiB		78 Bytes	2022-12-11 11:00:06
AC	甘梓琪	1ms	8.1 MiB		103 Bytes	2022-1-21 17:14:03
AC	郑qr	1ms	7.1 MiB	C++11	86 Bytes	2024-6-2 13:55:42
AC	(张洛诚)	1ms	7.5 MiB		103 Bytes	2023-5-27 19:39:48
AC	龙湖源著校区郑皓铭 (郑皓铭)	1ms	8.2 MiB		96 Bytes	2023-5-7 22:11:48
AC	ylc	1ms	6.7 MiB		103 Bytes	2022-4-4 14:44:43
AC	鄢爱宸	1ms	6.9 MiB		176 Bytes	2023-11-4 10:59:42
AC	范宜灵	1ms	7.8 MiB		93 Bytes	2022-5-3 18:16:53
AC	黎湘渝	1ms	7.8 MiB		93 Bytes	2023-2-28 18:20:05
AC	周琪渃	1ms	8.2 MiB		94 Bytes	2022-12-12 15:22:47