小玉买文具

状态	递交者	时间	内存	语言	代码	递交时间
AC	宋金龙 (songjl0421)	1ms	384 KiB		102 Bytes	2022-4-17 9:48:23
AC	邬文博 (wwb)	1ms	384 KiB		125 Bytes	2022-6-18 16:13:41
AC	hrz923	1ms	6.9 MiB		191 Bytes	2023-8-8 21:14:40
AC	梦之泪伤	1ms	384 KiB		184 Bytes	2022-3-6 11:55:40
AC	tongxiao	1ms	7.1 MiB	C++98	127 Bytes	2024-4-19 20:16:33
AC	chen (peter)	1ms	384 KiB		105 Bytes	2022-3-17 22:06:22
AC	ttt123	1ms	360 KiB		125 Bytes	2022-12-4 20:08:24
AC	胡瀚文	1ms	384 KiB		115 Bytes	2022-1-23 8:47:00
AC	林文杰 (057)	1ms	384 KiB		124 Bytes	2022-3-3 20:18:08
AC	huyinuo	1ms	512 KiB		129 Bytes	2022-2-16 21:42:32
AC	刘洋	1ms	6.7 MiB		129 Bytes	2023-9-11 21:01:00
AC	孙天豪 (AliceSteven)	1ms	384 KiB		137 Bytes	2022-5-8 10:13:01
AC	嘉宝 (王淳恺)	1ms	6.7 MiB		153 Bytes	2023-9-21 18:29:32
AC	弹射起飞 ? 冲 ! (吴周周)	1ms	7.3 MiB		191 Bytes	2023-7-18 17:31:53
AC	李奕霖 (liyilin233)	1ms	428 KiB		131 Bytes	2022-5-21 21:23:12
AC	炸鱼4000+ (dxc)	1ms	6.6 MiB	C++14(O2)	150 Bytes	2024-6-23 16:20:22
AC	sunsihan	1ms	6.9 MiB		114 Bytes	2023-8-14 15:37:09
AC	杜是贤 (dushixian)	1ms	384 KiB		120 Bytes	2022-1-23 15:14:21
AC	05c41-hzs	1ms	384 KiB		127 Bytes	2022-7-1 18:46:49
AC	吕淼 (05c41-lm)	1ms	384 KiB		166 Bytes	2022-3-17 19:42:02
AC	孟子轩 (km老冯)	1ms	392 KiB		128 Bytes	2022-3-27 17:59:45
AC	zhangheyi22006	1ms	6.9 MiB		172 Bytes	2023-8-16 21:11:01
AC	王胤钦 (wangyinqin)	1ms	384 KiB		114 Bytes	2022-4-4 16:09:18
AC	任童(rentong)	1ms	384 KiB		128 Bytes	2022-7-6 16:08:41
AC	新壹街.曾祥睿 (zxr)	1ms	6.7 MiB		124 Bytes	2023-8-25 14:51:18
AC	刘昊臻 (liuhaozhen)	1ms	428 KiB		124 Bytes	2023-2-21 20:06:29
AC	汪筱淞	1ms	384 KiB		179 Bytes	2022-7-1 18:22:21
AC	郭人瑀 (guorenyu)	1ms	384 KiB		134 Bytes	2022-7-13 20:53:54
AC	文硕 (文硕1)	1ms	384 KiB		124 Bytes	2022-1-29 21:13:56
AC	SYC0226	1ms	384 KiB		150 Bytes	2022-1-2 12:40:13
AC	新壹街朱启航 (zhuqihang)	1ms	424 KiB		136 Bytes	2023-2-12 12:18:30
AC	何锦宸熙	1ms	7 MiB	C++98	142 Bytes	2024-4-27 14:44:46
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	1ms	384 KiB		138 Bytes	2022-3-3 20:28:55
AC	赵志陶 (zztzzt)	1ms	444 KiB		143 Bytes	2022-8-1 15:58:22
AC	chenxiaozhun	1ms	384 KiB		120 Bytes	2022-4-4 16:09:55
AC	你爹 (郭铠嘉)	1ms	384 KiB		127 Bytes	2022-1-25 20:28:57
AC	姚宏逸	1ms	384 KiB		114 Bytes	2022-3-3 19:14:19
AC	龚信丞	1ms	428 KiB		226 Bytes	2023-5-5 21:18:50
AC	胡瀚文	1ms	384 KiB		124 Bytes	2022-1-23 8:44:36
AC	wuqilin	1ms	384 KiB		170 Bytes	2022-11-27 15:25:08
AC	小忙果 (王昱杰)	1ms	436 KiB		124 Bytes	2023-2-8 19:56:27
AC	wangxingyue	1ms	384 KiB		95 Bytes	2022-4-16 22:40:35
AC	朱彦搏	1ms	384 KiB		112 Bytes	2023-4-2 12:52:38
AC	强奸肾[冷漠] (05c41-zjb)	1ms	384 KiB		305 Bytes	2022-8-8 12:14:41
AC	qyj	1ms	384 KiB		131 Bytes	2022-2-26 12:07:34
AC	什蒂尔布 (吴东航)	1ms	6.9 MiB	C++98	151 Bytes	2024-5-20 16:59:18
AC	江科毅 (jky)	1ms	384 KiB		145 Bytes	2023-5-24 19:08:24
AC	Ruler (05c35-hjs)	1ms	384 KiB		181 Bytes	2022-5-8 8:56:52
AC	毕浩宇 (bihaoyu)	1ms	6.5 MiB		123 Bytes	2023-9-8 17:26:32
AC	金沙校区-鲍钰森 (鲍钰森)	1ms	7 MiB	C++98	118 Bytes	2024-6-4 20:32:48
AC	时代校区-刘臣原 (微笑王子)	1ms	384 KiB		122 Bytes	2022-11-29 20:11:37
AC	王涵熙 (水煮大肠)	1ms	392 KiB		124 Bytes	2022-3-27 12:48:57
AC	USSR slq (USSR)	1ms	384 KiB		161 Bytes	2022-5-22 15:35:34
AC	Cristiano·Ronaldo (05c41-gmz)	1ms	384 KiB		127 Bytes	2022-4-17 13:54:26
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	1ms	384 KiB		118 Bytes	2022-8-30 18:50:04
AC	喻兴诚 (Brian)	1ms	384 KiB		141 Bytes	2022-3-13 18:54:27
AC	丁宇涵 (05c35-dyh1)	1ms	384 KiB		139 Bytes	2022-6-5 11:25:16
AC	xzf	1ms	6.9 MiB		146 Bytes	2023-7-1 19:25:26
AC	05c30-dyh	1ms	384 KiB		184 Bytes	2022-2-26 13:59:10
AC	任瑞的学生 (jiangyadong)	1ms	444 KiB		124 Bytes	2022-6-7 13:31:06
AC	爱情海校区—沙天一 (沙天一)	1ms	6.5 MiB		117 Bytes	2023-9-15 17:54:26
AC	SHY20091224	1ms	432 KiB		143 Bytes	2022-8-17 15:43:09
AC	黄俊皓	1ms	384 KiB		133 Bytes	2022-4-23 10:10:14
AC	冒牌陈杰晟【MOD】 (wed)	1ms	384 KiB		108 Bytes	2022-2-25 17:17:32
AC	新壹街陈科言 (cky)	1ms	6.7 MiB		152 Bytes	2023-7-18 8:55:04
AC	李树崑 (lishukun)	1ms	384 KiB		220 Bytes	2022-1-23 17:24:08
AC	欧俊阳	1ms	384 KiB		126 Bytes	2022-10-15 18:01:56
AC	. (Pig)	1ms	384 KiB		144 Bytes	2022-3-6 9:23:28
AC	时代二校+马嘉宸 (majiachen)	1ms	6.7 MiB		166 Bytes	2023-6-27 21:33:17
AC	jinitaimei	1ms	384 KiB		108 Bytes	2022-9-11 18:56:23
AC	杜是贤 (dushixian)	1ms	384 KiB		120 Bytes	2022-3-9 19:55:43
AC	时代二校-陈天成 (鸭缩毛巾)	1ms	432 KiB		130 Bytes	2023-4-9 18:13:07
AC	郑妍汐	1ms	384 KiB		160 Bytes	2022-2-19 14:07:16
AC	05c05-yyc	1ms	436 KiB		147 Bytes	2022-9-2 13:50:22
AC	连弘锐	1ms	384 KiB		125 Bytes	2022-8-15 16:57:38
AC	张子扬	1ms	384 KiB		195 Bytes	2022-1-22 18:40:07
AC	某某 (xuhaotian)	1ms	384 KiB		202 Bytes	2022-2-26 14:33:02
AC	你爹 (郭铠嘉)	1ms	384 KiB		127 Bytes	2022-1-25 20:28:58
AC	新壹街校区-罗斤天 (罗斤天)	1ms	384 KiB		107 Bytes	2022-4-4 16:07:00
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)	1ms	384 KiB		143 Bytes	2023-4-23 19:31:45
AC	张祖名	1ms	6.5 MiB		140 Bytes	2023-8-28 18:20:01
AC	(金沙天街)严皓月 (严皓月)	1ms	6.9 MiB		164 Bytes	2023-7-22 10:33:13
AC	你爹 (郭铠嘉)	1ms	392 KiB		127 Bytes	2022-1-25 20:29:01
AC	林凡童 (lft)	1ms	384 KiB		159 Bytes	2022-7-8 20:36:38
AC	秦维希 (qinweixi)	1ms	384 KiB		153 Bytes	2022-6-5 11:03:29
AC	陈玺宇	1ms	6.9 MiB		124 Bytes	2023-8-1 16:20:00
AC	zlx (xiao)	1ms	384 KiB		158 Bytes	2022-5-24 21:19:52
AC	时代一校-赵彦博 (zyb)	1ms	6.9 MiB		160 Bytes	2023-7-11 21:40:31
AC	zjz	1ms	384 KiB		118 Bytes	2022-3-13 18:13:00
AC	许炜铭 (xuweiming)	1ms	400 KiB		146 Bytes	2023-3-26 14:57:14
AC	王卓薪	1ms	6.8 MiB		211 Bytes	2023-6-11 11:30:55
AC	刘政君 (lzj)	1ms	384 KiB		150 Bytes	2022-4-5 10:10:18
AC	xuniaoyin (徐袅音)	1ms	6.6 MiB		111 Bytes	2023-7-12 18:28:19
AC	潘佑实	1ms	440 KiB		159 Bytes	2023-2-26 16:35:38
AC	hnd (陈皓洋)	1ms	384 KiB		182 Bytes	2022-8-21 14:10:44
AC	国林泽 (guolinze)	1ms	384 KiB		171 Bytes	2022-2-23 21:24:44
AC	你爹 (郭铠嘉)	1ms	336 KiB		127 Bytes	2022-1-25 20:28:58
AC	Aphrode	1ms	6.8 MiB		121 Bytes	2023-6-20 15:22:46
AC	况奕辛 (KYX_yyds)	1ms	384 KiB		109 Bytes	2021-12-30 18:08:34
AC	05c05-zjk	1ms	384 KiB		118 Bytes	2022-12-7 14:47:51