拉线开关

状态	递交者	时间	内存	语言	代码	递交时间
AC	11451254188 (22029-mjh)	184ms	3.9 MiB	Python 3	63 Bytes	2023-5-10 18:47:54
AC	一个小白	186ms	9.1 MiB	Python 3	62 Bytes	2023-6-23 17:12:26
AC	冉浩然	188ms	9.1 MiB	Python 3	62 Bytes	2023-6-17 21:03:07
AC	April	189ms	9 MiB	Python 3	94 Bytes	2023-7-23 15:29:57
AC	伍行念 (wuxingnian)	191ms	9.1 MiB	Python 3	59 Bytes	2023-9-21 16:19:10
AC	钱小喵	192ms	3.9 MiB	Python 3	70 Bytes	2022-5-2 20:51:08
AC	Lynn	192ms	9.1 MiB	Python 3	61 Bytes	2023-6-17 18:25:22
AC	114514 (wangjunling)	193ms	4 MiB	Python 3	68 Bytes	2022-8-18 14:08:08
AC	杨坤霖 (steven)	195ms	3.9 MiB	Python 3	65 Bytes	2022-7-7 15:22:55
AC	陈策cc	195ms	9.1 MiB	Python 3	66 Bytes	2023-6-21 20:33:19
AC	赵沛喆	197ms	3.9 MiB	Python 3	67 Bytes	2022-1-21 9:57:58
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)	198ms	3.9 MiB	Python 3	67 Bytes	2023-5-10 18:42:04
AC	19598	198ms	9 MiB	Python 3	63 Bytes	2023-8-11 15:36:43
AC	11111	198ms	4 MiB	Python 3	67 Bytes	2022-2-12 15:25:00
AC	谭奕辰	200ms	9.1 MiB	Python 3	67 Bytes	2023-7-4 10:08:39
AC	杨宁静	201ms	4 MiB	Python 3	130 Bytes	2023-2-11 10:12:26
AC	钱小喵	201ms	4 MiB	Python 3	70 Bytes	2022-7-10 15:43:36
AC	アニヤ (陈子涵)	202ms	4 MiB	Python 3	63 Bytes	2023-2-3 12:06:12
AC	jiangyuchen	202ms	3.9 MiB	Python 3	121 Bytes	2022-5-21 11:22:21
AC	朱老师 (zyp)	202ms	3.9 MiB	Python 3	61 Bytes	2022-10-29 18:00:42
AC	hrx	203ms	3.9 MiB	Python 3	107 Bytes	2022-5-8 16:40:38
AC	wangmiaoxin	203ms	4 MiB	Python 3	107 Bytes	2022-5-8 16:40:40
AC	时代二校-焦雨齐 (Angel)	203ms	4 MiB	Python 3	85 Bytes	2023-1-4 19:01:52
AC	not_None	203ms	3.9 MiB	Python 3	92 Bytes	2022-1-22 9:55:04
AC	scallway	204ms	3.9 MiB	Python 3	119 Bytes	2022-5-8 16:40:34
AC	小翔的粉丝	204ms	4 MiB	Python 3	74 Bytes	2022-5-5 21:28:32
AC	xlx	204ms	3.9 MiB	Python 3	113 Bytes	2022-5-21 11:21:05
AC	梨冻亿 (wiueh)	205ms	3.9 MiB	Python 3	67 Bytes	2022-1-22 20:22:25
AC	钱小喵1	205ms	3.9 MiB	Python 3	70 Bytes	2022-5-26 19:09:29
AC	朱老师 (zyp)	206ms	3.9 MiB	Python 3	65 Bytes	2022-1-25 9:58:18
AC	王晴萱	206ms	9.1 MiB	Python 3	61 Bytes	2023-7-3 11:11:13
AC	杨坤霖 (steven)	207ms	4 MiB	Python 3	65 Bytes	2022-7-7 15:22:54
AC	时代二校-焦雨齐 (Angel)	207ms	3.9 MiB	Python 3	85 Bytes	2023-1-4 19:04:44
AC	xlx	207ms	3.9 MiB	Python 3	113 Bytes	2022-5-21 11:21:36
AC	时代二校+王吕棪 (wanglvyan)	208ms	4 MiB	Python 3	75 Bytes	2022-12-31 16:10:15
AC	maobohan	208ms	3.9 MiB	Python 3	123 Bytes	2022-5-21 11:22:24
AC	坏蛋宝宝 (王俊峰)	208ms	4 MiB	Python 3	61 Bytes	2023-2-2 15:12:59
AC	猫不理包子	208ms	4 MiB	Python 3	106 Bytes	2022-8-11 15:01:58
AC	黄琛轩	209ms	3.9 MiB	Python 3	65 Bytes	2022-5-27 23:42:22
AC	zhanghaoyang	209ms	3.9 MiB	Python 3	73 Bytes	2022-1-25 10:05:50
AC	cola	210ms	4 MiB	Python 3	63 Bytes	2022-12-15 16:19:24
AC	baijinlin22003	210ms	3.9 MiB	Python 3	59 Bytes	2022-10-29 18:02:22
AC	czy	210ms	3.9 MiB	Python 3	119 Bytes	2022-5-8 16:46:01
AC	zyp (wangjunling23010)	210ms	3.9 MiB	Python 3	59 Bytes	2023-5-10 18:43:20
AC	杨浩灵 (金坷拉)	212ms	3.9 MiB	Python 3	126 Bytes	2022-6-3 11:27:42
AC	kongql	212ms	4 MiB	Python 3	61 Bytes	2022-7-17 9:45:26
AC	yezhongyang	212ms	3.9 MiB	Python 3	61 Bytes	2023-2-2 19:57:56
AC	谭红中 (不知道)	212ms	4 MiB	Python 3	61 Bytes	2022-3-23 16:47:13
AC	苗润昊	212ms	3.9 MiB	Python 3	61 Bytes	2022-1-24 17:56:18
AC	易锦程 (sky)	214ms	3.9 MiB	Python 3	68 Bytes	2022-8-22 21:08:29
AC	zhenglibo22003	215ms	3.9 MiB	Python 3	57 Bytes	2022-10-29 17:59:17
AC	A小涂	216ms	3.9 MiB	Python 3	82 Bytes	2023-1-7 19:45:08
AC	baijinlin22003	216ms	3.9 MiB	Python 3	59 Bytes	2022-10-29 18:02:22
AC	稻妻第一深情 (喝酒の吟游诗人)	216ms	4 MiB	Python 3	23 Bytes	2023-1-11 11:55:29
AC	sb (linjiayu23010)	216ms	4 MiB	Python 3	64 Bytes	2023-5-10 18:34:30
AC	longsiyin	217ms	3.9 MiB	Python 3	130 Bytes	2022-5-21 11:19:35
AC	wawa	217ms	3.9 MiB	Python 3	71 Bytes	2022-8-20 16:39:36
AC	邵清泉	217ms	3.9 MiB	Python 3	64 Bytes	2022-12-28 17:24:39
AC	1396013295	217ms	3.9 MiB	Python 3	65 Bytes	2022-1-22 17:15:59
AC	tianyufan21039	218ms	3.9 MiB	Python 3	60 Bytes	2023-2-2 20:01:42
AC	Wling	218ms	4 MiB	Python 3	57 Bytes	2022-11-2 13:10:17
AC	hhh7890	218ms	4 MiB	Python 3	71 Bytes	2023-1-7 19:42:24
AC	龚铭俊 (哈哈哈)	219ms	3.9 MiB	Python 3	57 Bytes	2022-8-27 12:53:34
AC	时代二校-王盼兮 (wangpanxi)	220ms	3.9 MiB	Python 3	65 Bytes	2022-5-21 11:19:31
AC	张子轩 (zhangzixuana)	220ms	3.9 MiB	Python 3	61 Bytes	2022-1-21 14:09:47
AC	fsx	220ms	3.9 MiB	Python 3	61 Bytes	2023-1-11 19:44:19
AC	majinhui	220ms	3.9 MiB	Python 3	61 Bytes	2022-5-25 19:21:46
AC	ysy	221ms	3.9 MiB	Python 3	63 Bytes	2023-1-12 15:31:11
AC	南坪校区-郑力博 (zhenglibo23003)	222ms	3.9 MiB	Python 3	57 Bytes	2023-5-10 18:35:13
AC	爱琴海校区-刁钲洋 (刁钲洋)	223ms	3.9 MiB	Python 3	61 Bytes	2022-3-31 21:34:26
AC	龚铭俊 (哈哈哈)	223ms	3.9 MiB	Python 3	57 Bytes	2022-8-27 12:53:33
AC	AC[谭赫奕] (tanheyi)	223ms	3.9 MiB	Python 3	130 Bytes	2022-5-21 11:20:41
AC	baijinlin22003	226ms	3.9 MiB	Python 3	59 Bytes	2022-10-29 18:02:23
AC	hunghao	226ms	4.1 MiB	Python 3	65 Bytes	2022-4-9 20:50:25
AC	baijinlin22003	227ms	3.9 MiB	Python 3	59 Bytes	2022-10-29 18:02:22
AC	赵沛喆	227ms	4 MiB	Python 3	67 Bytes	2022-10-16 8:58:09
AC	baijinlin22003	228ms	3.9 MiB	Python 3	59 Bytes	2022-10-29 18:02:18
AC	龚铭俊 (哈哈哈)	229ms	4 MiB	Python 3	57 Bytes	2022-8-27 12:53:32
AC	潘胤宸	230ms	4 MiB	Python 3	57 Bytes	2023-1-12 15:27:15
AC	李艾芯 (starry sky)	232ms	3.9 MiB	Python 3	25 Bytes	2022-6-25 10:41:35
AC	潘胤羲	260ms	3.9 MiB	Python 3	67 Bytes	2023-1-12 15:26:39
AC	Qinxiu	354ms	9.8 MiB	Python 3	57 Bytes	2024-1-23 19:08:04
AC	安闵煜 (anzai)	367ms	9.8 MiB	Python 3	61 Bytes	2024-1-17 20:19:58
AC	吵吵小小 (超级小白)	622ms	4 MiB	Python 3	65 Bytes	2024-8-31 10:25:21
AC	chenpp	631ms	4 MiB	Python 3	68 Bytes	2024-11-10 14:09:39