数据纠错

状态	递交者	时间	内存	语言	代码	递交时间
AC	wangjun	5ms	6.7 MiB		637 Bytes	2023-11-15 13:28:03
AC	时代二校+马嘉宸 (majiachen)	8ms	6.9 MiB		506 Bytes	2023-11-30 18:18:47
AC	wangjun	9ms	6.7 MiB		621 Bytes	2023-11-15 13:27:24
AC	张梓浩 (zhangzihao)	11ms	7.1 MiB		491 Bytes	2023-11-14 20:49:59
AC	RanHao	14ms	7.2 MiB	C++98	634 Bytes	2024-4-29 10:45:03
AC	希蒙 (zhengxingya)	14ms	7 MiB	C++98	556 Bytes	2024-6-8 9:05:18
AC	xflt_dyp	14ms	384 KiB		559 Bytes	2023-5-2 20:43:17
AC	嘉宝 (王淳恺)	14ms	6.7 MiB	C++98	584 Bytes	2024-8-2 11:35:00
AC	wuzhenghan	14ms	384 KiB		693 Bytes	2023-4-3 19:48:06
AC	qhx	14ms	6.7 MiB	C++98(O2)	515 Bytes	2024-8-1 21:30:59
AC	时代一校 - 范子煜 (范子煜)	14ms	6.8 MiB	C++20	571 Bytes	2024-8-4 21:57:30
AC	zzzrrrxxx	14ms	6.9 MiB	C++98	454 Bytes	2024-6-13 18:16:34
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	14ms	384 KiB		497 Bytes	2023-5-18 21:59:16
AC	靳博然 (jbr)	14ms	384 KiB		598 Bytes	2023-5-21 18:22:33
AC	zhm123	14ms	444 KiB		504 Bytes	2023-3-6 17:18:07
AC	安闵煜 (anzai)	15ms	6.8 MiB	C++11	1.6 KiB	2024-8-10 14:39:47
AC	wuzhenghan	15ms	384 KiB		693 Bytes	2023-4-3 19:48:05
AC	王昱祺 (12王昱祺)	15ms	392 KiB		583 Bytes	2023-4-2 18:09:28
AC	sqmyb	15ms	512 KiB		557 Bytes	2023-2-19 18:45:32
AC	缥 (王硕2012)	15ms	436 KiB		1.1 KiB	2023-2-26 21:37:28
AC	张瑞博	15ms	7 MiB	C++11	522 Bytes	2024-5-19 18:09:49
AC	陈泰羽 (chentaiyu)	15ms	384 KiB		615 Bytes	2023-5-17 19:26:49
AC	时代一校-曾科智 (曾科智)	15ms	392 KiB		570 Bytes	2023-5-2 20:43:47
AC	余彦瑞	15ms	428 KiB		587 Bytes	2023-4-30 12:28:25
AC	wuzhenghan	15ms	384 KiB		693 Bytes	2023-4-3 19:48:05
AC	郭益豪（帅哥） (guoyihao)	15ms	392 KiB		540 Bytes	2023-5-14 17:39:31
AC	wuzhenghan	15ms	384 KiB		693 Bytes	2023-4-3 19:48:05
AC	wuzhenghan	15ms	384 KiB		693 Bytes	2023-4-3 19:48:05
AC	缥 (王硕2012)	15ms	512 KiB		1.1 KiB	2023-3-25 9:54:04
AC	缥 (王硕2012)	15ms	384 KiB		1.1 KiB	2023-2-19 19:52:33
AC	Erin	15ms	6.8 MiB	C++98	568 Bytes	2024-8-10 14:33:44
AC	孙烽轶 (sfy)	15ms	436 KiB		569 Bytes	2023-4-24 19:43:23
AC	xuniaoyin (徐袅音)	15ms	384 KiB		481 Bytes	2023-5-17 19:35:04
AC	刘老师 (图书管理员)	15ms	384 KiB		634 Bytes	2023-5-26 20:46:54
AC	wzzjnb2012	15ms	436 KiB		1.1 KiB	2023-3-1 21:12:43
AC	Yuan (Zongzi1)	15ms	6.8 MiB	C++17(O2)	786 Bytes	2024-8-10 14:34:30
AC	wuzhenghan	15ms	384 KiB		693 Bytes	2023-4-3 19:47:39
AC	霍弈丞小号	15ms	432 KiB		579 Bytes	2023-2-19 16:59:01
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	384 KiB		747 Bytes	2023-5-17 19:20:04
AC	邹曜丞 (13983097018)	16ms	6.8 MiB		573 Bytes	2023-10-3 14:04:37
AC	缥 (王硕2012)	16ms	472 KiB		1.1 KiB	2023-3-25 9:54:06
AC	缥 (王硕2012)	16ms	392 KiB		1.1 KiB	2023-3-25 9:54:04
AC	爱琴海校区-黄辰浩 (huangchenhao)	16ms	512 KiB		716 Bytes	2023-5-17 19:25:41
AC	章愉霖	16ms	432 KiB		543 Bytes	2023-5-14 17:23:59
AC	22029-zjs	16ms	384 KiB		671 Bytes	2023-3-25 9:51:35
AC	13808364288	16ms	436 KiB		604 Bytes	2023-2-25 19:48:05
AC	原著校区巫映秋 (巫映秋1a)	16ms	444 KiB		516 Bytes	2023-4-9 18:00:53
AC	呵 (mohaoran)	16ms	384 KiB		511 Bytes	2023-4-16 11:44:55
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:06
AC	缥 (王硕2012)	16ms	392 KiB		1.1 KiB	2023-3-25 9:54:02
AC	余彦瑞	16ms	436 KiB		579 Bytes	2023-2-19 17:07:38
AC	zzl	16ms	384 KiB		450 Bytes	2023-2-24 17:14:51
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:07
AC	缥 (王硕2012)	16ms	392 KiB		1.1 KiB	2023-3-25 9:54:05
AC	无尽的想象 (谭仕高)	16ms	432 KiB		523 Bytes	2023-2-22 16:38:16
AC	伍芷函	16ms	512 KiB		638 Bytes	2023-2-19 17:09:48
AC	缥 (王硕2012)	16ms	400 KiB		1.1 KiB	2023-3-25 9:54:08
AC	zcx	16ms	384 KiB		515 Bytes	2023-3-25 9:48:04
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:06
AC	缥 (王硕2012)	16ms	392 KiB		1.1 KiB	2023-3-25 9:54:09
AC	22029-lsl	16ms	384 KiB		540 Bytes	2023-3-25 10:02:49
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:05
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:09
AC	乐瀚阳 (yuehanyang)	16ms	6.9 MiB		441 Bytes	2023-8-19 15:35:38
AC	缥 (王硕2012)	16ms	416 KiB		1.1 KiB	2023-3-25 9:54:03
AC	缥 (王硕2012)	16ms	384 KiB		1.1 KiB	2023-3-25 9:54:09
AC	缥 (王硕2012)	16ms	492 KiB		1.1 KiB	2023-3-25 9:54:03
AC	缥 (王硕2012)	17ms	384 KiB		1.1 KiB	2023-3-25 9:54:07
AC	缥 (王硕2012)	17ms	384 KiB		1.1 KiB	2023-3-25 9:54:08
AC	缥 (王硕2012)	17ms	512 KiB		1.1 KiB	2023-3-25 9:54:07
AC	wuzhenghan	17ms	384 KiB		693 Bytes	2023-4-3 19:48:05
AC	缥 (王硕2012)	17ms	392 KiB		1.1 KiB	2023-3-25 9:54:02
AC	缥 (王硕2012)	17ms	396 KiB		1.1 KiB	2023-3-25 9:54:06
AC	李旻轩	17ms	7.2 MiB		676 Bytes	2023-6-10 19:54:06
AC	缥 (王硕2012)	17ms	384 KiB		1.1 KiB	2023-3-25 9:54:00
AC	colin1112 (墙凌可)	17ms	6.9 MiB		646 Bytes	2023-11-11 9:58:57
AC	缥 (王硕2012)	17ms	400 KiB		1.1 KiB	2023-3-25 9:54:08
AC	缥 (王硕2012)	17ms	384 KiB		1.1 KiB	2023-3-25 9:54:06
AC	缥 (王硕2012)	17ms	392 KiB		1.1 KiB	2023-3-25 9:54:03
AC	缥 (王硕2012)	17ms	424 KiB		1.1 KiB	2023-3-25 9:54:02
AC	王义苇 (wangyiwei)	17ms	6.7 MiB		679 Bytes	2023-8-31 17:55:58
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)	17ms	496 KiB		817 Bytes	2023-3-22 19:00:13
AC	缥 (王硕2012)	17ms	384 KiB		1.1 KiB	2023-3-25 9:54:08
AC	城 (liqc)	17ms	6.7 MiB		563 Bytes	2023-1-9 17:40:52
AC	CK (李弘毅)	17ms	7 MiB		716 Bytes	2023-11-12 13:53:11
AC	缥 (王硕2012)	17ms	392 KiB		1.1 KiB	2023-3-25 9:53:59
AC	甄一阳 (22016-zyy)	17ms	512 KiB		544 Bytes	2023-3-26 12:10:29
AC	爱琴海校区-黄辰浩 (huangchenhao)	17ms	6.7 MiB		716 Bytes	2023-8-22 13:14:13
AC	11451254188 (22029-mjh)	18ms	444 KiB		570 Bytes	2023-3-23 20:32:01
AC	缥 (王硕2012)	18ms	392 KiB		1.1 KiB	2023-3-25 9:54:04
AC	新壹街朱启航 (zhuqihang)	18ms	6.9 MiB		553 Bytes	2023-7-9 8:36:58
AC	SYH.邵允涵 (Zoe邵)	18ms	440 KiB		543 Bytes	2023-3-17 19:40:29
AC	新壹街——陈学彬 (BUG)	18ms	6.9 MiB		570 Bytes	2023-7-6 10:36:55
AC	scallway	18ms	6.9 MiB		633 Bytes	2023-8-19 15:17:01
AC	时代一校-赵彦博 (zyb)	18ms	6.7 MiB		441 Bytes	2023-8-25 16:33:32
AC	缥 (王硕2012)	18ms	512 KiB		1.1 KiB	2023-3-25 9:54:00
AC	爱情海校区—沙天一 (沙天一)	18ms	6.9 MiB		472 Bytes	2023-7-9 8:49:58
AC	ttt123	18ms	440 KiB		736 Bytes	2023-3-24 23:35:08
AC	wangjun	19ms	6.7 MiB		612 Bytes	2023-11-15 13:32:58
AC	朱老师 (zyp)	19ms	432 KiB		662 Bytes	2023-5-18 16:38:01