统计字符信息

状态	递交者	时间	内存	代码	递交时间
AC	马兴宇 (mxy01)	15ms	512 KiB	472 Bytes	2022-10-1 19:19:24
AC	qinyi	15ms	424 KiB	456 Bytes	2023-2-10 19:24:35
AC	https://www.minecraft.net/zh-hans (王振西)	15ms	6.9 MiB	379 Bytes	2023-6-18 14:38:23
AC	梅子楠 (22016-mzn)	15ms	512 KiB	464 Bytes	2022-9-11 11:37:10
AC	8086	15ms	7.7 MiB	408 Bytes	2023-7-12 11:21:51
AC	中二游侠(๑•̀ㅂ•́)و✧ (张凯翔)	15ms	440 KiB	500 Bytes	2022-9-10 10:52:56
AC	Z.饮月君 (张皓南)	15ms	424 KiB	377 Bytes	2022-10-30 17:23:49
AC	繁星 (05c35-zzm)	15ms	392 KiB	524 Bytes	2022-11-6 10:44:56
AC	22016-ggs	15ms	444 KiB	464 Bytes	2022-9-11 11:37:12
AC	漆星语 (qixingyu)	15ms	7.5 MiB	429 Bytes	2023-7-3 9:31:00
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB	495 Bytes	2023-7-27 19:40:14
AC	黄梓桐 (HuangZiTong)	15ms	384 KiB	359 Bytes	2022-8-26 13:22:34
AC	许炜铭 (xuweiming)	15ms	6.9 MiB	458 Bytes	2023-7-18 16:35:36
AC	leisixian (22029-lyh)	15ms	384 KiB	419 Bytes	2022-12-13 11:47:30
AC	iLansensei (hjs(Caster))	15ms	448 KiB	422 Bytes	2022-11-6 10:14:26
AC	贺睿林	15ms	6.7 MiB	435 Bytes	2023-6-4 11:45:10
AC	CK (李弘毅)	15ms	384 KiB	454 Bytes	2022-10-30 10:40:08
AC	何昊宇 (22016-hhy)	15ms	432 KiB	433 Bytes	2022-9-11 9:16:10
AC	巨珩宇	15ms	520 KiB	419 Bytes	2023-5-12 22:04:03
AC	22029-lsl	15ms	392 KiB	392 Bytes	2022-12-17 12:28:04
AC	乐瀚阳 (yuehanyang)	15ms	436 KiB	398 Bytes	2023-4-15 17:21:44
AC	文硕 (文硕1)	15ms	512 KiB	391 Bytes	2022-7-12 11:50:01
AC	张雯皓 (zhangwenhao)	15ms	7.2 MiB	431 Bytes	2023-12-23 11:28:52
AC	陈佳婧	15ms	512 KiB	488 Bytes	2022-9-9 20:54:17
AC	林凡童 (lft)	15ms	440 KiB	583 Bytes	2022-9-15 20:03:44
AC	jinitaimei	15ms	384 KiB	367 Bytes	2022-12-4 17:27:30
AC	の (魏子恒)	15ms	436 KiB	454 Bytes	2022-9-13 18:43:19
AC	新壹街.曾祥睿 (zxr)	15ms	6.8 MiB	401 Bytes	2023-10-21 13:07:22
AC	邵冠铖 (shaoguancheng22031)	15ms	396 KiB	306 Bytes	2022-12-18 11:08:25
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	15ms	384 KiB	494 Bytes	2023-1-17 15:36:50
AC	Tender. (05c05-zhou)	15ms	460 KiB	448 Bytes	2022-10-19 21:53:58
AC	缥 (王硕2012)	15ms	392 KiB	445 Bytes	2022-12-18 11:02:58
AC	AC[谭赫奕] (tanheyi)	15ms	512 KiB	447 Bytes	2023-4-17 10:40:14
AC	RanHao	15ms	6.9 MiB	563 Bytes	2023-7-26 11:26:28
AC	高国瑞	15ms	6.9 MiB	486 Bytes	2023-7-30 10:30:17
AC	11451254188 (22029-mjh)	15ms	392 KiB	544 Bytes	2022-12-14 18:01:06
AC	胡程禹	15ms	6.7 MiB	479 Bytes	2023-9-13 20:45:02
AC	新壹街-张博涵 (张博涵)	15ms	6.9 MiB	392 Bytes	2023-8-10 13:02:36
AC	谢欣霖 (xiexinlin)	15ms	512 KiB	458 Bytes	2022-11-17 12:17:07
AC	胡宸华 (huchenhua)	15ms	7.6 MiB	404 Bytes	2023-7-12 10:54:49
AC	zry	15ms	512 KiB	538 Bytes	2022-11-6 9:50:56
AC	hyh22031	15ms	384 KiB	355 Bytes	2022-12-18 11:11:26
AC	zyl	15ms	7.3 MiB	685 Bytes	2024-1-6 14:15:11
AC	蒲梓勋 (puzixun)	15ms	444 KiB	534 Bytes	2022-10-18 21:30:51
AC	无尽的想象 (谭仕高)	15ms	384 KiB	649 Bytes	2022-8-26 16:15:37
AC	李彦臻	16ms	7 MiB	487 Bytes	2023-12-3 20:58:09
AC	杨颂恩 (yangsongen)	16ms	6.9 MiB	382 Bytes	2023-8-19 19:12:29
AC	无尽的想象 (谭仕高)	16ms	384 KiB	301 Bytes	2022-8-26 16:11:34
AC	史韵哲	16ms	6.6 MiB	439 Bytes	2023-6-4 11:05:21
AC	Jack	16ms	432 KiB	481 Bytes	2023-3-22 19:36:01
AC	魑归sama	16ms	432 KiB	446 Bytes	2022-7-12 16:45:04
AC	三差学生(尘埃蓝莓) (白佳睿)	16ms	8.4 MiB	455 Bytes	2023-7-10 17:57:56
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	16ms	384 KiB	368 Bytes	2022-12-17 11:48:31
AC	zcx	16ms	392 KiB	493 Bytes	2022-12-14 19:47:33
AC	zhangzhixiong	16ms	6.9 MiB	411 Bytes	2023-6-18 14:43:59
AC	zhangheyi22006	16ms	420 KiB	350 Bytes	2022-11-3 20:08:57
AC	lihaoyi	16ms	392 KiB	352 Bytes	2022-12-18 11:08:47
AC	zhm123	16ms	384 KiB	359 Bytes	2022-11-24 17:52: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)	16ms	512 KiB	521 Bytes	2022-12-13 18:41:53
AC	付柏乐	16ms	7.4 MiB	426 Bytes	2023-7-20 15:08:18
AC	liusitong	16ms	7 MiB	399 Bytes	2023-6-18 15:40:04
AC	wzzjnb2012	16ms	440 KiB	651 Bytes	2022-10-6 10:00:48
AC	我很6 (zjj22031)	16ms	392 KiB	355 Bytes	2022-12-18 11:05:52
AC	周琪渃	16ms	392 KiB	550 Bytes	2022-11-28 18:36:21
AC	刘致言	16ms	444 KiB	465 Bytes	2023-3-22 18:40:40
AC	不怎么聪明的家伙 (贺俊楠)	16ms	384 KiB	520 Bytes	2023-4-12 20:51:53
AC	汤杰尧 (05c05-tjy1)	16ms	440 KiB	494 Bytes	2022-11-4 22:24:36
AC	陈雨泽1	16ms	512 KiB	689 Bytes	2022-10-1 15:32:56
AC	黄诗童 (hst01)	16ms	436 KiB	404 Bytes	2022-11-4 19:26:46
AC	SYH.邵允涵 (Zoe邵)	16ms	428 KiB	411 Bytes	2023-3-17 20:19:42
AC	叶雨昊 (yeyuhao22006)	16ms	436 KiB	396 Bytes	2022-10-23 20:19:10
AC	时代一校林星宇 (lxy)	16ms	440 KiB	427 Bytes	2022-10-29 21:24:30
AC	laiyouming22031	16ms	440 KiB	336 Bytes	2022-12-18 10:36:14
AC	22029-zjs	16ms	436 KiB	524 Bytes	2022-12-17 11:54:34
AC	司雨来 (siyulai)	16ms	512 KiB	501 Bytes	2023-1-15 20:10:39
AC	何晟瑞 (hsr01)	16ms	512 KiB	570 Bytes	2022-10-6 21:21:28
AC	我是个s* (lijinze)	16ms	6.8 MiB	510 Bytes	2023-6-28 14:21:39
AC	靳博然 (jbr)	17ms	6.8 MiB	418 Bytes	2023-6-18 16:50:37
AC	郑岐蔚	17ms	428 KiB	424 Bytes	2023-1-26 14:48:20
AC	许嘉恩 (xje22031)	17ms	512 KiB	380 Bytes	2022-12-21 19:44:41
AC	hxb	17ms	432 KiB	380 Bytes	2023-3-24 17:43:06
AC	新壹街校区-罗斤天 (罗斤天)	17ms	7 MiB	427 Bytes	2023-7-9 9:00:37
AC	Error404sans (焦阳浩云)	17ms	6.8 MiB	379 Bytes	2023-6-18 16:40:10
AC	昌文迪 (05c05-cwd2)	17ms	392 KiB	414 Bytes	2022-11-4 21:15:44
AC	时代一校-曾科智 (曾科智)	17ms	456 KiB	723 Bytes	2022-9-10 20:38:12
AC	leisixian (22029-lyh)	17ms	428 KiB	428 Bytes	2022-12-13 11:47:22
AC	张峻瑞	17ms	512 KiB	459 Bytes	2022-9-14 1:03:21
AC	葛琮扬	17ms	6.9 MiB	400 Bytes	2023-7-21 12:13:59
AC	guozuming	17ms	436 KiB	371 Bytes	2022-12-11 9:26:57
AC	朱老师 (zyp)	17ms	512 KiB	338 Bytes	2022-12-18 11:02:02
AC	欧俊阳	17ms	6.9 MiB	419 Bytes	2023-8-9 13:34:35
AC	小根哥	19ms	512 KiB	430 Bytes	2022-8-26 12:34:56
AC	SB (mfy01)	19ms	432 KiB	451 Bytes	2023-2-3 17:49:31
AC	金海童1	19ms	7 MiB	459 Bytes	2023-12-31 15:34:18
AC	周米骐 (zsb)	20ms	6.8 MiB	486 Bytes	2023-11-9 17:54:48
AC	wangjun	21ms	6.7 MiB	452 Bytes	2023-11-15 14:19:59
AC	luosifu22006	23ms	512 KiB	429 Bytes	2022-11-3 20:19:28
AC	坤坤荔枝小黑子 (zhonghaotian22006)	26ms	7 MiB	420 Bytes	2023-12-19 19:27:04
AC	wangzihang	28ms	6.9 MiB	424 Bytes	2023-12-4 16:58:05
AC	My name is Man (钟卓劭)	61ms	576 KiB	413 Bytes	2024-4-4 12:59:37