希蒙点菜

状态	递交者	时间	内存	语言	代码	递交时间
AC	longhao	14ms	384 KiB		374 Bytes	2022-1-25 9:54:38
AC	zhuqiwei22006	14ms	412 KiB		302 Bytes	2022-5-1 17:02:15
AC	heyi	14ms	6.8 MiB	C++98(O2)	384 Bytes	2024-8-8 13:14:26
AC	向俊熙 (xiangjunxi23003)	14ms	384 KiB		454 Bytes	2023-4-12 17:11:01
AC	huyinuo	14ms	432 KiB		399 Bytes	2022-2-25 21:02:43
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	14ms	384 KiB		331 Bytes	2022-12-4 9:32:40
AC	罗伟杰 (13308275065)	14ms	432 KiB		501 Bytes	2022-11-30 22:43:26
AC	JOKER (hhy)	14ms	6.7 MiB		425 Bytes	2023-9-10 15:38:20
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	420 KiB		375 Bytes	2022-5-1 17:59:02
AC	时代2校-程俊燃 (chengjunran)	14ms	428 KiB		376 Bytes	2023-4-19 18:25:58
AC	崔欧辰	14ms	6.6 MiB	C++11	419 Bytes	2024-8-1 15:22:15
AC	杨淇瑞 (杨淇瑞29)	14ms	7.1 MiB	C++98	626 Bytes	2024-5-14 21:15:57
AC	李山水	14ms	392 KiB		496 Bytes	2022-3-8 15:33:00
AC	chenrunxiang22031	14ms	384 KiB		396 Bytes	2022-12-4 9:57:57
AC	11111	14ms	384 KiB		380 Bytes	2022-3-4 18:53:16
AC	陈于硕(我™的) (chenyu)	14ms	392 KiB		472 Bytes	2023-3-9 22:08:05
AC	连弘锐	14ms	444 KiB		401 Bytes	2022-9-17 15:01:38
AC	11111	14ms	512 KiB		380 Bytes	2022-3-4 18:53:16
AC	张家豪 (zhangjiahao)	14ms	432 KiB		343 Bytes	2023-4-30 17:09:13
AC	luoluonuoya	14ms	512 KiB		404 Bytes	2022-2-19 16:03:35
AC	中岛敦 (黄麒瑞)	14ms	6.7 MiB		534 Bytes	2023-9-30 21:31:48
AC	无尽的想象 (谭仕高)	14ms	436 KiB		334 Bytes	2022-7-15 15:40:39
AC	芒苒忧 (廖迦南)	14ms	384 KiB		405 Bytes	2022-1-25 15:23:39
AC	源著校区-宋昊成 (马冬梅)	14ms	436 KiB		453 Bytes	2023-2-25 18:05:23
AC	谭懿轩 (yanyixuan)	14ms	452 KiB		322 Bytes	2022-2-15 14:08:14
AC	我很6 (zjj22031)	14ms	412 KiB		526 Bytes	2022-12-4 9:13:39
AC	李树崑 (lishukun)	14ms	384 KiB		382 Bytes	2022-1-26 23:12:35
AC	苏信泽	14ms	384 KiB		458 Bytes	2023-4-1 19:22:09
AC	陈秋石	14ms	436 KiB		539 Bytes	2022-3-20 21:34:50
AC	高彬月	14ms	7.2 MiB		387 Bytes	2023-12-11 20:28:55
AC	lihaoyi	14ms	384 KiB		411 Bytes	2022-12-4 9:44:14
AC	余彦瑞	14ms	392 KiB		433 Bytes	2022-3-20 11:54:39
AC	soha (武夷岩)	14ms	400 KiB		525 Bytes	2022-10-15 13:08:27
AC	周米骐 (zsb)	14ms	6.8 MiB		498 Bytes	2023-10-19 17:49:24
AC	yuandingyang22031	14ms	392 KiB		546 Bytes	2022-12-4 9:29:07
AC	文硕 (文硕1)	14ms	520 KiB		488 Bytes	2022-7-12 11:27:03
AC	zjm	14ms	384 KiB		405 Bytes	2022-12-4 9:42:09
AC	郑尧 (zhengyao)	14ms	7 MiB	C++98	348 Bytes	2024-6-21 21:51:19
AC	叶哲宇 (yzy)	14ms	512 KiB		401 Bytes	2023-5-29 18:17:28
AC	爱琴海校区-黄辰浩 (huangchenhao)	14ms	384 KiB		479 Bytes	2022-11-27 15:16:24
AC	chen (peter)	14ms	440 KiB		399 Bytes	2022-7-19 11:06:55
AC	Tang	14ms	384 KiB		376 Bytes	2022-4-9 11:27:26
AC	炸鱼4000+ (dxc)	14ms	384 KiB		500 Bytes	2023-4-1 19:20:24
AC	11111	14ms	384 KiB		380 Bytes	2022-3-4 18:53:16
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	14ms	384 KiB		331 Bytes	2022-12-4 9:32:37
AC	11111	14ms	440 KiB		380 Bytes	2022-3-4 18:53:15
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	14ms	444 KiB		370 Bytes	2022-9-24 23:17:10
AC	希蒙 (zhengxingya)	14ms	8 MiB		454 Bytes	2023-8-21 16:47:04
AC	星野光 (Hoshino Hikari)	14ms	6.9 MiB		775 Bytes	2023-10-22 19:05:12
AC	Ronnie	14ms	512 KiB		522 Bytes	2022-2-19 14:08:21
AC	AC[谭赫奕] (tanheyi)	14ms	512 KiB		479 Bytes	2023-2-6 20:12:23
AC	朱泽晟	14ms	428 KiB		430 Bytes	2022-2-12 20:30:19
AC	朱老师 (zyp)	14ms	436 KiB		393 Bytes	2022-7-28 11:13:56
AC	黄梓轩 (huangzixuan)	15ms	512 KiB		431 Bytes	2022-10-4 21:58:41
AC	时代二校+王吕棪 (wanglvyan)	15ms	6.9 MiB		341 Bytes	2023-7-2 16:38:28
AC	时代一校蒋帛希 (13983392730)	15ms	6.9 MiB		407 Bytes	2023-7-25 21:14:15
AC	牟淳雅	15ms	7 MiB		430 Bytes	2023-9-24 11:00:49
AC	kkksc03 (彭士锋)	15ms	512 KiB		432 Bytes	2022-3-11 18:11:09
AC	wuzhenghan	15ms	444 KiB		343 Bytes	2022-10-23 11:04:31
AC	何星震 (Jacob)	15ms	436 KiB		374 Bytes	2022-10-10 19:51:53
AC	hyh22031	15ms	384 KiB		430 Bytes	2022-12-4 9:30:45
AC	56 (13883454928)	15ms	6.7 MiB		381 Bytes	2023-8-30 9:12:01
AC	周琪渃	15ms	436 KiB		547 Bytes	2023-3-8 21:22:54
AC	弹射起飞 ? 冲 ! (吴周周)	15ms	6.7 MiB		521 Bytes	2023-9-9 17:50:39
AC	Error404sans (焦阳浩云)	15ms	512 KiB		385 Bytes	2023-5-28 10:43:10
AC	zzzrrrxxx	15ms	6.9 MiB		303 Bytes	2023-7-18 9:52:53
AC	铁牛杰哥官方频道	15ms	524 KiB		392 Bytes	2022-3-9 20:19:34
AC	dddhhhxxx	15ms	440 KiB		514 Bytes	2022-7-10 16:57:59
AC	zzl	15ms	392 KiB		412 Bytes	2023-1-6 11:00:52
AC	曹烜豪	15ms	384 KiB		458 Bytes	2023-4-1 19:30:06
AC	许徐非凡 (非同凡响)	15ms	384 KiB		377 Bytes	2022-10-27 20:28:39
AC	一片落叶 (yeyuhao)	15ms	6.7 MiB		501 Bytes	2023-8-28 20:19:57
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	15ms	392 KiB		331 Bytes	2022-12-4 9:32:41
AC	新壹街校区--税崇峻 (税崇峻)	15ms	6.9 MiB		322 Bytes	2023-8-2 19:41:59
AC	朱老师 (zyp)	15ms	392 KiB		464 Bytes	2022-12-4 9:21:27
AC	11111	15ms	392 KiB		380 Bytes	2022-3-4 18:53:16
AC	繁星 (05c35-zzm)	15ms	416 KiB		480 Bytes	2022-11-26 9:41:49
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	440 KiB		274 Bytes	2023-5-15 19:45:10
AC	时代校区-刘臣原 (微笑王子)	15ms	428 KiB		383 Bytes	2022-12-28 20:46:35
AC	罗翌珂 (dangdang)	15ms	444 KiB		558 Bytes	2022-8-18 11:26:52
AC	zzl	15ms	384 KiB		385 Bytes	2023-1-6 11:00:33
AC	况奕辛 (KYX_yyds)	15ms	432 KiB		810 Bytes	2022-2-18 18:55:04
AC	zjm	15ms	384 KiB		405 Bytes	2022-12-4 9:43:00
AC	xflt_dyp	15ms	6.9 MiB		254 Bytes	2023-7-22 16:30:47
AC	邵冠铖 (shaoguancheng22031)	15ms	440 KiB		294 Bytes	2022-12-4 9:11:05
AC	xuaonan	15ms	512 KiB		475 Bytes	2022-10-4 18:08:35
AC	22029-lyh	15ms	512 KiB		516 Bytes	2023-3-23 18:52:12
AC	赵泳鑫 (zhaoyongxin)	15ms	544 KiB		488 Bytes	2022-7-12 11:20:17
AC	冒牌陈杰晟【MOD】 (wed)	15ms	512 KiB		300 Bytes	2022-3-1 21:28:17
AC	许嘉恩 (xje22031)	15ms	392 KiB		415 Bytes	2022-12-4 9:23:02
AC	王祎辰 (wangyichen)	15ms	7.2 MiB	C++11	396 Bytes	2024-4-27 13:37:51
AC	yanglang	15ms	440 KiB		392 Bytes	2022-10-21 23:20:22
AC	§范马 · 猫羽雫™☠ (lixiaoxiang22031)	15ms	384 KiB		331 Bytes	2022-12-4 9:32:41
AC	贾博涵	15ms	6.8 MiB		261 Bytes	2023-11-8 11:24:21
AC	raozheng	15ms	512 KiB		556 Bytes	2022-11-27 14:48:30
AC	wzzjnb2012	15ms	512 KiB		241 Bytes	2022-9-29 16:48:06
AC	e^(i×π)+1=0	15ms	7.1 MiB		336 Bytes	2024-1-23 17:44:13
AC	江坤锜	15ms	428 KiB		565 Bytes	2023-3-25 20:23:35
AC	黄立信	15ms	6.8 MiB		559 Bytes	2023-10-12 21:36:52
AC	shenyushun2	15ms	512 KiB		315 Bytes	2022-12-17 13:36:53