好吃or不好吃

状态	递交者	时间	内存	语言	代码	递交时间
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	7ms	512 KiB		314 Bytes	2023-5-10 22:05:41
AC	陈杰晟	7ms	512 KiB		278 Bytes	2022-2-20 15:42:10
AC	WHWHWHWHWHW (OP AI)	7ms	7 MiB	C++98	396 Bytes	2024-6-17 21:16:42
AC	时代一校 - 冯隆浩 (冯隆浩)	7ms	392 KiB		356 Bytes	2022-7-2 19:13:14
AC	lby_joey	7ms	7 MiB	C++98(O2)	320 Bytes	2024-6-14 14:13:38
AC	赵泳鑫 (zhaoyongxin)	7ms	444 KiB		511 Bytes	2022-4-23 17:41:36
AC	坤坤荔枝小黑子 (zhonghaotian22006)	7ms	384 KiB		324 Bytes	2022-8-11 17:07:53
AC	Cristiano·Ronaldo (05c41-gmz)	7ms	384 KiB		302 Bytes	2022-7-27 13:39:39
AC	梨冻亿 (wiueh)	7ms	384 KiB		383 Bytes	2022-1-27 13:46:49
AC	刘沄熙	7ms	392 KiB		476 Bytes	2022-3-13 11:48:10
AC	wangxingyue	7ms	384 KiB		284 Bytes	2022-3-26 16:53:18
AC	罗兰（漆黑襟默) (zhangxiaoci)	7ms	416 KiB		359 Bytes	2022-9-12 15:21:40
AC	NJL (NJlL)	7ms	388 KiB		401 Bytes	2022-5-8 17:26:26
AC	05c05-yyc	7ms	404 KiB		291 Bytes	2022-9-4 19:19:09
AC	11111	7ms	392 KiB		248 Bytes	2022-3-27 11:20:37
AC	王韵淮	7ms	384 KiB		394 Bytes	2022-5-20 21:32:07
AC	heyuzhe	7ms	6.8 MiB	C++98	345 Bytes	2024-8-15 18:16:52
AC	金沙校区-李嘉齐 (李嘉齐)	7ms	7.1 MiB	C++98	289 Bytes	2024-5-14 20:46:29
AC	张泰凌 (ztl)	7ms	468 KiB		358 Bytes	2022-3-18 19:39:27
AC	wanghuaiying	7ms	7.1 MiB		428 Bytes	2023-11-4 11:22:46
AC	我和赵梓晴之间不是一般的亲密 (fengyuanzheng)	7ms	436 KiB		301 Bytes	2022-3-5 18:17:50
AC	冒牌陈杰晟【MOD】 (wed)	7ms	444 KiB		260 Bytes	2022-2-26 12:23:36
AC	呵呵呵 (陈思琦)	7ms	384 KiB		301 Bytes	2022-9-3 17:20:06
AC	关博源	7ms	384 KiB		266 Bytes	2023-5-4 19:16:56
AC	huyinuo	7ms	440 KiB		273 Bytes	2022-2-23 19:22:16
AC	刘蕤箎	7ms	392 KiB		309 Bytes	2023-5-24 22:30:26
AC	朱泽晟	7ms	384 KiB		277 Bytes	2022-3-26 12:08:18
AC	中岛敦 (黄麒瑞)	7ms	6.7 MiB		482 Bytes	2023-9-30 21:31:21
AC	zlx (xiao)	7ms	392 KiB		373 Bytes	2022-5-24 21:57:04
AC	崔欧辰	7ms	6.8 MiB	C++11	391 Bytes	2024-8-7 9:29:53
AC	侯治鋆	7ms	392 KiB		304 Bytes	2022-5-6 18:52:16
AC	新壹街校区-陈品烨 (陈品烨)	7ms	6.8 MiB		374 Bytes	2023-10-2 13:20:06
AC	Z.饮月君 (张皓南)	7ms	404 KiB		339 Bytes	2022-5-20 16:29:24
AC	yuhaodi	7ms	444 KiB		438 Bytes	2023-4-22 9:48:46
AC	leisixian (22029-lyh)	7ms	436 KiB		256 Bytes	2022-11-19 16:01:24
AC	叶梓珺	7ms	6.7 MiB		329 Bytes	2023-9-23 13:41:54
AC	王玺懿 (wxy)	7ms	440 KiB		285 Bytes	2022-7-31 11:48:03
AC	chenkerun	7ms	384 KiB		305 Bytes	2022-6-17 20:02:55
AC	(张洛诚)	7ms	384 KiB		577 Bytes	2023-4-8 8:05:59
AC	My name is Man (钟卓劭)	7ms	6.8 MiB	C++98	371 Bytes	2024-6-23 14:23:53
AC	你干嘛 (唐世睿)	7ms	7.1 MiB		441 Bytes	2023-11-4 11:37:04
AC	城市之光	7ms	392 KiB		348 Bytes	2023-2-18 11:58:17
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)	7ms	420 KiB		329 Bytes	2023-5-15 19:37:11
AC	李艾芯 (starry sky)	7ms	428 KiB		335 Bytes	2022-6-25 10:25:01
AC	张瑞博	7ms	6.9 MiB	C++11	307 Bytes	2024-8-17 15:48:04
AC	dyp (hhy)	7ms	6.8 MiB		486 Bytes	2023-9-10 15:28:33
AC	12345	7ms	384 KiB		503 Bytes	2022-3-21 20:21:03
AC	詹宇航 (zyh7)	7ms	384 KiB		304 Bytes	2022-4-8 20:08:13
AC	火星伞宾——刘晏恺 (刘晏恺)	7ms	6.9 MiB		227 Bytes	2023-8-15 11:11:52
AC	56 (13883454928)	7ms	6.7 MiB		312 Bytes	2023-8-30 9:07:53
AC	明轩 (吕同学)	7ms	444 KiB		474 Bytes	2022-8-3 22:06:52
AC	金锦泽 (jinjinze)	7ms	6.8 MiB		227 Bytes	2023-10-3 11:56:32
AC	luoluonuoya	7ms	384 KiB		477 Bytes	2022-2-7 14:46:29
AC	蒋俊豪	7ms	6.9 MiB	C++11	293 Bytes	2024-5-25 13:38:41
AC	xzf	7ms	7 MiB	C++98	335 Bytes	2024-8-25 11:23:35
AC	soha (武夷岩)	7ms	384 KiB		310 Bytes	2022-9-3 17:28:25
AC	三藏的痔疮 (不会玩是原罪)	7ms	392 KiB		342 Bytes	2022-1-25 7:36:15
AC	Error404sans (焦阳浩云)	7ms	512 KiB		313 Bytes	2023-1-31 11:53:53
AC	吴俊成 (wujuncheng)	7ms	432 KiB		423 Bytes	2022-7-9 22:14:41
AC	林文杰 (057)	7ms	444 KiB		297 Bytes	2022-7-29 13:21:20
AC	许炜铭 (xuweiming)	7ms	6.7 MiB		219 Bytes	2023-9-17 9:11:10
AC	黄梓轩 (huangzixuan)	7ms	428 KiB		376 Bytes	2022-9-3 17:36:33
AC	_add	7ms	384 KiB		245 Bytes	2022-1-19 20:33:05
AC	李玥漪	7ms	392 KiB		647 Bytes	2022-3-14 22:53:27
AC	安闵煜 (anzai)	7ms	6.5 MiB	C++11	449 Bytes	2024-7-30 15:41:01
AC	无尽的想象 (谭仕高)	7ms	436 KiB		288 Bytes	2022-7-15 15:30:41
AC	Jose (反恐皮蛋)	7ms	7.1 MiB		460 Bytes	2023-12-24 14:42:40
AC	杨淇瑞 (杨淇瑞29)	7ms	6.9 MiB		448 Bytes	2023-9-29 15:11:31
AC	时代一校-曾科智 (曾科智)	7ms	424 KiB		352 Bytes	2023-2-25 19:36:57
AC	longhao	7ms	384 KiB		325 Bytes	2022-1-25 15:43:47
AC	lll	7ms	392 KiB		225 Bytes	2022-9-6 12:10:32
AC	郭睿	7ms	6.6 MiB	C++98	284 Bytes	2024-7-9 22:14:56
AC	鲜榨大肠汁	7ms	420 KiB		337 Bytes	2022-3-12 12:49:04
AC	经常消失 (小萝卜)	7ms	512 KiB		503 Bytes	2022-3-23 19:38:23
AC	黄立信	7ms	512 KiB		367 Bytes	2022-12-9 13:52:32
AC	yanglinrui	7ms	440 KiB		243 Bytes	2022-3-5 16:59:21
AC	陈秋石	7ms	384 KiB		346 Bytes	2022-3-13 12:07:19
AC	时代2校-程俊燃 (chengjunran)	7ms	6.9 MiB		294 Bytes	2023-8-20 22:13:23
AC	任童(rentong)	7ms	384 KiB		251 Bytes	2022-9-16 17:25:58
AC	余彦瑞	7ms	384 KiB		327 Bytes	2022-3-13 11:57:25
AC	星野光 (Hoshino Hikari)	7ms	6.9 MiB		621 Bytes	2023-10-22 18:59:20
AC	张瑞博	7ms	7.1 MiB	C++11	307 Bytes	2024-4-20 23:15:30
AC	方子谦 (方子谦00)	7ms	392 KiB		358 Bytes	2022-3-13 13:10:31
AC	lll	7ms	424 KiB		225 Bytes	2022-9-6 12:05:31
AC	吃小孩的viv_	7ms	432 KiB		942 Bytes	2022-7-31 12:02:42
AC	刘政君 (lzj)	7ms	404 KiB		374 Bytes	2022-4-5 10:07:59
AC	时代1校-杨宇轩 (杨宇轩)	7ms	384 KiB		357 Bytes	2023-2-18 11:49:20
AC	文硕 (文硕1)	7ms	440 KiB		511 Bytes	2022-7-12 11:26:33
AC	张子轩 (zhangzixuana)	7ms	384 KiB		350 Bytes	2022-9-25 12:01:36
AC	时代一校蒋帛希 (13983392730)	7ms	384 KiB		333 Bytes	2022-9-28 20:23:20
AC	樊竣熠 (lft1114)	7ms	392 KiB		437 Bytes	2022-1-25 21:24:40
AC	张泰凌 (ztl)	7ms	520 KiB		358 Bytes	2022-3-18 19:39:24
AC	李彦臻	7ms	6.8 MiB		373 Bytes	2023-9-29 14:41:19
AC	陈海骞 (chq)	7ms	440 KiB		325 Bytes	2022-8-12 19:06:42
AC	新壹街校区--税崇峻 (税崇峻)	7ms	6.9 MiB		375 Bytes	2023-8-6 11:29:55
AC	王彬羽 (wby)	7ms	6.8 MiB	C++11	495 Bytes	2024-8-15 18:23:14
AC	宋坤霖	7ms	7 MiB	C++11	272 Bytes	2024-6-8 13:16:53
AC	xyc (谢雨宸)	7ms	7 MiB		289 Bytes	2023-7-7 19:50:39
AC	tsc_ (杨悦堃)	7ms	384 KiB		503 Bytes	2023-2-23 19:59:42
AC	田开蕊	7ms	7.1 MiB		514 Bytes	2023-11-4 11:23:56