希蒙的山

状态	递交者	时间	内存	语言	代码	递交时间
AC	ycy	285ms	6.8 MiB		1 KiB	2023-1-8 21:53:25
AC	段淏泷	287ms	7.7 MiB	C++98	795 Bytes	2024-8-3 15:33:07
AC	林子沫awa (linziyue)	305ms	12.5 MiB		786 Bytes	2023-7-2 17:34:39
AC	stehpen_zuo	326ms	7.6 MiB	C++20	1.1 KiB	2024-5-22 19:26:11
AC	何洋名 (heyangming)	352ms	7.4 MiB		673 Bytes	2023-8-5 12:47:14
AC	zhm123	357ms	9.5 MiB		615 Bytes	2023-11-3 14:26:04
AC	时代一校-赵彦博 (zyb)	362ms	7.4 MiB		595 Bytes	2023-8-25 16:23:24
AC	RanHao	363ms	11.4 MiB		812 Bytes	2023-8-20 11:40:04
AC	scallway	364ms	7.3 MiB		635 Bytes	2023-11-3 14:37:19
AC	胡宸华 (huchenhua)	364ms	7.4 MiB		628 Bytes	2023-8-24 14:55:04
AC	RanHao	364ms	11.4 MiB		812 Bytes	2023-8-20 11:39:54
AC	jdy	364ms	7.3 MiB		702 Bytes	2023-11-3 15:10:49
AC	ganlin1	365ms	10.3 MiB		624 Bytes	2023-8-6 16:29:22
AC	游智棋	366ms	13.9 MiB		628 Bytes	2023-9-20 20:17:21
AC	无尽的想象 (谭仕高)	366ms	7.4 MiB		688 Bytes	2023-11-3 14:09:36
AC	huanglu	368ms	7.2 MiB		658 Bytes	2023-11-3 13:57:55
AC	姚宏逸	368ms	7.4 MiB		628 Bytes	2023-8-24 17:21:38
AC	余晨浩 (yuchenhao)	368ms	7.8 MiB		616 Bytes	2023-8-24 10:43:19
AC	Chter	371ms	7.4 MiB		682 Bytes	2023-11-3 14:19:28
AC	liuser	375ms	7.3 MiB		857 Bytes	2024-1-14 11:19:55
AC	何昊宇 (22016-hhy)	376ms	4.4 MiB		788 Bytes	2023-4-9 10:25:17
AC	RanHao	378ms	7.4 MiB		586 Bytes	2023-11-3 13:54:23
AC	zzl	380ms	9.9 MiB		681 Bytes	2023-11-3 14:58:30
AC	甄一阳 (22016-zyy)	380ms	4.3 MiB		640 Bytes	2023-4-9 10:25:35
AC	22016-yzq	380ms	4.4 MiB		640 Bytes	2023-4-9 10:33:29
AC	zhm123	380ms	7.4 MiB		628 Bytes	2023-8-22 17:40:57
AC	Jack	390ms	7.3 MiB		788 Bytes	2023-8-28 15:24:37
AC	姚宏逸	391ms	7.3 MiB		628 Bytes	2023-8-24 17:21:31
AC	xuniaoyin (徐袅音)	391ms	6.9 MiB		786 Bytes	2023-8-7 11:40:43
AC	ttt123	392ms	4.3 MiB		822 Bytes	2023-4-9 10:24:16
AC	scallway	392ms	5.1 MiB		785 Bytes	2024-1-27 15:24:02
AC	zyl	394ms	5.4 MiB		785 Bytes	2024-1-27 15:26:54
AC	朱老师 (zyp)	395ms	6.8 MiB		847 Bytes	2023-11-3 13:50:31
AC	Nico	395ms	6.8 MiB		846 Bytes	2023-11-3 14:27:52
AC	wangjun	395ms	7.9 MiB		687 Bytes	2023-11-15 17:39:26
AC	王浚西 (22016-wjx)	402ms	4.4 MiB		634 Bytes	2023-4-9 10:48:33
AC	刘老师 (图书管理员)	402ms	6.8 MiB		1.1 KiB	2023-11-3 14:44:10
AC	喻文博 (22016-ywb)	409ms	4.4 MiB		646 Bytes	2023-4-9 10:36:44
AC	LittleHair	414ms	5.3 MiB		685 Bytes	2024-2-22 14:19:29
AC	colin1112 (墙凌可)	424ms	95 MiB		800 Bytes	2023-8-13 11:27:57
AC	张玉坚 (zhangyuian)	427ms	9 MiB		725 Bytes	2023-3-12 17:30:41
AC	22029-lsl	427ms	8.9 MiB		1.4 KiB	2023-4-1 12:17:47
AC	11451254188 (22029-mjh)	445ms	4.4 MiB		628 Bytes	2023-4-1 12:14:50
AC	无尽的想象 (谭仕高)	447ms	4.8 MiB		702 Bytes	2023-3-25 14:02:32
AC	陈杰晟	453ms	4.4 MiB		735 Bytes	2023-3-31 20:58:21
AC	唐良瑞 (22016-tlr01)	454ms	4.4 MiB		746 Bytes	2023-4-9 10:31:02
AC	zcx	455ms	4.4 MiB		626 Bytes	2023-4-1 12:11:05
AC	无尽的想象 (谭仕高)	459ms	4.8 MiB		701 Bytes	2023-3-25 14:03:10
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)	460ms	8.4 MiB		690 Bytes	2023-4-1 12:21:46
AC	缥 (王硕2012)	468ms	8.9 MiB		1.4 KiB	2023-4-1 12:12:33
AC	22016-lyj	477ms	4.4 MiB		654 Bytes	2023-4-9 10:28:24
AC	dengduxi	478ms	8 MiB		628 Bytes	2023-8-24 10:46:16
AC	梁金同 (liangjintong)	482ms	8.2 MiB		628 Bytes	2023-8-24 10:04:01
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)	485ms	8.4 MiB		721 Bytes	2023-4-1 12:22:00
AC	张家豪 (zhangjiahao)	487ms	7.4 MiB		594 Bytes	2023-8-2 13:04:43
AC	ttt123	490ms	4.4 MiB		826 Bytes	2023-4-1 12:12:06
AC	朱老师 (zyp)	499ms	6.9 MiB		1 KiB	2023-8-10 13:39:27
AC	xflt_dyp	504ms	7.8 MiB		661 Bytes	2023-11-3 14:56:01
AC	缥 (王硕2012)	529ms	8.9 MiB		1.4 KiB	2023-4-1 12:17:11
AC	Guest	552ms	7.3 MiB		753 Bytes	2023-11-24 21:11:22
AC	Alduin	558ms	9.4 MiB		578 Bytes	2023-1-8 17:02:23
AC	缥 (王硕2012)	593ms	8.9 MiB		1.4 KiB	2023-4-1 12:17:03
AC	我推的乱破 (贺俊楠)	626ms	7.3 MiB		760 Bytes	2024-1-21 20:55:09
AC	scallway1	663ms	7.3 MiB		746 Bytes	2023-11-24 14:09:11
AC	scallway1	752ms	7.3 MiB		746 Bytes	2023-11-24 14:14:54
AC	龚铭俊 (哈哈哈)	774ms	6.8 MiB		657 Bytes	2023-11-26 9:49:27
AC	时代二校-王盼兮 (wangpanxi)	783ms	7.1 MiB		851 Bytes	2023-11-26 9:40:21
AC	scallway1	786ms	7.3 MiB		635 Bytes	2023-11-24 13:40:16
AC	scallway1	793ms	6.9 MiB		705 Bytes	2023-11-26 9:39:25
AC	秦兴润	803ms	7.1 MiB		849 Bytes	2023-11-26 9:41:10
AC	希蒙 (zhengxingya)	809ms	7.8 MiB		770 Bytes	2024-1-20 11:40:23
AC	张梓浩 (zhangzihao)	814ms	7.3 MiB		753 Bytes	2023-11-24 21:13:20
AC	在煎鱼的肖大总铳 (肖宇航)	828ms	6.9 MiB		702 Bytes	2023-11-26 9:38:05
AC	xyc (谢雨宸)	837ms	7.1 MiB		662 Bytes	2023-11-26 9:51:03
AC	时代二校+马嘉宸 (majiachen)	845ms	6.8 MiB		700 Bytes	2023-11-26 9:35:20
AC	新壹街朱启航 (zhuqihang)	1406ms	9.1 MiB		623 Bytes	2024-3-23 18:17:13
AC	scallway	1417ms	8.4 MiB		673 Bytes	2024-1-27 15:15:49
AC	Jose (反恐皮蛋)	1438ms	5.3 MiB		766 Bytes	2024-3-23 15:38:31
AC	新壹街校区-冉睦阳 (冉睦阳)	1456ms	5.3 MiB		610 Bytes	2024-3-31 10:02:16
AC	嘿嘿	1536ms	6.1 MiB		872 Bytes	2024-2-22 13:21:05