梦中的统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵泳鑫 (zhaoyongxin)	13ms	296 KiB		260 Bytes	2022-7-17 10:51:10
AC	杨坤霖 (steven)	13ms	276 KiB		277 Bytes	2023-4-9 15:03:37
AC	胡宸华 (huchenhua)	14ms	384 KiB		264 Bytes	2022-12-1 23:39:32
AC	贾博涵	15ms	6.6 MiB		566 Bytes	2023-11-22 11:26:16
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	15ms	7 MiB		316 Bytes	2023-12-3 15:55:43
AC	时代二校-王盼兮 (wangpanxi)	16ms	7 MiB		316 Bytes	2023-12-24 10:59:11
AC	疯神芭芭脱丝 (李卓修)	16ms	316 KiB		241 Bytes	2022-7-14 16:10:20
AC	时代2校-程俊燃 (chengjunran)	24ms	7.3 MiB		289 Bytes	2024-1-20 18:28:56
AC	张瑞博	25ms	7 MiB	C++11	252 Bytes	2024-6-20 21:45:18
AC	黄梓桐 (HuangZiTong)	25ms	384 KiB		319 Bytes	2022-8-5 18:23:12
AC	许梓宸 (xuzichen)	25ms	6.7 MiB	C++17(O2)	257 Bytes	2024-7-17 16:25:16
AC	22016-ggs	25ms	392 KiB		237 Bytes	2022-8-17 16:29:37
AC	勾晨禹	25ms	7.1 MiB	C++17	256 Bytes	2024-6-28 20:34:52
AC	杜俊宏	26ms	384 KiB		287 Bytes	2022-7-11 16:24:47
AC	付博plus	26ms	384 KiB		239 Bytes	2023-4-9 16:24:57
AC	U城校区-邓皓月 (邓皓月)	26ms	7.2 MiB	C++98	288 Bytes	2024-5-12 10:20:48
AC	yang	26ms	392 KiB		301 Bytes	2022-12-9 10:23:39
AC	kongql	26ms	6.8 MiB	C++11	421 Bytes	2024-5-22 16:21:01
AC	Yuan (Zongzi1)	26ms	6.7 MiB	C++17(O2)	322 Bytes	2024-7-18 17:15:23
AC	王乐仪	26ms	384 KiB		248 Bytes	2022-2-5 15:38:51
AC	姚宏逸	26ms	512 KiB		342 Bytes	2022-2-5 23:42:43
AC	shenyushun1	26ms	384 KiB		313 Bytes	2022-6-19 10:54:37
AC	My name is Man (钟卓劭)	26ms	7 MiB	C++98	241 Bytes	2024-6-2 14:10:45
AC	heyi	26ms	6.8 MiB	C++98(O2)	320 Bytes	2024-8-11 9:46:10
AC	赵沛喆	26ms	396 KiB		323 Bytes	2022-6-19 11:12:53
AC	极为的好van的 (lyq)	26ms	384 KiB		225 Bytes	2022-7-28 9:59:52
AC	Guest	26ms	7.2 MiB	C++98(O2)	342 Bytes	2024-6-9 17:07:06
AC	谭懿轩 (yanyixuan)	26ms	512 KiB		237 Bytes	2022-3-25 22:03:18
AC	zzl	26ms	384 KiB		591 Bytes	2023-5-25 11:49:18
AC	胡澜之 (666hlz666)	27ms	384 KiB		1.1 KiB	2023-5-10 20:29:47
AC	叶哲宇 (yzy)	27ms	7 MiB	C++11	235 Bytes	2024-5-24 22:19:48
AC	张祖名	27ms	6.9 MiB	C++98(O2)	308 Bytes	2024-6-10 22:11:22
AC	黄梓轩 (huangzixuan)	27ms	392 KiB		305 Bytes	2023-4-9 15:03:19
AC	向俊熙 (xiangjunxi23003)	27ms	384 KiB		505 Bytes	2023-4-4 19:07:54
AC	汪致卉 (wangzh)	27ms	416 KiB		342 Bytes	2022-1-29 0:02:48
AC	谭俊贤	27ms	7.3 MiB		287 Bytes	2024-1-16 15:33:05
AC	朱老师 (zyp)	27ms	428 KiB		527 Bytes	2023-4-4 18:47:56
AC	阮 (媚狐不吃道旁李)	27ms	6.9 MiB	C++98	284 Bytes	2024-5-25 16:37:56
AC	MoonLight ( aaa)	27ms	384 KiB		357 Bytes	2022-4-10 18:55:04
AC	坤坤荔枝小黑子 (zhonghaotian22006)	27ms	384 KiB		408 Bytes	2023-2-22 20:12:09
AC	ycy	27ms	512 KiB		333 Bytes	2022-6-16 17:32:59
AC	偽艺術家 (chenyanchi22006)	27ms	400 KiB		608 Bytes	2022-6-25 8:08:22
AC	任童(rentong)	27ms	440 KiB		314 Bytes	2022-7-2 14:57:53
AC	爱琴海校区-刁钲洋 (刁钲洋)	27ms	6.8 MiB		541 Bytes	2023-10-8 20:03:19
AC	李书翰 (lishuhan)	28ms	384 KiB		275 Bytes	2022-2-10 13:36:22
AC	444444444 (唐跃元)	28ms	412 KiB		572 Bytes	2023-4-8 15:29:12
AC	laiyouming22031	28ms	512 KiB		231 Bytes	2022-11-20 13:20:08
AC	zhm123	28ms	392 KiB		249 Bytes	2022-12-9 10:09:20
AC	Erin	28ms	7.1 MiB	C++98	248 Bytes	2024-5-14 15:23:52
AC	canna	28ms	6.8 MiB		340 Bytes	2023-10-17 12:24:04
AC	殷语函	28ms	6.9 MiB	C++11	306 Bytes	2024-8-23 21:55:58
AC	时代一校-赵彦博 (zyb)	28ms	448 KiB		291 Bytes	2023-5-7 13:19:46
AC	蒲梓勋 (puzixun)	28ms	384 KiB		332 Bytes	2023-1-31 13:26:55
AC	刘煜轩	28ms	7 MiB		249 Bytes	2023-11-13 20:51:35
AC	无尽的想象 (谭仕高)	28ms	444 KiB		245 Bytes	2022-7-29 18:55:48
AC	wangruibo20xh	28ms	396 KiB		357 Bytes	2022-2-11 14:27:01
AC	中岛敦 (黄麒瑞)	28ms	6.8 MiB		266 Bytes	2023-10-3 11:27:35
AC	朱泽晟	29ms	444 KiB		199 Bytes	2022-2-14 10:07:49
AC	chen (peter)	29ms	440 KiB		541 Bytes	2023-4-22 11:30:19
AC	lch (凌昌瀚)	29ms	512 KiB		686 Bytes	2022-8-4 16:01:09
AC	贺睿林	29ms	7.3 MiB		668 Bytes	2023-10-28 11:36:15
AC	SYC0226	29ms	512 KiB		615 Bytes	2022-3-20 13:23:31
AC	我推的乱破 (贺俊楠)	29ms	392 KiB		266 Bytes	2023-3-26 17:54:56
AC	周琪渃	29ms	6.7 MiB		292 Bytes	2023-9-8 21:36:41
AC	源著校区-宋昊成 (马冬梅)	29ms	436 KiB		2 KiB	2023-2-25 18:29:28
AC	陈杰晟	29ms	432 KiB		313 Bytes	2022-3-24 15:22:37
AC	我推的乱破 (贺俊楠)	29ms	384 KiB		301 Bytes	2023-3-26 18:00:10
AC	yanglang	29ms	512 KiB		286 Bytes	2023-2-12 8:40:26
AC	我推的乱破 (贺俊楠)	29ms	392 KiB		301 Bytes	2023-3-26 18:00:07
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)	29ms	400 KiB		244 Bytes	2023-5-26 19:17:57
AC	朱老师 (zyp)	29ms	432 KiB		271 Bytes	2022-8-17 16:17:44
AC	maomao	29ms	512 KiB		267 Bytes	2022-6-1 18:56:25
AC	吴俊成 (wujuncheng)	29ms	440 KiB		247 Bytes	2022-7-11 10:36:33
AC	刘煜轩	29ms	7.2 MiB		249 Bytes	2023-10-28 11:43:41
AC	zhoumingze23017	29ms	6.7 MiB		251 Bytes	2023-8-31 15:40:13
AC	伍行念 (wuxingnian)	29ms	6.8 MiB		458 Bytes	2023-10-8 11:39:00
AC	zhuziyu	30ms	428 KiB		329 Bytes	2022-2-19 9:32:32
AC	pandap&a王皓宸 (WANGHAOCHEN)	30ms	512 KiB		358 Bytes	2023-2-24 18:03:49
AC	11111	30ms	432 KiB		263 Bytes	2022-6-26 13:25:54
AC	吴佳智 (AWM)	30ms	512 KiB		1.1 KiB	2023-5-10 20:28:31
AC	刘政君 (lzj)	30ms	512 KiB		299 Bytes	2022-9-16 18:23:35
AC	我推的乱破 (贺俊楠)	30ms	392 KiB		301 Bytes	2023-3-26 18:00:09
AC	朱老师 (zyp)	30ms	7 MiB	C++11	306 Bytes	2024-6-20 21:43:09
AC	wangzihang	30ms	384 KiB		362 Bytes	2023-4-1 18:00:03
AC	我推的乱破 (贺俊楠)	30ms	384 KiB		301 Bytes	2023-3-26 18:00:09
AC	zhm123	30ms	512 KiB		239 Bytes	2022-11-16 19:37:08
AC	colin1112 (墙凌可)	30ms	6.7 MiB		658 Bytes	2023-9-1 16:58:56
AC	11451254188 (22029-mjh)	30ms	6.7 MiB		215 Bytes	2023-9-15 19:06:47
AC	黄立信	30ms	6.8 MiB		340 Bytes	2023-10-20 21:55:34
AC	我推的乱破 (贺俊楠)	30ms	384 KiB		301 Bytes	2023-3-26 18:00:09
AC	我推的乱破 (贺俊楠)	30ms	384 KiB		301 Bytes	2023-3-26 18:00:10
AC	任远宁 (renyuanning)	30ms	444 KiB		243 Bytes	2023-2-25 20:32:31
AC	曹埊睿 (caodirui)	30ms	440 KiB		270 Bytes	2023-4-18 19:03:15
AC	luoluonuoya	30ms	512 KiB		270 Bytes	2022-8-29 15:04:29
AC	CK (李弘毅)	30ms	384 KiB		682 Bytes	2022-10-1 15:47:25
AC	scallway	30ms	436 KiB		688 Bytes	2022-10-1 13:46:52
AC	呵呵呵 (陈思琦)	31ms	432 KiB		721 Bytes	2022-10-1 8:50:26
AC	我推的乱破 (贺俊楠)	31ms	384 KiB		301 Bytes	2023-3-26 18:00:09
AC	huanglu	31ms	6.9 MiB		248 Bytes	2023-7-18 14:21:12
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	31ms	6.7 MiB		265 Bytes	2023-8-26 12:43:47