百元百鸡问题

状态	递交者	时间	内存	语言	代码	递交时间
AC	罗晨睿 (luochenrui)	2ms	384 KiB		266 Bytes	2022-9-4 14:20:00
AC	陈雨泽1	2ms	384 KiB		297 Bytes	2023-2-18 11:17:49
AC	scallway	2ms	6.7 MiB		248 Bytes	2023-8-9 14:54:43
AC	chenxiyu	2ms	360 KiB		253 Bytes	2023-2-16 19:03:07
AC	李禹衡 (liyuheng22006)	2ms	384 KiB		386 Bytes	2023-2-27 21:09:52
AC	余晨浩 (yuchenhao)	2ms	384 KiB		249 Bytes	2022-9-4 14:20:42
AC	yanglang	2ms	384 KiB		235 Bytes	2022-10-22 21:07:28
AC	hxb	2ms	384 KiB		280 Bytes	2023-2-18 9:56:55
AC	安闵煜 (anzai)	2ms	6.5 MiB		323 Bytes	2023-6-4 9:58:16
AC	余晨浩 (yuchenhao)	2ms	384 KiB		249 Bytes	2022-9-4 14:20:41
AC	ganlin1	2ms	6.9 MiB		233 Bytes	2023-7-19 18:12:14
AC	1396013295	2ms	384 KiB		380 Bytes	2022-1-24 12:36:12
AC	黄梓桐 (HuangZiTong)	2ms	384 KiB		259 Bytes	2022-7-11 18:37:35
AC	疯神芭芭脱丝 (李卓修)	2ms	384 KiB		270 Bytes	2022-7-9 19:01:53
AC	黄梓轩 (huangzixuan)	2ms	384 KiB		257 Bytes	2023-5-14 14:12:05
AC	zhm123	2ms	384 KiB		225 Bytes	2022-10-24 18:18:12
AC	余晨浩 (yuchenhao)	2ms	360 KiB		249 Bytes	2022-9-4 14:20:41
AC	时代2校-程俊燃 (chengjunran)	2ms	6.8 MiB		288 Bytes	2023-7-1 16:12:12
AC	肖添宇	2ms	384 KiB		287 Bytes	2022-3-19 17:54:53
AC	何定谦 (hdq)	2ms	6.8 MiB		260 Bytes	2023-6-28 12:27:03
AC	贾博涵	2ms	6.8 MiB		309 Bytes	2023-11-8 12:41:12
AC	谭懿轩 (yanyixuan)	2ms	384 KiB		265 Bytes	2022-2-19 8:55:15
AC	灿灿 (CAN)	2ms	372 KiB		467 Bytes	2022-7-5 16:50:16
AC	余晨浩 (yuchenhao)	2ms	384 KiB		249 Bytes	2022-9-4 14:20:43
AC	朱泽晟	2ms	392 KiB		427 Bytes	2022-1-28 21:34:14
AC	贾博涵	2ms	6.8 MiB		277 Bytes	2023-11-8 12:40:44
AC	yang	2ms	384 KiB		396 Bytes	2022-8-15 15:37:17
AC	不怎么聪明的家伙 (贺俊楠)	2ms	384 KiB		232 Bytes	2023-5-28 11:56:19
AC	yxj	2ms	384 KiB		248 Bytes	2022-10-20 16:04:50
AC	周子涵	2ms	384 KiB		259 Bytes	2022-10-1 15:18:44
AC	dengfeng	2ms	384 KiB		316 Bytes	2022-3-17 14:01:25
AC	德克萨斯做的到吗 (liyangbao)	2ms	384 KiB		210 Bytes	2022-11-13 23:27:39
AC	Tender. (05c05-zhou)	2ms	384 KiB		431 Bytes	2022-10-17 20:40:56
AC	朱老师 (zyp)	2ms	384 KiB		313 Bytes	2022-8-6 10:03:47
AC	huyinuo	2ms	392 KiB		330 Bytes	2022-4-24 22:59:17
AC	GYZ	2ms	384 KiB		466 Bytes	2022-5-15 20:28:29
AC	zyq1	2ms	384 KiB		241 Bytes	2023-5-9 19:58:34
AC	Erin	2ms	6.9 MiB	C++98	233 Bytes	2024-5-3 20:10:31
AC	张子扬	2ms	384 KiB		371 Bytes	2022-1-24 19:18:51
AC	时代一校-赵彦博 (zyb)	2ms	384 KiB		265 Bytes	2023-4-9 20:22:35
AC	不怎么聪明的家伙 (贺俊楠)	2ms	384 KiB		232 Bytes	2023-5-28 10:34:54
AC	殷语函	2ms	6.7 MiB		288 Bytes	2023-6-29 9:53:37
AC	龙思颖 (lsy)	2ms	6.9 MiB		323 Bytes	2023-6-29 9:53:26
AC	时代校区-孔令皓 (konglinghao)	2ms	7.2 MiB	C++98	254 Bytes	2024-4-21 21:57:09
AC	代尚函笛卡尔 (daishanghan)	2ms	384 KiB		261 Bytes	2022-9-4 14:06:39
AC	缥 (王硕2012)	2ms	384 KiB		425 Bytes	2023-2-11 9:49:44
AC	任凌薇	2ms	6.5 MiB		241 Bytes	2023-8-21 17:17:31
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:45
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:46
AC	22029-lsl	2ms	384 KiB		267 Bytes	2023-2-11 9:48:24
AC	漆星语 (qixingyu)	2ms	6.9 MiB		247 Bytes	2023-6-29 9:50:30
AC	时代1校-杨宇轩 (杨宇轩)	2ms	7 MiB		243 Bytes	2023-6-29 9:57:13
AC	小翔的粉丝	2ms	6.7 MiB		247 Bytes	2023-6-29 9:56:29
AC	城市之光1	2ms	6.7 MiB		247 Bytes	2023-6-29 9:56:27
AC	洛阳锦程 (郭思利)	2ms	7 MiB	C++98	253 Bytes	2024-5-26 10:41:23
AC	maobohan	2ms	6.6 MiB		245 Bytes	2023-6-29 9:52:56
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		367 Bytes	2023-2-11 9:47:38
AC	kapurua	2ms	6.5 MiB		259 Bytes	2023-9-7 16:53:29
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:52:06
AC	Cristiano·Ronaldo (05c41-gmz)	2ms	384 KiB		240 Bytes	2022-7-27 13:41:33
AC	陈骏逸 (chenjunyi)	2ms	384 KiB		281 Bytes	2022-12-4 9:57:49
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:25
AC	zcx	2ms	384 KiB		288 Bytes	2023-2-11 9:46:21
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:28
AC	chenyifei	2ms	384 KiB		513 Bytes	2022-1-22 20:36:28
AC	杨皓宇 (yanghaoyu)	2ms	384 KiB		284 Bytes	2023-5-27 10:12:34
AC	芒苒忧 (廖迦南)	2ms	384 KiB		315 Bytes	2022-1-26 20:31:30
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:54
AC	11451254188 (22029-mjh)	2ms	384 KiB		324 Bytes	2023-2-11 9:46:20
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:45
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:54
AC	唐良瑞 (22016-tlr01)	2ms	384 KiB		295 Bytes	2023-5-28 9:59:59
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:46
AC	曾龙兮	2ms	384 KiB		263 Bytes	2023-3-19 17:37:17
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:23
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:24
AC	ttt123	2ms	384 KiB		352 Bytes	2023-2-11 9:33:34
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	2ms	384 KiB		237 Bytes	2022-10-15 16:48:01
AC	时代二校+马嘉宸 (majiachen)	2ms	6.7 MiB		258 Bytes	2023-7-1 16:11:11
AC	任舒尧	2ms	384 KiB		255 Bytes	2022-7-9 19:06:38
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51: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)	2ms	384 KiB		367 Bytes	2023-2-11 9:46:50
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:24
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:37
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:36
AC	22029-zjs	2ms	384 KiB		334 Bytes	2023-2-11 9:47:09
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:52:00
AC	谭红中 (不知道)	2ms	384 KiB		325 Bytes	2023-1-11 16:12:15
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:54
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:29
AC	dmh (丁墨涵)	2ms	384 KiB		270 Bytes	2022-2-20 14:32:18
AC	22029-hqh	2ms	360 KiB		328 Bytes	2023-2-11 9:51:46
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:52:00
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:36
AC	许炜铭 (xuweiming)	2ms	384 KiB		316 Bytes	2023-5-15 20:35:29
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:29
AC	李林峰 (金克拉)	2ms	384 KiB		344 Bytes	2023-2-18 9:45:16
AC	22029-hqh	2ms	384 KiB		328 Bytes	2023-2-11 9:51:21
AC	leisixian (22029-lyh)	2ms	384 KiB		367 Bytes	2023-3-19 9:21:47
AC	时代二校+王吕棪 (wanglvyan)	2ms	6.8 MiB		247 Bytes	2023-7-1 16:10:44