抽奖 - 题目统计

状态	递交者	时间	内存	代码	递交时间
AC	文锦辉	19ms	384 KiB	286 Bytes	2023-3-10 16:22:26
AC	坤坤荔枝小黑子 (zhonghaotian22006)	19ms	444 KiB	322 Bytes	2022-9-11 18:30:23
AC	叶雨昊 (yeyuhao22006)	19ms	384 KiB	489 Bytes	2022-12-7 17:28:53
AC	liusitong	19ms	6.8 MiB	335 Bytes	2023-6-22 10:33:56
AC	xiongxinyao	19ms	436 KiB	340 Bytes	2023-1-31 9:43:28
AC	魑归sama	19ms	420 KiB	274 Bytes	2022-11-25 18:35:07
AC	时代二校-陈天成 (鸭缩毛巾)	19ms	6.7 MiB	270 Bytes	2023-9-2 18:13:32
AC	ttt123	19ms	436 KiB	349 Bytes	2022-12-3 22:07:30
AC	李龙腾 (llt)	19ms	432 KiB	267 Bytes	2022-9-10 20:33:33
AC	zry	19ms	512 KiB	290 Bytes	2022-11-29 23:11:59
AC	凌肯 (lingken22006)	19ms	392 KiB	291 Bytes	2022-12-4 19:07:11
AC	朱老师 (zyp)	19ms	436 KiB	279 Bytes	2022-8-21 17:02:15
AC	pandap&a王皓宸 (WANGHAOCHEN)	19ms	448 KiB	410 Bytes	2023-3-11 8:20:04
AC	庹仕杰	19ms	6.8 MiB	268 Bytes	2023-8-26 15:03:58
AC	张梓辰 (DiaoDesi屌德斯)	19ms	396 KiB	302 Bytes	2022-9-7 19:45:32
AC	时代一校-曾科智 (曾科智)	19ms	428 KiB	267 Bytes	2023-2-23 19:18:39
AC	陈佳婧	19ms	384 KiB	301 Bytes	2022-9-9 20:40:09
AC	13708333350	19ms	512 KiB	299 Bytes	2022-10-29 18:52:11
AC	zhangheyi22006	19ms	384 KiB	259 Bytes	2022-12-7 17:45:10
AC	郑岐蔚	19ms	512 KiB	265 Bytes	2023-2-11 12:52:47
AC	杨佳葆	19ms	512 KiB	301 Bytes	2022-10-16 10:27:46
AC	凌肯 (lingken22006)	19ms	392 KiB	291 Bytes	2022-12-4 19:07:09
AC	叶雨昊 (yeyuhao22006)	19ms	404 KiB	489 Bytes	2022-12-7 17:28:51
AC	食不食油饼（点主页康康） (Nemo)	19ms	384 KiB	237 Bytes	2022-12-14 20:24:24
AC	徐正旺 (xzw)	19ms	440 KiB	381 Bytes	2023-5-5 17:09:16
AC	叶雨昊 (yeyuhao22006)	19ms	408 KiB	490 Bytes	2022-12-7 17:19:37
AC	凌肯 (lingken22006)	19ms	396 KiB	291 Bytes	2022-12-4 19:07:10
AC	姚宏逸	19ms	436 KiB	456 Bytes	2022-10-30 9:45:52
AC	dengduxi	19ms	444 KiB	292 Bytes	2023-1-5 17:01:43
AC	黄梓轩 (huangzixuan)	19ms	512 KiB	243 Bytes	2023-5-14 14:16:05
AC	孟子轩	19ms	436 KiB	259 Bytes	2022-12-8 16:37:54
AC	明哲瀚 (18580067605)	19ms	384 KiB	319 Bytes	2023-3-11 19:17:05
AC	凌肯 (lingken22006)	19ms	384 KiB	291 Bytes	2022-12-4 19:07:16
AC	22029-zjs	19ms	384 KiB	331 Bytes	2022-12-24 10:42:46
AC	叶雨昊 (yeyuhao22006)	19ms	420 KiB	489 Bytes	2022-12-7 17:28:50
AC	叶雨昊 (yeyuhao22006)	19ms	396 KiB	489 Bytes	2022-12-7 17:28:48
AC	wangyueru	19ms	392 KiB	269 Bytes	2023-3-11 19:01:20
AC	杨浩灵 (金坷拉)	19ms	436 KiB	340 Bytes	2023-1-4 23:02:37
AC	陈骏逸 (chenjunyi)	19ms	6.9 MiB	379 Bytes	2023-7-9 15:32:38
AC	colin1112 (墙凌可)	19ms	432 KiB	376 Bytes	2023-3-11 15:31:31
AC	黄诗童 (hst01)	19ms	444 KiB	328 Bytes	2022-10-1 19:19:04
AC	22029-lyh	19ms	392 KiB	312 Bytes	2022-12-24 10:42:45
AC	Z.饮月君 (张皓南)	19ms	436 KiB	296 Bytes	2022-10-30 13:30:27
AC	马渝杭 (mayuhang)	19ms	432 KiB	296 Bytes	2022-11-26 10:37:07
AC	teacher_ren	19ms	436 KiB	289 Bytes	2022-10-29 20:25:52
AC	蒲梓勋 (puzixun)	20ms	412 KiB	299 Bytes	2022-10-16 10:26:01
AC	叶雨昊 (yeyuhao22006)	20ms	392 KiB	489 Bytes	2022-12-7 17:28:51
AC	凌肯 (lingken22006)	20ms	392 KiB	291 Bytes	2022-12-4 19:07:14
AC	喻文博 (22016-ywb)	20ms	392 KiB	247 Bytes	2022-12-11 11:33:38
AC	陈一锋 (cyf01)	20ms	440 KiB	262 Bytes	2022-9-8 14:52:24
AC	ycy	20ms	6.7 MiB	238 Bytes	2023-8-23 10:58:46
AC	李卓燃 (李卓燃1)	20ms	512 KiB	282 Bytes	2023-5-14 15:52:54
AC	时代一校-赵彦博 (zyb)	20ms	448 KiB	269 Bytes	2022-12-4 9:29:07
AC	黄誉翔 (黄誉翔)	20ms	440 KiB	265 Bytes	2022-10-30 17:55:15
AC	凌肯 (lingken22006)	20ms	404 KiB	291 Bytes	2022-12-4 19:07:11
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	20ms	432 KiB	273 Bytes	2022-10-29 17:59:56
AC	Jack	20ms	512 KiB	294 Bytes	2023-5-4 20:17:51
AC	时代校区-刘臣原 (微笑王子)	20ms	384 KiB	253 Bytes	2022-9-5 21:40:44
AC	叶雨昊 (yeyuhao22006)	20ms	432 KiB	489 Bytes	2022-12-7 17:28:52
AC	1396013295	20ms	384 KiB	262 Bytes	2022-10-2 11:23:56
AC	欧俊阳	20ms	6.7 MiB	264 Bytes	2023-9-8 18:12:24
AC	纪承熙 (jcx001)	20ms	412 KiB	347 Bytes	2022-10-1 19:10:40
AC	俞文博	20ms	512 KiB	237 Bytes	2022-11-5 21:11:43
AC	李林峰 (金克拉)	20ms	436 KiB	303 Bytes	2022-8-31 20:35:22
AC	欧俊阳	20ms	504 KiB	266 Bytes	2023-3-18 17:17:01
AC	叶雨昊 (yeyuhao22006)	20ms	384 KiB	489 Bytes	2022-12-7 17:28:49
AC	李禹衡 (liyuheng22006)	20ms	384 KiB	263 Bytes	2022-12-7 17:52:59
AC	时代一校蒋帛希 (13983392730)	20ms	440 KiB	248 Bytes	2023-3-2 20:14:02
AC	张峻熙	20ms	512 KiB	265 Bytes	2022-10-29 21:01:00
AC	Tender. (05c05-zhou)	20ms	436 KiB	279 Bytes	2022-11-6 18:49:14
AC	hxb	20ms	512 KiB	245 Bytes	2022-12-31 17:19:13
AC	叶雨昊 (yeyuhao22006)	20ms	384 KiB	489 Bytes	2022-12-7 17:28:55
AC	(金沙天街)严皓月 (严皓月)	20ms	7 MiB	264 Bytes	2023-11-24 20:44:42
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)	20ms	436 KiB	341 Bytes	2022-12-10 18:01:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	20ms	384 KiB	322 Bytes	2022-9-11 18:30:55
AC	周琪渃	20ms	512 KiB	391 Bytes	2023-3-18 16:34:11
AC	叶雨昊 (yeyuhao22006)	20ms	392 KiB	489 Bytes	2022-12-7 17:28:49
AC	刘煜轩	20ms	7.4 MiB	274 Bytes	2023-11-18 11:55:36
AC	执剑人罗辑 (Jasson)	20ms	520 KiB	346 Bytes	2023-3-18 18:48:00
AC	欧俊阳	20ms	428 KiB	266 Bytes	2023-3-18 11:27:19
AC	我是傻逼	20ms	432 KiB	277 Bytes	2023-3-22 20:52:14
AC	zhangzhimo	20ms	512 KiB	340 Bytes	2022-12-3 17:06:22
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	20ms	512 KiB	323 Bytes	2022-12-24 11:25:57
AC	zcx	20ms	384 KiB	283 Bytes	2022-12-24 10:42:51
AC	叶雨昊 (yeyuhao22006)	20ms	384 KiB	489 Bytes	2022-12-7 17:28:49
AC	谭红中 (不知道)	20ms	440 KiB	328 Bytes	2022-12-18 20:36:38
AC	徐正旺 (xzw)	20ms	512 KiB	382 Bytes	2023-4-15 10:58:47
AC	周琪渃	20ms	436 KiB	396 Bytes	2022-12-9 22:40:33
AC	22016-oyc	20ms	436 KiB	265 Bytes	2022-12-11 10:31:56
AC	杨颂恩 (yangsongen)	20ms	6.9 MiB	340 Bytes	2023-8-17 18:22:50
AC	wangmulai	20ms	7.3 MiB	281 Bytes	2024-1-18 15:12:47
AC	陈雨泽1	20ms	436 KiB	281 Bytes	2023-1-31 17:15:33
AC	叶哲宇 (yzy)	20ms	6.9 MiB	324 Bytes	2023-7-26 21:00:32
AC	坤坤荔枝小黑子 (zhonghaotian22006)	20ms	432 KiB	322 Bytes	2022-9-11 18:30:24
AC	叶雨昊 (yeyuhao22006)	20ms	384 KiB	489 Bytes	2022-12-7 17:28:51
AC	朱老师 (zyp)	20ms	552 KiB	287 Bytes	2022-8-26 19:45:54
AC	彭崇鑫	20ms	428 KiB	281 Bytes	2023-4-15 17:23:38
AC	叶雨昊 (yeyuhao22006)	20ms	384 KiB	489 Bytes	2022-12-7 17:28:52
AC	什蒂尔布 (吴东航)	20ms	444 KiB	291 Bytes	2023-3-11 15:44:23
AC	chaikexu	20ms	428 KiB	322 Bytes	2022-11-28 21:52:00