希蒙的二维数组

状态	递交者	时间	内存	语言	代码	递交时间
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	74ms	7.3 MiB	C++98	495 Bytes	2024-4-21 11:36:32
AC	ycy	104ms	7.6 MiB		610 Bytes	2023-1-8 21:41:19
AC	Harley (郑浩然)	125ms	7.2 MiB	C++98	418 Bytes	2024-5-3 16:07:18
AC	游智棋	136ms	7 MiB	C++17	442 Bytes	2024-6-9 20:23:59
AC	爱情海校区—沙天一 (沙天一)	138ms	6.8 MiB	C++98	550 Bytes	2024-8-6 18:28:46
AC	张瑞博	141ms	6.9 MiB	C++11	408 Bytes	2024-8-21 11:49:25
AC	希蒙 (zhengxingya)	142ms	7.2 MiB	C++98	631 Bytes	2024-4-20 15:47:02
AC	zzzrrrxxx	143ms	7.3 MiB	C++98	370 Bytes	2024-4-21 17:13:42
AC	曹雅萱	144ms	7.2 MiB	C++11	528 Bytes	2024-5-2 11:53:03
AC	acc	149ms	6.6 MiB	C++11	413 Bytes	2024-7-7 11:24:14
AC	lvyanshan	150ms	7 MiB	C++98	442 Bytes	2024-5-11 17:24:17
AC	xuniaoyin (徐袅音)	158ms	7.2 MiB	C++98(O2)	437 Bytes	2024-5-15 21:59:06
AC	阮 (媚狐不吃道旁李)	159ms	7.2 MiB	C++98	443 Bytes	2024-4-30 16:40:47
AC	郑尧 (zhengyao)	161ms	7.2 MiB	C++98	499 Bytes	2024-5-4 22:01:41
AC	缥 (王硕2012)	166ms	7.5 MiB		770 Bytes	2023-3-13 18:56:32
AC	jianxinming	168ms	7.2 MiB	C++98	412 Bytes	2024-4-25 21:23:37
AC	陈家熠	168ms	7.2 MiB	C++11	574 Bytes	2024-5-2 21:34:48
AC	许嘉恩 (xje22031)	168ms	6.7 MiB		450 Bytes	2023-5-11 16:48:25
AC	张玉坚 (zhangyuian)	170ms	7.6 MiB		443 Bytes	2023-3-12 16:49:34
AC	11451254188 (22029-mjh)	170ms	6.9 MiB		429 Bytes	2023-4-1 11:43:18
AC	爱情海校区—沙天一 (沙天一)	171ms	6.7 MiB		485 Bytes	2023-7-9 8:37:07
AC	何煜琦	171ms	6.9 MiB	C++11	371 Bytes	2024-8-20 16:22:10
AC	鲜榨大肠汁	172ms	6.7 MiB		510 Bytes	2023-7-7 9:45:01
AC	无尽的想象 (谭仕高)	173ms	7.3 MiB		446 Bytes	2023-3-25 13:45:12
AC	爱琴海校区-刁钲洋 (刁钲洋)	174ms	6.7 MiB		621 Bytes	2023-8-8 21:34:16
AC	疯神芭芭脱丝 (李卓修)	176ms	6.7 MiB		391 Bytes	2023-4-14 17:06:42
AC	ttt123	177ms	7.2 MiB		481 Bytes	2023-3-31 17:14:52
AC	ttt123	177ms	6.9 MiB		492 Bytes	2023-4-1 11:43:36
AC	22029-lsl	180ms	6.8 MiB		436 Bytes	2023-4-1 11:44:29
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)	180ms	6.8 MiB		588 Bytes	2023-4-1 11:45:10
AC	甄一阳 (22016-zyy)	182ms	6.8 MiB		420 Bytes	2023-4-1 17:06:03
AC	新壹街——陈学彬 (BUG)	182ms	6.7 MiB		422 Bytes	2023-7-6 9:53:17
AC	没有此人 (akm)	186ms	6.7 MiB		608 Bytes	2023-7-9 10:21:22
AC	Alduin	189ms	7.7 MiB		442 Bytes	2023-1-8 16:06:15
AC	熊奕博 (Mothefuck)	193ms	7.6 MiB		462 Bytes	2023-3-12 17:06:11
AC	sqmyb	198ms	7.5 MiB		466 Bytes	2023-3-12 18:35:42
AC	孙烽轶 (sfy)	199ms	6.7 MiB		378 Bytes	2023-4-15 19:45:51
AC	zcx	202ms	7 MiB		551 Bytes	2023-4-1 11:39:47
AC	zhm123	336ms	7.2 MiB		389 Bytes	2023-11-30 14:27:52
AC	wangjun	336ms	7 MiB		417 Bytes	2023-11-15 17:23:55
AC	姚宏逸	358ms	7 MiB		417 Bytes	2023-12-3 9:33:11