成年人判断3

状态	递交者	时间	内存	语言	代码	递交时间
AC	南坪校区-淡昌盛 (Dancs)	14ms	8.1 MiB		368 Bytes	2023-2-18 11:30:40
AC	sunsihan	14ms	8.1 MiB		338 Bytes	2023-4-1 11:33:45
AC	我全家SB！！！我没母！！！ (baijinlin)	14ms	8.1 MiB		468 Bytes	2023-2-18 16:32:35
AC	曹埊睿 (caodirui)	14ms	8.1 MiB		292 Bytes	2023-3-22 21:42:49
AC	xuaonan	14ms	8.1 MiB		275 Bytes	2022-2-20 13:40:46
AC	印昭旭（412） (印昭旭)	14ms	8.1 MiB		236 Bytes	2023-7-1 9:11:14
AC	yiqiuyu	14ms	8.1 MiB		405 Bytes	2023-2-18 16:32:12
AC	12345	14ms	8.1 MiB		370 Bytes	2022-2-26 15:35:55
AC	zhanglianchen	14ms	8.1 MiB		358 Bytes	2023-2-18 16:32:15
AC	黄相茗	14ms	8.1 MiB		339 Bytes	2022-4-6 21:25:28
AC	yxj	14ms	8.1 MiB		382 Bytes	2022-10-20 15:31:33
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:58:57
AC	杨皓宇 (杨浩宇)	14ms	8.1 MiB		381 Bytes	2022-8-5 15:37:09
AC	Steven (王梓丞)	14ms	8.1 MiB		390 Bytes	2022-4-9 15:04:10
AC	lch (凌昌瀚)	14ms	8.1 MiB		299 Bytes	2022-4-23 9:41:51
AC	yanxiaosong	14ms	8.1 MiB		369 Bytes	2022-4-4 20:36:20
AC	罗伟杰 (13308275065)	14ms	8.1 MiB		377 Bytes	2022-10-29 13:26:10
AC	wzzjnb2012	14ms	8.1 MiB		314 Bytes	2022-9-29 11:44:30
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:09
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	14ms	8.1 MiB		318 Bytes	2022-7-9 9:09:53
AC	wangmulai	14ms	8.1 MiB		288 Bytes	2022-12-25 14:19:43
AC	曹元明	14ms	8.1 MiB		340 Bytes	2022-4-23 9:36:43
AC	yinhhhhhhhhhhhh	14ms	8.1 MiB		353 Bytes	2023-6-7 15:33:26
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:05:44
AC	刘沄熙	14ms	8.1 MiB		386 Bytes	2022-2-27 10:54:36
AC	殷梓琦	14ms	8.1 MiB		392 Bytes	2023-6-11 8:57:40
AC	林子沫awa (linziyue)	14ms	8.1 MiB		386 Bytes	2023-3-16 22:40:37
AC	德克萨斯做的到吗 (liyangbao)	14ms	8.1 MiB		410 Bytes	2022-11-4 23:28:01
AC	zhangxs	14ms	8.1 MiB		342 Bytes	2023-6-11 16:05:02
AC	赵彬鸿	14ms	8.1 MiB		391 Bytes	2022-1-27 15:58:46
AC	吵吵小小 (超级小白)	14ms	8.1 MiB		361 Bytes	2023-2-19 15:32:41
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:08
AC	10255	14ms	8.1 MiB		266 Bytes	2022-12-25 14:29:07
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:00
AC	22029-hqh	14ms	8.1 MiB		395 Bytes	2023-5-20 11:16:31
AC	hxb	14ms	8.1 MiB		352 Bytes	2023-3-24 22:59:36
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:06:07
AC	刘灵熙	14ms	7.4 MiB	C++11	381 Bytes	2024-4-21 11:20:01
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:59:09
AC	俞文博	14ms	8.1 MiB		352 Bytes	2022-4-9 20:09:21
AC	赵彬鸿	14ms	8.1 MiB		392 Bytes	2022-1-27 15:58:52
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	8.1 MiB		292 Bytes	2023-3-4 17:45:41
AC	22029-hqh	14ms	8.1 MiB		395 Bytes	2023-5-20 11:16:32
AC	时代一校蒋帛希 (13983392730)	14ms	8.1 MiB		314 Bytes	2022-9-15 21:23:13
AC	WangXi	14ms	8.1 MiB		321 Bytes	2022-9-10 19:33:20
AC	赵彬鸿	14ms	8.1 MiB		391 Bytes	2022-1-27 15:58:46
AC	SYC0226	14ms	8.1 MiB		366 Bytes	2022-3-13 13:22:37
AC	执剑人罗辑 (Jasson)	14ms	8.1 MiB		330 Bytes	2022-9-12 15:01:10
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	8.1 MiB		386 Bytes	2022-10-2 11:00:36
AC	赵彬鸿	14ms	8.1 MiB		391 Bytes	2022-1-27 15:58:43
AC	chen (peter)	14ms	8.1 MiB		322 Bytes	2022-3-13 12:55:13
AC	陈思博	14ms	8.1 MiB		399 Bytes	2022-1-22 19:04:11
AC	曾龙兮	14ms	8.1 MiB		299 Bytes	2022-10-16 16:24:14
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:07
AC	yu (赵子瑜)	14ms	8.1 MiB		319 Bytes	2022-3-2 20:07:44
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:06:04
AC	陈于硕(我™的) (chenyu)	14ms	8.1 MiB		430 Bytes	2023-2-18 11:24:44
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:48:55
AC	俞伏羲	14ms	8.1 MiB		367 Bytes	2023-2-19 15:18:25
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:08
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)	14ms	8.1 MiB		327 Bytes	2023-5-15 19:15:57
AC	Stephen Stevenson	14ms	8.1 MiB		355 Bytes	2022-12-22 20:15:55
AC	德意志第三帝国 (陈远桥)	14ms	8.1 MiB		339 Bytes	2022-5-1 15:25:27
AC	GYZ	14ms	8.1 MiB		488 Bytes	2022-5-15 20:17:31
AC	TBB (杜昊燃)	14ms	8.1 MiB		371 Bytes	2022-5-3 23:54:35
AC	神印王座	14ms	8.1 MiB		387 Bytes	2022-9-17 15:41:54
AC	hulang	14ms	8.1 MiB		460 Bytes	2022-2-13 18:22:48
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:59:04
AC	曲奇饼干	14ms	8.1 MiB		396 Bytes	2022-12-11 11:17:47
AC	郭人瑀 (guorenyu)	14ms	8.1 MiB		294 Bytes	2022-7-17 22:11:14
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:05:46
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:05:52
AC	yixingyou	14ms	8.1 MiB		593 Bytes	2022-6-25 17:37:31
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:59:11
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:05:51
AC	新一街校区Jason_LuoYouZheng (罗友峥)	14ms	8.1 MiB		387 Bytes	2023-3-15 20:55:33
AC	杨淇瑞 (杨淇瑞29)	14ms	8.1 MiB		466 Bytes	2023-4-19 20:29:54
AC	quzhibo	14ms	8.1 MiB		288 Bytes	2022-6-25 17:33:33
AC	什蒂尔布 (吴东航)	14ms	8.1 MiB		342 Bytes	2022-7-27 16:18:01
AC	辛俊居	14ms	8.1 MiB		367 Bytes	2022-2-14 15:55:23
AC	22029-hqh	14ms	8.1 MiB		395 Bytes	2023-5-20 11:16:32
AC	詹宇航 (zyh7)	14ms	8.1 MiB		318 Bytes	2022-6-12 21:00:49
AC	月下的九尾银狐	14ms	8.1 MiB		354 Bytes	2023-6-17 9:56:08
AC	大马猴 (周琳竣)	14ms	8.1 MiB		330 Bytes	2023-7-26 19:25:19
AC	刘昊臻 (liuhaozhen)	14ms	8.1 MiB		317 Bytes	2023-2-21 20:37:35
AC	六 (江智昕)	14ms	8.1 MiB		407 Bytes	2022-12-29 18:05:49
AC	新壹街-王俊博 (王俊博)	14ms	8.1 MiB		272 Bytes	2023-7-10 13:33:23
AC	小忙果 (王昱杰)	14ms	8.1 MiB		317 Bytes	2023-2-9 20:35:37
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:59:05
AC	炸鱼4000+ (dxc)	14ms	8.1 MiB		359 Bytes	2023-1-23 11:58:58
AC	kkksc03 (彭士锋)	14ms	8.1 MiB		291 Bytes	2022-3-5 15:26:47
AC	luoluonuoya	14ms	8.1 MiB		339 Bytes	2022-1-25 11:54:22
AC	蔡宇皓	14ms	8.1 MiB		298 Bytes	2023-2-15 19:57:54
AC	啊...这 (炼狱杏寿郎)	14ms	8.1 MiB		370 Bytes	2022-7-1 10:55:25
AC	wky	14ms	8.1 MiB		398 Bytes	2022-4-4 17:50:21
AC	明哲瀚 (18580067605)	14ms	8.1 MiB		439 Bytes	2022-9-12 14:37:18
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:03
AC	吴思谛 (wusidi)	14ms	8.1 MiB		404 Bytes	2022-4-23 9:49:04
AC	源著校区-宋昊成 (马冬梅)	14ms	8.1 MiB		403 Bytes	2023-2-25 18:00:22
AC	经常消失 (小萝卜)	14ms	8.1 MiB		445 Bytes	2022-1-24 15:27:48