收集瓶盖赢大奖

状态	递交者	时间	内存	语言	代码	递交时间
AC	Nico	14ms	452 KiB		217 Bytes	2023-4-16 14:36:40
AC	啊...这 (炼狱杏寿郎)	14ms	392 KiB		180 Bytes	2022-9-10 16:29:00
AC	言年想摆烂~	14ms	6.8 MiB		161 Bytes	2023-6-10 21:14:04
AC	TBB (杜昊燃)	14ms	436 KiB		171 Bytes	2022-4-9 11:30:46
AC	wangzihang	14ms	444 KiB	C++	141 Bytes	2022-7-30 15:01:05
AC	罗翌珂 (dangdang)	14ms	436 KiB		212 Bytes	2022-7-2 11:06:26
AC	赵鑫宸 (xiaoxiao721)	14ms	440 KiB		167 Bytes	2022-2-20 21:57:20
AC	罗元邑2	14ms	6.7 MiB	C++98(O2)	368 Bytes	2024-7-14 13:12:51
AC	芒苒忧 (廖迦南)	14ms	440 KiB		179 Bytes	2022-4-10 13:06:12
AC	金沙校区-蓝祥与 (蓝祥与)	14ms	384 KiB		141 Bytes	2023-2-11 9:57:17
AC	程子杰 (05c41-czj)	14ms	428 KiB		203 Bytes	2022-7-28 10:56:18
AC	lch (凌昌瀚)	14ms	440 KiB		143 Bytes	2022-4-23 9:41:10
AC	Erin	14ms	7.2 MiB	C++98	155 Bytes	2024-5-2 17:33:31
AC	Guest	14ms	6.9 MiB	C++11	187 Bytes	2024-7-3 15:02:50
AC	江科毅 (jky)	14ms	384 KiB		160 Bytes	2023-5-31 19:19:57
AC	Guest	14ms	6.9 MiB	C++11	179 Bytes	2024-7-3 15:24:20
AC	疯神芭芭脱丝 (李卓修)	14ms	384 KiB		208 Bytes	2022-1-24 16:16:36
AC	刘思齐	14ms	7 MiB	C++98	185 Bytes	2024-6-28 18:08:55
AC	xxteacher	14ms	384 KiB		278 Bytes	2022-2-8 15:21:21
AC	杜雨帆	14ms	6.6 MiB	C++11	174 Bytes	2024-6-28 18:15:59
AC	杨皓宇 (杨浩宇)	14ms	384 KiB		204 Bytes	2022-7-2 11:10:53
AC	凌肯 (lingken22006)	14ms	392 KiB		175 Bytes	2022-7-31 18:58:25
AC	panyan	14ms	512 KiB		178 Bytes	2022-7-3 15:33:35
AC	谭懿轩 (yanyixuan)	14ms	440 KiB		163 Bytes	2022-2-15 14:18:16
AC	杜俊宏	14ms	384 KiB		157 Bytes	2022-3-21 21:12:00
AC	游智棋	14ms	412 KiB		168 Bytes	2022-7-2 11:08:50
AC	朱老师 (zyp)	14ms	440 KiB		160 Bytes	2022-7-28 11:16:15
AC	陈杰晟	14ms	436 KiB		158 Bytes	2022-2-22 13:10:40
AC	李山水	14ms	388 KiB		209 Bytes	2022-2-19 15:00:45
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	512 KiB		175 Bytes	2022-7-4 9:33:34
AC	杜俊宏	14ms	440 KiB		157 Bytes	2022-3-21 21:11:55
AC	lao_ba	14ms	7.1 MiB	C++20(O2)	151 Bytes	2024-4-23 10:13:42
AC	明轩 (吕同学)	14ms	7.3 MiB		248 Bytes	2024-1-22 11:08:41
AC	Tang	14ms	512 KiB		136 Bytes	2022-2-19 10:16:57
AC	秦怡然	14ms	6.8 MiB		188 Bytes	2023-6-11 8:12:22
AC	wzzjnb2012	14ms	440 KiB		216 Bytes	2022-9-29 21:21:22
AC	许炜铭 (xuweiming)	14ms	6.8 MiB		175 Bytes	2023-6-10 14:14:52
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	420 KiB		145 Bytes	2023-5-16 19:13:22
AC	王启仑 (wangqilun23010)	14ms	7.4 MiB		190 Bytes	2023-6-10 20:06:29
AC	任梓豪	14ms	384 KiB		193 Bytes	2023-3-16 18:23:44
AC	http://oj.cqxiaomawang.com:8888/d/CQ06_22005/ (wjc)	14ms	392 KiB		176 Bytes	2022-3-11 21:47:39
AC	谢欣霖 (xiexinlin)	14ms	448 KiB		179 Bytes	2022-4-16 14:00:15
AC	chenyifei	14ms	412 KiB		110 Bytes	2022-4-16 20:23:30
AC	古煦涵	14ms	6.8 MiB	C++98	143 Bytes	2024-8-7 20:12:07
AC	wangzihang	14ms	6.9 MiB		141 Bytes	2023-11-10 17:29:41
AC	陈秋石	14ms	436 KiB		167 Bytes	2022-6-5 9:22:03
AC	luojunyang	14ms	384 KiB		144 Bytes	2022-1-21 17:43:19
AC	凌肯 (lingken22006)	14ms	432 KiB		175 Bytes	2022-7-31 18:58:25
AC	陈雨泽1	14ms	440 KiB		162 Bytes	2023-2-18 11:04:29
AC	何中蓉	14ms	7.2 MiB	C++98	158 Bytes	2024-4-22 20:58:09
AC	xzf	14ms	7 MiB	C++98	147 Bytes	2024-8-24 18:36:00
AC	彭嘉豪 (pengjiahao)	14ms	412 KiB		179 Bytes	2022-7-9 14:27:35
AC	罗竣瀚	14ms	384 KiB		139 Bytes	2022-10-17 21:33:33
AC	许徐非凡 (非同凡响)	14ms	7.1 MiB	C++98	163 Bytes	2024-6-14 19:35:46
AC	ttz	14ms	512 KiB		177 Bytes	2022-2-20 9:50:40
AC	zhangyh (张育菡)	14ms	392 KiB		144 Bytes	2022-10-23 11:28:34
AC	colin1112 (墙凌可)	14ms	440 KiB		246 Bytes	2023-4-29 13:18:35
AC	无尽的想象 (谭仕高)	14ms	392 KiB		144 Bytes	2022-7-15 18:27:14
AC	董乙辰	14ms	6.9 MiB	C++98	156 Bytes	2024-8-22 17:12:20
AC	我是周靖松长得帅 (mouyunqi)	14ms	416 KiB		136 Bytes	2023-3-24 19:04:57
AC	Accepted (周芷乐)	14ms	7 MiB	C++14	192 Bytes	2024-6-17 21:48:57
AC	杨淇瑞 (杨淇瑞29)	14ms	6.9 MiB	C++98	203 Bytes	2024-5-20 19:28:04
AC	南坪校区-郑力博 (zhenglibo23003)	14ms	512 KiB		142 Bytes	2023-5-26 21:55:29
AC	德克萨斯做的到吗 (liyangbao)	14ms	428 KiB		233 Bytes	2022-11-7 22:43:20
AC	新壹街-王俊博 (王俊博)	14ms	7 MiB	C++98	147 Bytes	2024-6-8 14:44:52
AC	樊竣熠 (lft1114)	14ms	512 KiB		176 Bytes	2022-2-28 20:06:34
AC	yuhaodi	14ms	436 KiB		183 Bytes	2023-4-24 18:15:42
AC	蒲梓勋 (puzixun)	14ms	384 KiB		161 Bytes	2022-10-29 16:47:39
AC	姚宏逸	14ms	512 KiB		144 Bytes	2022-2-5 23:25:20
AC	huyinuo	14ms	440 KiB		190 Bytes	2022-3-20 10:26:06
AC	曹埊睿 (caodirui)	14ms	384 KiB		157 Bytes	2023-4-27 20:02:54
AC	冒牌陈杰晟【MOD】 (wed)	14ms	512 KiB		125 Bytes	2022-2-27 12:09:13
AC	张瑞博	14ms	7.2 MiB	C++11	160 Bytes	2024-4-23 22:04:50
AC	我很6 (zjj22031)	14ms	448 KiB		165 Bytes	2023-2-12 9:38:21
AC	程舒然	14ms	6.6 MiB	C++11	244 Bytes	2024-7-11 11:47:07
AC	张祖名	14ms	6.8 MiB	C++98(O2)	164 Bytes	2024-8-11 16:21:06
AC	何镇西1	14ms	7 MiB	C++98	141 Bytes	2024-6-21 16:47:13
AC	姚宏逸	14ms	7.1 MiB		144 Bytes	2023-11-12 16:17:39
AC	77777777	14ms	6.6 MiB	C++17	155 Bytes	2024-7-18 22:17:19
AC	蒲梓勋 (puzixun)	14ms	384 KiB		161 Bytes	2022-10-29 16:47:27
AC	朱泽晟	14ms	436 KiB		176 Bytes	2022-2-12 20:35:59
AC	dyp (hhy)	14ms	560 KiB		144 Bytes	2023-5-7 10:53:24
AC	老六（王牌） (mhc)	14ms	512 KiB		163 Bytes	2023-3-29 19:43:46
AC	郑岐蔚	15ms	6.8 MiB		156 Bytes	2023-6-9 19:58:59
AC	ych	15ms	512 KiB		202 Bytes	2023-4-14 18:57:25
AC	孙嘉蔚	15ms	7 MiB	C++11	182 Bytes	2024-6-28 18:14:24
AC	李林峰 (金克拉)	15ms	436 KiB		196 Bytes	2023-2-18 9:03:12
AC	金沙校区-李嘉齐 (李嘉齐)	15ms	7.2 MiB	C++98	148 Bytes	2024-5-16 22:10:46
AC	赵一嵘 (zhaoyirong)	15ms	432 KiB		165 Bytes	2023-3-1 22:18:51
AC	周琪渃	15ms	440 KiB		188 Bytes	2022-12-24 15:51:21
AC	Tang	15ms	428 KiB		136 Bytes	2022-2-19 10:16:57
AC	郑尧 (zhengyao)	15ms	6.9 MiB	C++98	143 Bytes	2024-5-26 14:56:38
AC	林子沫awa (linziyue)	15ms	392 KiB		182 Bytes	2023-3-16 22:44:07
AC	唐九九 (121)	15ms	436 KiB		150 Bytes	2022-9-22 17:03:09
AC	Jose (反恐皮蛋)	15ms	384 KiB		173 Bytes	2022-10-12 14:39:57
AC	谭及轩	15ms	6.9 MiB	C++98	180 Bytes	2024-5-19 18:20:08
AC	没有此人 (akm)	15ms	384 KiB		197 Bytes	2022-10-1 18:41:11
AC	tyx_9192596	15ms	448 KiB		153 Bytes	2023-3-17 18:31:29
AC	Guest	15ms	6.9 MiB	C++11	179 Bytes	2024-7-3 15:26:11
AC	yanglang	15ms	436 KiB		153 Bytes	2022-10-21 23:27:25