叮叮当当

状态	递交者	时间	内存	语言	代码	递交时间
AC	罗毅川 (scp-049)	2ms	344 KiB		425 Bytes	2022-10-1 15:46:56
AC	赵志陶 (zztzzt)	2ms	384 KiB		246 Bytes	2022-10-23 11:17:14
AC	甄一阳 (22016-zyy)	2ms	6.6 MiB		286 Bytes	2023-6-10 18:01:33
AC	AI创客	2ms	6.8 MiB	C++98	256 Bytes	2024-8-9 10:37:39
AC	章愉霖	2ms	384 KiB		272 Bytes	2023-6-1 11:02:37
AC	向俊熙 (xiangjunxi23003)	2ms	384 KiB		333 Bytes	2023-3-25 15:44:55
AC	杜是贤 (dushixian)	2ms	384 KiB		187 Bytes	2022-11-26 11:10:08
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)	2ms	384 KiB		323 Bytes	2022-10-29 10:22:11
AC	王彬羽 (wby)	2ms	6.8 MiB	C++11	494 Bytes	2024-8-15 18:24:04
AC	蒲梓勋 (puzixun)	2ms	384 KiB		197 Bytes	2022-10-20 22:14:59
AC	11111	2ms	364 KiB		386 Bytes	2022-3-4 19:21:39
AC	朱老师 (zyp)	2ms	384 KiB		256 Bytes	2022-11-16 19:06:39
AC	谭红中 (不知道)	2ms	384 KiB		348 Bytes	2023-1-11 16:10:16
AC	经常消失 (小萝卜)	2ms	384 KiB		219 Bytes	2023-3-8 15:12:24
AC	王祎辰 (wangyichen)	2ms	384 KiB		428 Bytes	2023-4-19 18:37:19
AC	yixingyou	2ms	392 KiB		262 Bytes	2022-9-10 17:02:35
AC	heyi	2ms	6.7 MiB	C++98(O2)	408 Bytes	2024-8-9 14:22:01
AC	罗伟杰 (13308275065)	2ms	384 KiB		257 Bytes	2022-12-17 10:14:55
AC	李林峰 (金克拉)	2ms	384 KiB		200 Bytes	2022-12-24 9:05:55
AC	hnd (陈皓洋)	2ms	384 KiB		343 Bytes	2022-11-16 19:34:49
AC	zhangxinyue	2ms	412 KiB		193 Bytes	2022-12-25 20:38:07
AC	lafuzbc	2ms	384 KiB		290 Bytes	2022-8-20 18:06:21
AC	金沙校区-王俊元 (王俊元)	2ms	6.7 MiB		345 Bytes	2023-10-28 9:00:55
AC	刘骏峰1	2ms	6.9 MiB	C++98	364 Bytes	2024-8-25 10:54:31
AC	曼波（＾-＾） (hechenxuan23005)	2ms	6.7 MiB	C++98	291 Bytes	2024-6-15 16:12:40
AC	靳博然 (jbr)	2ms	384 KiB		312 Bytes	2023-3-19 17:58:31
AC	zhangxinyue	2ms	392 KiB		193 Bytes	2022-12-25 20:38:06
AC	sunsihan	2ms	6.5 MiB		228 Bytes	2023-8-23 15:36:24
AC	zhangxinyue	2ms	400 KiB		193 Bytes	2022-12-25 20:38:05
AC	zhangxinyue	2ms	392 KiB		193 Bytes	2022-12-25 20:38:06
AC	zhangxinyue	2ms	376 KiB		193 Bytes	2022-12-25 20:38:07
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	2ms	384 KiB		410 Bytes	2023-1-13 15:48:02
AC	Randy Marsh (杨子腾)	2ms	360 KiB		404 Bytes	2022-10-1 15:00:45
AC	呵呵呵 (陈思琦)	2ms	384 KiB		298 Bytes	2022-9-10 16:51:40
AC	leisixian (22029-lyh)	2ms	384 KiB		400 Bytes	2022-11-3 18:59:09
AC	刘煜轩	3ms	6.8 MiB		291 Bytes	2023-12-2 9:47:25
AC	田开朗	4ms	7.1 MiB		275 Bytes	2024-1-23 13:53:45
AC	Harley (郑浩然)	4ms	6.9 MiB		318 Bytes	2023-11-30 20:06:21
AC	Him (李俊熙)	4ms	7.1 MiB		255 Bytes	2024-1-7 16:10:30
AC	acacac (董子溪)	4ms	7.2 MiB		429 Bytes	2024-1-7 16:01:04
AC	胡唯轶	4ms	7 MiB		273 Bytes	2024-1-6 21:16:12
AC	zyl	4ms	6.9 MiB		275 Bytes	2024-1-3 17:38:15
AC	ysf.wlanwq.ZJSWL 1922~1991 (韦舒豪)	4ms	7.2 MiB		317 Bytes	2024-1-13 20:20:56
AC	xsm孙张天逸	6ms	532 KiB	C++98(O2)	290 Bytes	2025-3-16 11:39:35
AC	zlx (xiao)	6ms	2.8 MiB	Python 2	127 Bytes	2022-5-24 22:00:04
AC	游智棋	7ms	532 KiB		349 Bytes	2024-3-27 19:48:55
AC	阮 (媚狐不吃道旁李)	7ms	532 KiB		322 Bytes	2024-3-9 11:04:54
AC	算法战神 (konglinghao)	7ms	532 KiB		279 Bytes	2024-4-9 17:47:15
AC	444444444 (唐跃元)	7ms	532 KiB		346 Bytes	2024-3-4 20:41:59
AC	樊竣熠 (lft1114)	7ms	2.8 MiB	Python 2	127 Bytes	2022-2-22 19:05:42
AC	谢博文	7ms	2.8 MiB	Python 2	247 Bytes	2022-8-8 20:20:03
AC	潘弈帆	7ms	320 KiB		312 Bytes	2024-3-2 16:56:07
AC	jdy	7ms	532 KiB		275 Bytes	2024-3-12 17:08:40
AC	你个你怎么跟个一样 (钟卓劭)	7ms	532 KiB		241 Bytes	2024-2-29 17:27:12
AC	老六在此	7ms	532 KiB		395 Bytes	2024-4-12 20:03:56
AC	majinhui	7ms	2.8 MiB	Python 2	216 Bytes	2022-7-27 11:19:18
AC	黄立信是XXS (吕同学)	7ms	532 KiB		454 Bytes	2024-2-23 20:22:52
AC	scallway	7ms	2.8 MiB	Python 2	201 Bytes	2022-6-26 9:00:52
AC	陈廷恩	7ms	2.8 MiB	Python 2	231 Bytes	2023-4-28 20:12:31
AC	綰綰(HHYT)	7ms	532 KiB		368 Bytes	2024-4-9 21:02:21
AC	scallway	7ms	2.8 MiB	Python 2	201 Bytes	2022-6-26 9:00:52
AC	shishen	7ms	320 KiB	C++98	268 Bytes	2025-1-8 19:49:09
AC	xsm刘芷彤	7ms	532 KiB	C++98(O2)	318 Bytes	2025-3-16 11:37:52
AC	时代二校-王盼兮 (wangpanxi)	7ms	532 KiB		289 Bytes	2024-4-13 17:47:36
AC	谢博文	7ms	2.9 MiB	Python 2	260 Bytes	2022-2-19 9:21:06
AC	Him神	7ms	536 KiB		297 Bytes	2024-1-26 11:09:39
AC	陈年保宁醋 (dengboren)	7ms	2.8 MiB	Python 2	248 Bytes	2022-3-12 9:13:31
AC	算法战神 (konglinghao)	7ms	532 KiB		260 Bytes	2024-4-9 17:47:36
AC	张芮茜	7ms	396 KiB	C++11	311 Bytes	2025-1-19 13:48:43
AC	cola	7ms	520 KiB		351 Bytes	2024-3-28 16:46:53
AC	zhujingen	7ms	532 KiB	C++11	178 Bytes	2025-1-19 16:42:55
AC	SXM许祖睿 (许祖睿)	7ms	320 KiB	C++17	333 Bytes	2025-2-18 20:58:12
AC	叶令子	7ms	532 KiB	C++11	247 Bytes	2025-2-3 16:09:13
AC	A小涂	7ms	324 KiB	C++17	273 Bytes	2025-1-14 18:31:05
AC	麒麟 (钟千粟)	7ms	532 KiB	C++98(O2)	287 Bytes	2025-3-22 20:28:21
AC	褚浩睿	7ms	532 KiB	C++98(O2)	267 Bytes	2025-3-16 20:03:44
AC	朱韧显&&任茱显 (xsm任茱显)	8ms	532 KiB	C++98(O2)	324 Bytes	2025-2-15 16:26:34
AC	李晟熙	8ms	532 KiB	C++17	392 Bytes	2025-2-14 15:27:06
AC	王紫月	8ms	536 KiB		200 Bytes	2024-2-29 22:37:51
AC	wawa	8ms	2.8 MiB	Python 2	218 Bytes	2022-8-19 17:16:22
AC	xsm李沐一	8ms	532 KiB	C++98(O2)	290 Bytes	2025-3-7 17:58:17
AC	李浩然	8ms	2.8 MiB	Python 2	207 Bytes	2022-12-15 20:37:48
AC	xsm唐晨翔	8ms	532 KiB	C++98(O2)	304 Bytes	2025-3-8 16:53:11
AC	BJ6180C8CTD (Fan)	8ms	532 KiB		275 Bytes	2024-4-12 20:28:26
AC	¿¿¿??? (李睿瞳)	8ms	764 KiB		255 Bytes	2024-2-6 16:30:31
AC	猫不理包子	8ms	2.8 MiB	Python 2	297 Bytes	2022-11-23 11:13:20
AC	marz	8ms	768 KiB		400 Bytes	2024-4-1 22:06:48
AC	test6	8ms	532 KiB		300 Bytes	2024-2-3 13:32:17
AC	xsm杨一宸	8ms	532 KiB	C++98(O2)	282 Bytes	2025-3-8 16:32:04
AC	11451254188 (22029-mjh)	8ms	2.8 MiB	Python 2	224 Bytes	2022-11-3 20:37:37
AC	xsm何俊贤	8ms	532 KiB	C++98(O2)	281 Bytes	2025-3-8 16:29:40
AC	xsm周嘉诩	8ms	536 KiB	C++98(O2)	278 Bytes	2025-3-7 17:59:37
AC	xsm彭子桐	8ms	532 KiB	C++98(O2)	305 Bytes	2025-3-3 20:22:44
AC	路曼	8ms	532 KiB	C++98(O2)	298 Bytes	2025-3-7 13:50:39
AC	xsm董晟辰	8ms	532 KiB	C++98(O2)	298 Bytes	2025-3-8 16:32:28
AC	xsm陈思齐	8ms	532 KiB	C++98(O2)	307 Bytes	2025-1-20 14:22:27
AC	xsm王梓烨	8ms	328 KiB	C++98(O2)	318 Bytes	2025-3-7 17:53:23
AC	https://www.crazygames.com/game/merge-construct (陈诺)	8ms	7 MiB		406 Bytes	2023-12-23 20:17:03
AC	赵奕铭	8ms	516 KiB		271 Bytes	2024-2-18 14:07:46
AC	杨博尧	8ms	532 KiB	C++98(O2)	191 Bytes	2025-2-9 13:33:09