大象喝水

状态	递交者	时间	内存	语言	代码	递交时间
AC	李睿杰	14ms	8.2 MiB		152 Bytes	2022-9-11 19:48:17
AC	南坪校区-邵冠铖 (邵冠铖)	14ms	6.8 MiB		234 Bytes	2023-10-26 22:10:07
AC	王韵淮	14ms	8.2 MiB		142 Bytes	2022-4-17 9:39:43
AC	郑岐蔚	14ms	8.2 MiB		149 Bytes	2023-3-11 13:33:42
AC	偽艺術家 (chenyanchi22006)	14ms	8.2 MiB		215 Bytes	2022-8-20 15:19:06
AC	贾博涵	14ms	6.8 MiB		183 Bytes	2023-11-1 11:34:13
AC	zyb小号	14ms	6.7 MiB		169 Bytes	2023-9-17 21:39:11
AC	6 (HIMMZXC1)	14ms	8.2 MiB		223 Bytes	2023-5-21 14:52:03
AC	heyi	14ms	6.8 MiB	C++98(O2)	145 Bytes	2024-8-6 14:21:25
AC	摩拉克斯	14ms	8.2 MiB		239 Bytes	2023-7-7 10:29:22
AC	魑归sama	14ms	8.2 MiB		226 Bytes	2022-7-13 19:56:03
AC	刘政君 (lzj)	14ms	8.2 MiB		192 Bytes	2022-8-31 14:35:56
AC	陈秋石	14ms	8.2 MiB		440 Bytes	2022-6-4 20:39:39
AC	56 (13883454928)	14ms	8.2 MiB		203 Bytes	2023-3-23 20:11:54
AC	徐康景 (dcm)	14ms	8.2 MiB		211 Bytes	2023-1-14 14:20:55
AC	MoonLight ( aaa)	14ms	8.2 MiB		530 Bytes	2022-1-1 9:29:46
AC	Keter (zzh)	14ms	8.2 MiB		222 Bytes	2023-7-8 19:59:26
AC	极为的好van的 (lyq)	14ms	8.2 MiB		189 Bytes	2022-9-17 14:13:51
AC	汪筱淞	14ms	8.2 MiB		455 Bytes	2022-7-1 18:22:56
AC	(-v-)ikun ((-v-))	14ms	8.2 MiB		226 Bytes	2022-9-11 13:30:46
AC	司泰源	14ms	8.2 MiB		216 Bytes	2022-3-2 22:38:23
AC	新壹街校区-罗斤天 (罗斤天)	14ms	8.2 MiB		430 Bytes	2023-7-9 13:39:56
AC	三藏的痔疮 (不会玩是原罪)	14ms	8.2 MiB		138 Bytes	2022-1-20 13:56:09
AC	lvlu	14ms	8.2 MiB		201 Bytes	2022-7-23 16:56:53
AC	kapurua	14ms	8.2 MiB		203 Bytes	2023-7-17 19:51:48
AC	汪致卉 (wangzh)	14ms	8.2 MiB		227 Bytes	2022-1-24 18:23:49
AC	ttt123	14ms	8.2 MiB		172 Bytes	2023-4-19 22:46:59
AC	Tang	14ms	8.2 MiB		179 Bytes	2022-4-23 13:54:15
AC	谭懿轩 (yanyixuan)	14ms	8.2 MiB		160 Bytes	2022-3-17 16:45:43
AC	colin1112 (墙凌可)	14ms	8.2 MiB		242 Bytes	2023-1-22 12:19:20
AC	傅博涛	14ms	8.2 MiB		154 Bytes	2022-5-8 12:05:07
AC	luoluonuoya	14ms	8.2 MiB		181 Bytes	2022-1-23 16:38:22
AC	新一街校区Jason_LuoYouZheng (罗友峥)	15ms	8.2 MiB		287 Bytes	2023-3-13 21:50:34
AC	梦之泪伤	15ms	8.2 MiB		209 Bytes	2022-2-11 21:18:51
AC	April	15ms	6.8 MiB		217 Bytes	2023-11-5 20:56:42
AC	经常消失 (小萝卜)	15ms	8.2 MiB		236 Bytes	2022-3-21 20:13:25
AC	段淏泷	15ms	7 MiB	C++98	217 Bytes	2024-6-23 13:29:53
AC	张皓南2	15ms	8.2 MiB		199 Bytes	2022-8-28 15:53:05
AC	除了我全部人都是SB (车涌樯)	15ms	8.2 MiB		173 Bytes	2023-7-18 14:40:03
AC	没有此人 (akm)	15ms	8.2 MiB		226 Bytes	2022-9-4 1:26:52
AC	任童(rentong)	15ms	8.2 MiB		274 Bytes	2022-7-6 16:25:46
AC	kkksc03 (彭士锋)	15ms	8.2 MiB		245 Bytes	2022-3-5 13:40:43
AC	zhuziyu	15ms	8.2 MiB		202 Bytes	2022-2-19 10:15:59
AC	fjy1	15ms	8.2 MiB		205 Bytes	2022-11-27 12:27:50
AC	许炜铭 (xuweiming)	15ms	8.2 MiB		146 Bytes	2023-6-10 14:09:37
AC	dengfeng	15ms	8.2 MiB		232 Bytes	2022-2-10 17:04:55
AC	鲜榨大肠汁	15ms	8.2 MiB		226 Bytes	2022-3-9 20:58:29
AC	_PXY_	15ms	8.2 MiB		175 Bytes	2022-1-25 13:39:26
AC	李山水	15ms	8.2 MiB		166 Bytes	2022-5-14 18:17:48
AC	金锦泽 (jinjinze)	15ms	6.8 MiB		158 Bytes	2023-10-4 12:55:03
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)	15ms	8.2 MiB		265 Bytes	2023-5-27 17:06:50
AC	05c35-hhw	15ms	8.2 MiB		226 Bytes	2022-3-19 20:46:02
AC	冒牌陈杰晟【MOD】 (wed)	15ms	8.2 MiB		227 Bytes	2022-3-6 15:16:32
AC	伍芷函	15ms	8.2 MiB		173 Bytes	2022-9-4 21:50:03
AC	樊竣熠 (lft1114)	15ms	8.2 MiB		221 Bytes	2022-3-10 18:21:40
AC	向峻熙 (xiangjunxi)	15ms	8.2 MiB		192 Bytes	2022-7-26 15:12:00
AC	李树崑 (lishukun)	15ms	8.2 MiB		344 Bytes	2022-3-25 20:15:46
AC	稻妻第一深情 (喝酒の吟游诗人)	15ms	8.2 MiB		1.3 KiB	2023-1-9 20:16:36
AC	源著校区-宋昊成 (马冬梅)	15ms	8.2 MiB		165 Bytes	2023-2-25 16:52:49
AC	(张洛诚)	15ms	8.1 MiB		231 Bytes	2023-7-25 17:01:08
AC	黄立信	15ms	8.2 MiB		199 Bytes	2023-6-22 17:28:58
AC	杜是贤 (dushixian)	15ms	8.2 MiB		216 Bytes	2022-2-8 17:38:47
AC	majinhui	15ms	8.2 MiB		430 Bytes	2022-7-20 16:27:46
AC	周琪渃	15ms	8.2 MiB		232 Bytes	2022-12-10 16:04:23
AC	向峻熙 (xiangjunxi)	15ms	8.2 MiB		206 Bytes	2022-7-26 15:12:05
AC	AG.一诺	15ms	8.2 MiB		144 Bytes	2022-3-11 21:40:59
AC	11451254188 (22029-mjh)	15ms	8.2 MiB		424 Bytes	2022-11-13 11:05:48
AC	xuniaoyin (徐袅音)	15ms	8.2 MiB		171 Bytes	2023-7-30 10:53:13
AC	时代2校-程俊燃 (chengjunran)	15ms	8.2 MiB		226 Bytes	2023-8-17 20:24:28
AC	阮 (媚狐不吃道旁李)	15ms	8.2 MiB		163 Bytes	2023-3-26 13:22:30
AC	杨皓宇 (yanghaoyu)	15ms	6.8 MiB		203 Bytes	2023-10-21 8:43:17
AC	疯神芭芭脱丝 (李卓修)	15ms	8.2 MiB		174 Bytes	2022-1-23 16:00:59
AC	soha (武夷岩)	15ms	8.2 MiB		176 Bytes	2022-7-13 19:48:12
AC	张泰凌 (ztl)	15ms	8.2 MiB		276 Bytes	2022-3-18 9:39:38
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	8.1 MiB		213 Bytes	2023-7-21 11:10:51
AC	zlx (xiao)	15ms	8.2 MiB		281 Bytes	2022-5-24 21:20:05
AC	董博煜	15ms	8.2 MiB		159 Bytes	2022-8-24 22:01:40
AC	杨洋	15ms	7.2 MiB	C++98	186 Bytes	2024-4-21 13:45:52
AC	汪致卉 (wangzh)	15ms	8.2 MiB		216 Bytes	2022-5-20 20:58:04
AC	刘鹤枫 (liuhefeng)	15ms	8.2 MiB		161 Bytes	2022-8-6 14:11:23
AC	李睿杰	15ms	8.2 MiB		170 Bytes	2022-9-11 19:51:52
AC	刘思齐	15ms	6.6 MiB	C++98	153 Bytes	2024-7-30 14:33:17
AC	zzt	15ms	8.2 MiB		227 Bytes	2022-3-25 19:44:33
AC	诸禹吉 (zhuyuji)	15ms	8.2 MiB		242 Bytes	2022-3-19 8:29:34
AC	邓皓天 (1234567A)	15ms	6.8 MiB		197 Bytes	2023-10-9 18:46:35
AC	吴俊成 (wujuncheng)	15ms	8.2 MiB		228 Bytes	2022-7-8 22:50:25
AC	zhm123	15ms	8.1 MiB		139 Bytes	2023-7-27 14:34:08
AC	叶哲宇 (yzy)	15ms	8.2 MiB		184 Bytes	2023-3-18 21:10:51
AC	林小博	15ms	8.2 MiB		276 Bytes	2022-9-24 16:28:26
AC	曹星羽	15ms	7.1 MiB		205 Bytes	2024-1-1 12:22:00
AC	李彭宋代诗人 (ljy123456)	15ms	8.2 MiB		234 Bytes	2023-4-3 20:57:46
AC	贾鑫豪 (Mr Sam)	15ms	8.2 MiB		216 Bytes	2022-4-17 11:14:45
AC	dafu	15ms	8.2 MiB		186 Bytes	2023-4-4 23:54:29
AC	longhao	15ms	8.2 MiB		227 Bytes	2022-1-23 9:04:44
AC	源著校区-宋昊成 (马冬梅)	15ms	8.2 MiB		165 Bytes	2023-2-25 16:53:01
AC	(金沙天街)严皓月 (严皓月)	15ms	8.1 MiB		244 Bytes	2023-7-22 10:33:41
AC	wzzjnb2012	15ms	8.2 MiB		230 Bytes	2022-9-20 21:16:44
AC	NJL (NJlL)	15ms	8.2 MiB		227 Bytes	2022-3-27 18:17:03
AC	杨坤霖 (steven)	15ms	8.2 MiB		195 Bytes	2023-1-10 14:41:33
AC	啊...这 (炼狱杏寿郎)	15ms	8.2 MiB		245 Bytes	2023-1-11 16:38:36