成年人判断2

状态	递交者	时间	内存	语言	代码	递交时间
AC	吴思谛	12ms	384 KiB		178 Bytes	2022-1-27 15:44:46
AC	hnd (陈皓洋)	12ms	512 KiB		193 Bytes	2022-8-22 11:03:56
AC	源著校区-宋昊成 (马冬梅)	12ms	436 KiB		181 Bytes	2023-2-25 17:59:11
AC	金沙校区-李嘉齐 (李嘉齐)	12ms	6.8 MiB		144 Bytes	2023-10-24 20:19:50
AC	曹元明	12ms	392 KiB		121 Bytes	2022-4-16 11:09:09
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	12ms	440 KiB		126 Bytes	2022-8-9 21:01:42
AC	zhangyouze (张佑泽)	12ms	432 KiB		160 Bytes	2023-2-26 16:40:56
AC	huyinuo	12ms	432 KiB		149 Bytes	2022-2-20 15:32:36
AC	雷承翰1	12ms	384 KiB		145 Bytes	2023-2-11 20:28:46
AC	zzzrrrxxx	12ms	6.9 MiB		140 Bytes	2023-7-12 19:12:56
AC	小土豆 (liuzirui2)	12ms	6.8 MiB		148 Bytes	2023-9-23 15:12:44
AC	zvt_132 (任子轩)	12ms	6.8 MiB		121 Bytes	2023-9-23 15:17:26
AC	郑尧 (zhengyao)	12ms	436 KiB		164 Bytes	2023-4-22 11:32:58
AC	zhanglianjie	12ms	392 KiB		196 Bytes	2023-2-18 16:16:37
AC	江坤锜	12ms	512 KiB		175 Bytes	2023-2-1 16:06:18
AC	雷诺伊尔 (崔金鹏)	12ms	6.8 MiB	C++20	163 Bytes	2024-8-9 20:06:23
AC	刘骏峰1	12ms	7.2 MiB	C++98	186 Bytes	2024-4-21 10:25:16
AC	罗一鸣	12ms	6.8 MiB		184 Bytes	2023-10-15 16:25:49
AC	zzy	12ms	384 KiB		153 Bytes	2023-4-8 15:52:11
AC	刘思齐	12ms	7 MiB	C++98	181 Bytes	2024-6-26 18:28:08
AC	何欣洋	12ms	384 KiB		144 Bytes	2023-2-18 11:28:00
AC	zhuqiwei22006	12ms	440 KiB		129 Bytes	2022-6-9 20:32:09
AC	heyi	12ms	6.8 MiB	C++98(O2)	144 Bytes	2024-8-8 13:22:41
AC	靳博然 (jbr)	12ms	440 KiB		164 Bytes	2023-4-9 17:37:02
AC	杨睎尧	12ms	400 KiB		175 Bytes	2022-1-26 15:46:01
AC	wangxingyue	12ms	384 KiB		135 Bytes	2022-1-24 19:10:05
AC	林昱霏	12ms	512 KiB		150 Bytes	2022-8-19 14:13:31
AC	Guest	12ms	6.7 MiB	C++98(O2)	151 Bytes	2024-8-2 13:49:24
AC	六 (江智昕)	12ms	384 KiB		171 Bytes	2022-12-29 17:02:21
AC	TJW唐嘉文	12ms	512 KiB		162 Bytes	2022-4-28 19:52:48
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)	12ms	512 KiB		146 Bytes	2023-5-15 19:12:40
AC	钟京润	12ms	384 KiB		147 Bytes	2022-4-5 14:08:02
AC	AAA? Prow max (hechenxuan23005)	12ms	6.7 MiB		147 Bytes	2023-9-23 20:58:38
AC	scallway	12ms	436 KiB		135 Bytes	2022-6-24 14:36:39
AC	yu (赵子瑜)	12ms	384 KiB		160 Bytes	2022-3-2 20:06:18
AC	oj刘	12ms	6.7 MiB		158 Bytes	2023-9-30 16:33:45
AC	六 (江智昕)	13ms	384 KiB		171 Bytes	2022-12-29 17:02:25
AC	时代1校-杨宇轩 (杨宇轩)	13ms	7.2 MiB	C++11	166 Bytes	2024-4-21 9:50:50
AC	曹雅萱	13ms	7 MiB	C++11	184 Bytes	2024-8-24 14:19:25
AC	侯治鋆	13ms	384 KiB		131 Bytes	2022-3-20 17:25:05
AC	文硕 (文硕1)	13ms	512 KiB		162 Bytes	2022-2-6 13:43:30
AC	南坪校区-郑力博 (zhenglibo23003)	13ms	384 KiB		174 Bytes	2023-2-18 16:13:03
AC	六 (江智昕)	13ms	392 KiB		171 Bytes	2022-12-29 17:02:20
AC	22029-hqh	13ms	384 KiB		173 Bytes	2023-5-20 11:04:04
AC	李樊駁	13ms	412 KiB		135 Bytes	2023-2-19 15:12:57
AC	蔡宇皓	13ms	436 KiB		142 Bytes	2023-2-15 19:35:15
AC	luoluonuoya	13ms	384 KiB		144 Bytes	2022-1-25 11:51:06
AC	zhangxinyue	13ms	512 KiB		131 Bytes	2022-11-12 11:22:37
AC	吴恩子	13ms	6.8 MiB		176 Bytes	2023-10-10 20:37:40
AC	wangziji	13ms	392 KiB		140 Bytes	2023-3-18 9:30:20
AC	aoyu22003	13ms	384 KiB		167 Bytes	2023-2-18 16:37:19
AC	傅博涛	13ms	420 KiB		138 Bytes	2022-1-22 10:44:46
AC	zhaohaotong	13ms	452 KiB		184 Bytes	2022-7-28 11:36:23
AC	铁牛杰哥官方频道	13ms	384 KiB		177 Bytes	2022-3-9 20:22:18
AC	蒋丁非凡	13ms	512 KiB		169 Bytes	2023-5-11 18:39:40
AC	六 (江智昕)	13ms	388 KiB		171 Bytes	2022-12-29 17:02:28
AC	明哲瀚 (18580067605)	13ms	448 KiB		173 Bytes	2022-9-13 22:44:50
AC	谭懿轩 (yanyixuan)	13ms	436 KiB		139 Bytes	2022-2-15 13:38:25
AC	我全家SB！！！我没母！！！ (baijinlin)	13ms	512 KiB		201 Bytes	2023-2-18 16:18:50
AC	重庆新壹街-钟政鑫 (钟政鑫)	13ms	6.8 MiB		135 Bytes	2023-10-9 19:32:38
AC	chenyifei	13ms	384 KiB		193 Bytes	2022-4-16 20:08:55
AC	zhr	13ms	512 KiB		172 Bytes	2023-4-16 17:17:35
AC	爱琴海校区-胡靖欢 (胡靖欢1)	13ms	384 KiB		171 Bytes	2023-3-4 9:28:22
AC	牟淳雅	13ms	6.7 MiB		154 Bytes	2023-9-24 10:42:51
AC	陈杰晟	13ms	444 KiB		206 Bytes	2022-2-19 8:54:12
AC	yuchenyi23017	13ms	6.7 MiB		150 Bytes	2023-9-17 19:19:19
AC	wanghuaiying	13ms	7.1 MiB		146 Bytes	2023-10-28 11:20:16
AC	王瀚毅 (wanghanyi)	13ms	384 KiB		171 Bytes	2022-10-16 10:50:55
AC	六 (江智昕)	13ms	392 KiB		171 Bytes	2022-12-29 17:02:28
AC	lafuzbc	13ms	436 KiB		149 Bytes	2022-7-17 15:54:32
AC	quzhibo	13ms	384 KiB		139 Bytes	2022-6-25 17:21:29
AC	huangjuner23003	13ms	384 KiB		178 Bytes	2023-2-18 16:21:11
AC	张泰凌 (ztl)	13ms	436 KiB		156 Bytes	2022-3-19 11:12:00
AC	新壹街校区-陈琬舒 (空空大师)	13ms	6.8 MiB		138 Bytes	2023-10-8 19:23:11
AC	六 (江智昕)	13ms	384 KiB		171 Bytes	2022-12-29 17:02:19
AC	谢靳骁 (XJX)	13ms	384 KiB		154 Bytes	2023-3-19 18:21:53
AC	胡津豪11	13ms	6.8 MiB		176 Bytes	2023-10-3 15:11:57
AC	强者 (hhy)	13ms	384 KiB		152 Bytes	2023-4-8 11:12:37
AC	熊瑾瑜	13ms	440 KiB		146 Bytes	2023-2-18 11:33:39
AC	伍芷函	13ms	448 KiB		196 Bytes	2022-9-11 14:19:10
AC	况奕辛 (KYX_yyds)	13ms	384 KiB		200 Bytes	2022-1-2 19:53:20
AC	wangyueru	13ms	436 KiB		149 Bytes	2022-9-10 19:17:23
AC	陈红恺 (chk)	13ms	440 KiB		135 Bytes	2022-8-15 17:20:51
AC	yu (赵子瑜)	13ms	384 KiB		160 Bytes	2022-3-2 20:06:17
AC	xxteacher	13ms	400 KiB		252 Bytes	2022-1-28 12:24:41
AC	林小博	13ms	384 KiB		173 Bytes	2022-3-5 10:48:21
AC	zhangxs	13ms	7 MiB		150 Bytes	2023-6-11 15:45:54
AC	韩思辰 (hansichen)	13ms	392 KiB		155 Bytes	2022-11-12 11:21:49
AC	拥抱幸福小熊(吴沛篪)	13ms	7.5 MiB		144 Bytes	2023-10-28 11:17:17
AC	罗一鸣	13ms	6.8 MiB		184 Bytes	2023-10-15 16:25:01
AC	xuaonan	13ms	512 KiB		159 Bytes	2022-2-20 13:40:16
AC	刘蕤箎	13ms	384 KiB		135 Bytes	2023-4-8 11:12:24
AC	彭熙芮	13ms	6.7 MiB		143 Bytes	2023-9-5 21:30:37
AC	方子谦 (方子谦00)	13ms	384 KiB		219 Bytes	2022-2-27 11:25:09
AC	yangbinyu	13ms	432 KiB		184 Bytes	2022-9-20 21:15:46
AC	六 (江智昕)	13ms	384 KiB		171 Bytes	2022-12-29 17:02:20
AC	曹烜豪	13ms	384 KiB		160 Bytes	2023-2-11 20:27:37
AC	罗元邑	13ms	428 KiB		154 Bytes	2023-2-17 19:35:30
AC	陈忝锐	13ms	440 KiB		154 Bytes	2022-4-19 19:18:30
AC	蒲梓勋 (puzixun)	13ms	432 KiB		188 Bytes	2022-7-18 19:54:26