拉线开关

状态	递交者	时间	内存	语言	代码	递交时间
AC	林小博	14ms	384 KiB		176 Bytes	2022-4-9 11:29:19
AC	kkksc03 (彭士锋)	14ms	544 KiB		153 Bytes	2022-3-11 18:11:31
AC	新壹街校区-周士杰 (zsj)	14ms	512 KiB		130 Bytes	2022-6-9 20:11:40
AC	王胤钦 (wangyinqin)	14ms	420 KiB		143 Bytes	2022-4-23 16:21:35
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	448 KiB		200 Bytes	2022-7-4 9:27:38
AC	古煦涵	14ms	6.8 MiB	C++98	131 Bytes	2024-8-7 20:07:35
AC	zhangjiani	14ms	392 KiB		167 Bytes	2022-9-10 16:48:54
AC	李禹衡 (liyuheng22006)	14ms	384 KiB		159 Bytes	2022-10-25 18:24:46
AC	chaikexu	14ms	436 KiB		127 Bytes	2022-11-20 10:59:18
AC	何锦宸熙	14ms	7.1 MiB		132 Bytes	2023-10-28 20:24:00
AC	喵 (蹇心悦)	14ms	392 KiB		136 Bytes	2022-10-22 16:01:26
AC	05c30-dyh	14ms	440 KiB		172 Bytes	2022-3-5 15:45:28
AC	喵 (蹇心悦)	14ms	384 KiB		144 Bytes	2022-4-9 15:45:32
AC	陈致远Lynn	14ms	6.7 MiB		150 Bytes	2023-9-30 20:31:56
AC	heyi	14ms	6.8 MiB	C++98(O2)	167 Bytes	2024-8-8 13:06:47
AC	zyp (wangjunling23010)	14ms	7.2 MiB	C++11	139 Bytes	2024-4-25 19:35:33
AC	曾龙兮	14ms	384 KiB		134 Bytes	2022-10-2 18:37:54
AC	陈玺宇	14ms	6.8 MiB		233 Bytes	2023-10-24 22:01:57
AC	梁金同 (liangjintong)	14ms	384 KiB		105 Bytes	2022-10-23 18:31:18
AC	凌肯 (lingken22006)	14ms	412 KiB		200 Bytes	2022-7-31 18:57:56
AC	pig (hezhihui)	14ms	7.2 MiB	C++11	144 Bytes	2024-4-25 18:29:26
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	7.2 MiB	C++98	164 Bytes	2024-4-25 19:10:54
AC	CK (李弘毅)	14ms	436 KiB		143 Bytes	2023-2-18 17:28:40
AC	谢博文	14ms	436 KiB		177 Bytes	2022-6-28 15:26:42
AC	Guest	14ms	7 MiB	C++98(O2)	161 Bytes	2024-6-14 20:03:58
AC	诸禹吉 (zhuyuji)	14ms	512 KiB		132 Bytes	2022-8-9 21:25:33
AC	杨瀚霖 (yanghanlin)	14ms	512 KiB		167 Bytes	2022-12-30 17:07:25
AC	张月恒	14ms	6.9 MiB	C++98(O2)	145 Bytes	2024-8-21 18:21:16
AC	lch (凌昌瀚)	14ms	392 KiB		136 Bytes	2022-10-19 18:46:51
AC	文硕 (文硕1)	14ms	384 KiB		162 Bytes	2022-10-22 17:52:36
AC	南坪校区-贺侒童 (heantong23010)	14ms	7.2 MiB	C++11	118 Bytes	2024-4-25 19:20:21
AC	wangpanxi2	14ms	388 KiB		162 Bytes	2023-4-1 9:35:26
AC	况奕辛 (KYX_yyds)	14ms	512 KiB		227 Bytes	2022-2-18 18:56:08
AC	李林峰 (金克拉)	14ms	384 KiB		150 Bytes	2022-10-19 18:46:26
AC	吴俊成 (wujuncheng)	14ms	512 KiB		124 Bytes	2022-7-9 22:15: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)	14ms	384 KiB		178 Bytes	2023-5-10 18:41:33
AC	黄誉翔 (黄誉翔)	14ms	384 KiB		145 Bytes	2022-10-19 18:48:09
AC	谭红中 (不知道)	14ms	384 KiB		163 Bytes	2022-10-15 22:11:56
AC	没有此人 (akm)	14ms	7.1 MiB	C++14	178 Bytes	2024-5-15 18:39:46
AC	田信 (tianxincn1)	14ms	444 KiB		163 Bytes	2022-3-6 20:54:11
AC	汪致卉 (wangzh)	14ms	392 KiB		195 Bytes	2022-1-22 19:17:18
AC	https://www.crazygames.com/game/kiomet-com (chensitong)	14ms	432 KiB		157 Bytes	2022-7-9 13:02:52
AC	郑岐蔚	14ms	512 KiB		146 Bytes	2023-2-10 19:01:57
AC	徐子恩 (Cow)	14ms	384 KiB		139 Bytes	2022-10-15 23:05:12
AC	冒牌陈杰晟【MOD】 (wed)	14ms	384 KiB		152 Bytes	2022-2-28 15:29:35
AC	钟元朗	14ms	6.9 MiB		157 Bytes	2023-8-13 19:08:24
AC	liusihan	14ms	384 KiB		113 Bytes	2022-10-23 18:55:18
AC	chen (peter)	14ms	420 KiB		153 Bytes	2022-7-19 11:13:15
AC	_PXY_	14ms	384 KiB		246 Bytes	2022-1-25 14:27:14
AC	王胤钦 (wangyinqin)	14ms	384 KiB		143 Bytes	2022-4-23 16:21:31
AC	李龙腾 (llt)	14ms	384 KiB		192 Bytes	2022-10-19 18:48:53
AC	刘政君 (lzj)	14ms	440 KiB		238 Bytes	2022-7-6 9:21:34
AC	在煎鱼的肖大总铳 (肖宇航)	14ms	7 MiB		158 Bytes	2023-9-24 11:02:34
AC	zhangyh (张育菡)	14ms	440 KiB		104 Bytes	2022-6-11 8:42:43
AC	益布响完辣 (黄靖益1)	14ms	384 KiB		187 Bytes	2023-5-26 21:58:44
AC	贺睿林	14ms	444 KiB		91 Bytes	2022-11-20 22:50:34
AC	杜俊宏	14ms	512 KiB		145 Bytes	2022-3-21 20:54:23
AC	余晨浩 (yuchenhao)	14ms	6.8 MiB		135 Bytes	2023-8-31 14:56:37
AC	代尚函笛卡尔 (daishanghan)	14ms	392 KiB		101 Bytes	2022-10-23 18:26:32
AC	益布响完辣 (黄靖益1)	14ms	384 KiB		187 Bytes	2023-5-26 21:58:45
AC	曹埊睿 (caodirui)	14ms	512 KiB		146 Bytes	2023-4-17 19:15:10
AC	zzl	14ms	6.8 MiB		171 Bytes	2023-11-7 0:19:53
AC	朱泽晟	14ms	420 KiB		161 Bytes	2022-2-12 20:34:05
AC	余晨浩 (yuchenhao)	14ms	384 KiB		147 Bytes	2022-10-23 18:31:33
AC	朱泽晟	14ms	384 KiB		152 Bytes	2022-10-15 23:00:04
AC	肖添宇	14ms	436 KiB		171 Bytes	2022-3-12 18:45:46
AC	fengzixuan	14ms	440 KiB		112 Bytes	2023-2-19 21:02:33
AC	张玉坚 (zhangyuian)	14ms	384 KiB		154 Bytes	2022-10-23 18:31:14
AC	马渝杭 (mayuhang)	14ms	392 KiB		100 Bytes	2022-10-23 18:34:19
AC	杨颂恩 (yangsongen)	14ms	512 KiB		174 Bytes	2023-5-16 19:53:36
AC	shenyushun2	14ms	444 KiB		206 Bytes	2022-12-2 17:56:37
AC	yang	14ms	436 KiB		170 Bytes	2022-8-14 19:07:52
AC	呵 (mohaoran)	14ms	384 KiB		171 Bytes	2022-10-19 18:38:23
AC	王玺懿 (wxy)	14ms	512 KiB		134 Bytes	2022-8-13 18:08:47
AC	陈秋石	14ms	512 KiB		146 Bytes	2022-11-15 17:39:58
AC	李俊钢	14ms	384 KiB		169 Bytes	2023-2-11 11:31:23
AC	时代一校林星宇 (lxy)	14ms	512 KiB		158 Bytes	2023-2-10 18:24:51
AC	傀儡师 (zhujingen)	14ms	7.2 MiB	C++11	157 Bytes	2024-4-25 18:26:44
AC	黄梓桐 (HuangZiTong)	14ms	384 KiB		105 Bytes	2022-10-23 18:31:08
AC	郭人瑀1	14ms	384 KiB		139 Bytes	2022-10-21 19:08:59
AC	zhongjunxuan	14ms	7.2 MiB	C++11	179 Bytes	2024-4-25 19:01:35
AC	新壹街校区-郭老师-陈品烨 (陈品烨)	14ms	6.8 MiB		163 Bytes	2023-10-2 13:31:25
AC	hxb	14ms	436 KiB		145 Bytes	2022-9-17 17:58:46
AC	李旻轩	14ms	384 KiB		213 Bytes	2023-4-1 9:08:58
AC	执剑人罗辑 (Jasson)	14ms	512 KiB		146 Bytes	2022-10-23 20:48:51
AC	何煜琦	14ms	6.9 MiB	C++11	89 Bytes	2024-8-23 16:21:00
AC	金沙校区-王俊元 (王俊元)	14ms	6.7 MiB		159 Bytes	2023-9-23 21:52:20
AC	何星震 (Jacob)	14ms	388 KiB		130 Bytes	2022-10-16 10:32:35
AC	何欣洋	14ms	508 KiB		140 Bytes	2023-2-11 11:51:52
AC	罗竣瀚	14ms	436 KiB		130 Bytes	2022-9-12 21:10:02
AC	王若衡 (wangruoheng)	14ms	388 KiB		168 Bytes	2023-5-26 20:58:33
AC	wky	14ms	440 KiB		185 Bytes	2022-10-28 23:10:59
AC	明哲瀚 (18580067605)	14ms	384 KiB		169 Bytes	2022-10-7 16:46:17
AC	南坪校区-田治铭 (tian zhi ming)	14ms	7.2 MiB	C++98	152 Bytes	2024-4-25 18:31:07
AC	时代一校蒋帛希 (13983392730)	14ms	512 KiB		129 Bytes	2022-10-23 17:55:36
AC	源著校区-惠予宸 (huiyuchen2)	14ms	384 KiB		117 Bytes	2023-3-12 12:55:40
AC	天之渺 (05c41-dd)	14ms	392 KiB		169 Bytes	2022-10-23 11:52:38
AC	wangtan	14ms	448 KiB		164 Bytes	2023-5-9 15:26:43
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	392 KiB		159 Bytes	2022-9-17 16:59:48
AC	陈骏逸 (chenjunyi)	14ms	512 KiB		228 Bytes	2022-8-10 17:30:14