方格取数（提高组）

状态	递交者	时间	内存	语言	代码	递交时间
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)	-	7 MiB		696 Bytes	2023-11-12 11:22:38
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	-	7 MiB		873 Bytes	2023-11-12 11:14:58
AC	yuchenyi23017	-	6.9 MiB		489 Bytes	2023-12-7 22:17:47
AC	姚宏逸	1ms	256 KiB		1.7 KiB	2022-2-2 22:39:46
AC	12345	1ms	256 KiB		933 Bytes	2022-8-21 15:24:43
AC	12345	1ms	316 KiB		933 Bytes	2022-8-8 9:30:38
AC	12345	1ms	284 KiB		933 Bytes	2022-8-21 15:24:07
AC	MoonLight ( aaa)	1ms	512 KiB		904 Bytes	2022-1-26 9:34:01
AC	赵泳鑫 (zhaoyongxin)	1ms	384 KiB		276 Bytes	2022-7-15 14:57:31
AC	zlx (xiao)	1ms	384 KiB		90 Bytes	2022-11-26 20:34:33
AC	疯神芭芭脱丝 (李卓修)	1ms	384 KiB		261 Bytes	2022-7-14 18:44:51
AC	朱老师 (zyp)	1ms	512 KiB		568 Bytes	2022-7-25 14:03:55
AC	坤坤荔枝小黑子 (zhonghaotian22006)	1ms	6.8 MiB		616 Bytes	2023-10-29 18:39:43
AC	樊竣熠 (lft1114)	1ms	384 KiB		630 Bytes	2022-8-14 17:04:29
AC	蓝色妖姬 (jiangpeiyu)	1ms	436 KiB		957 Bytes	2022-11-6 15:17:36
AC	PYMcn	1ms	6.6 MiB	C++11(O2)	524 Bytes	2024-8-8 11:16:17
AC	荣耀	1ms	6.7 MiB		574 Bytes	2023-8-30 21:06:28
AC	李树崑 (lishukun)	1ms	424 KiB		817 Bytes	2022-6-25 14:56:15
AC	芒苒忧 (廖迦南)	1ms	692 KiB		574 Bytes	2022-8-2 15:59:45
AC	杨瀚霖 (yanghanlin)	2ms	6.9 MiB		792 Bytes	2023-7-9 20:14:36
AC	爱琴海校区-刁钲洋 (刁钲洋)	2ms	6.7 MiB		521 Bytes	2023-9-3 11:28:02
AC	luoluonuoya	2ms	676 KiB		575 Bytes	2022-8-14 13:52:42
AC	杜俊宏	2ms	692 KiB		602 Bytes	2022-8-10 9:00:39
AC	汪致卉 (wangzh)	2ms	548 KiB		757 Bytes	2022-2-19 22:54:53
AC	何晟瑞 (hsr01)	2ms	820 KiB		572 Bytes	2022-8-18 17:46:34
AC	何晟瑞 (hsr01)	2ms	796 KiB		545 Bytes	2022-8-10 15:27:28
AC	贾鑫豪 (Mr Sam)	2ms	436 KiB		682 Bytes	2022-11-19 14:25:50
AC	繁星 (05c35-zzm)	2ms	696 KiB		639 Bytes	2022-11-15 17:16:57
AC	何晟瑞 (hsr01)	2ms	804 KiB		572 Bytes	2022-9-25 20:51:56
AC	RanHao	2ms	6.8 MiB		639 Bytes	2023-7-20 11:30:56
AC	希蒙 (zhengxingya)	2ms	6.8 MiB	C++98	579 Bytes	2024-8-16 18:15:22
AC	关博源	2ms	512 KiB		766 Bytes	2023-3-14 19:35:12
AC	何晟瑞 (hsr01)	3ms	824 KiB		572 Bytes	2022-8-30 18:12:44
AC	明轩 (吕同学)	4ms	532 KiB		925 Bytes	2024-2-23 19:59:51
AC	新壹街—熊轩杭 (xiongxuanhang)	5ms	7.3 MiB		521 Bytes	2024-1-22 10:00:40
AC	liumuyunC2026	7ms	324 KiB		787 Bytes	2024-2-24 12:16:25
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	7ms	532 KiB		739 Bytes	2024-3-30 20:52:12
AC	爱琴海校区-黄辰浩 (huangchenhao)	7ms	532 KiB		572 Bytes	2024-2-25 14:14:33
AC	游智棋	8ms	764 KiB		1.7 KiB	2024-3-26 19:02:35
AC	经常消失 (小萝卜)	8ms	532 KiB		602 Bytes	2024-3-1 18:28:40
AC	wuenzi	9ms	792 KiB		521 Bytes	2024-2-21 20:23:21
AC	11451254188 (22029-mjh)	18ms	9.2 MiB	Python 3	11 Bytes	2023-11-12 11:06:06
AC	zcx	21ms	9.2 MiB	Python 3	11 Bytes	2023-11-12 11:05:56
AC	梨冻亿 (wiueh)	23ms	3.9 MiB	Python 3	9 Bytes	2022-1-23 20:43:16