报数模拟

状态	递交者	时间	内存	语言	代码	递交时间
AC	余龙恩 (小码君)	7ms	256 KiB		379 Bytes	2022-11-25 14:39:07
AC	樊竣熠 (lft1114)	7ms	384 KiB		550 Bytes	2022-8-18 17:12:30
AC	chen (peter)	9ms	316 KiB		536 Bytes	2022-11-25 21:35:19
AC	ycy	13ms	384 KiB		503 Bytes	2023-2-10 19:59:52
AC	zhangyh (张育菡)	13ms	512 KiB		459 Bytes	2022-9-12 1:59:43
AC	My name is Man (钟卓劭)	13ms	7 MiB	C++98	381 Bytes	2024-6-26 10:26:01
AC	qwertyuiop	13ms	448 KiB		320 Bytes	2022-3-4 19:23:12
AC	何星震 (Jacob)	13ms	384 KiB		383 Bytes	2023-2-10 20:02:25
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)	13ms	7.1 MiB		293 Bytes	2023-11-12 11:48:59
AC	Guest	13ms	6.7 MiB	C++11	344 Bytes	2024-7-17 17:53:21
AC	luozixi	13ms	392 KiB		387 Bytes	2022-10-23 20:01:29
AC	fengzixuan	13ms	440 KiB		308 Bytes	2023-2-19 21:42:16
AC	蒋青峰	13ms	384 KiB		341 Bytes	2023-5-13 20:27:07
AC	朱老师 (zyp)	13ms	7.3 MiB	C++11	371 Bytes	2024-4-24 19:45:28
AC	曹埊睿 (caodirui)	13ms	512 KiB		321 Bytes	2023-5-1 21:46:52
AC	zyl	13ms	7.2 MiB	C++11(O2)	367 Bytes	2024-5-18 17:57:49
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	13ms	7.2 MiB	C++98	279 Bytes	2024-4-25 19:57:41
AC	_PXY_	13ms	384 KiB		438 Bytes	2022-1-23 11:20:42
AC	时代二校+王吕棪 (wanglvyan)	14ms	7.2 MiB	C++11(O2)	342 Bytes	2024-5-18 17:57:46
AC	郑岐蔚	14ms	392 KiB		405 Bytes	2023-2-10 20:03:00
AC	giao	14ms	384 KiB		370 Bytes	2022-3-4 19:24:54
AC	张梓浩 (zhangzihao)	14ms	7 MiB	C++11(O2)	332 Bytes	2024-6-16 9:42:45
AC	ycy	14ms	392 KiB		362 Bytes	2022-10-19 22:45:47
AC	21035-wyf	14ms	420 KiB		506 Bytes	2022-6-26 12:11:35
AC	时代2校-程俊燃 (chengjunran)	14ms	6.7 MiB	C++11	342 Bytes	2024-7-13 19:44:41
AC	6 (chenjiacheng)	14ms	7.2 MiB	C++98	304 Bytes	2024-4-27 14:08:58
AC	曹埊睿 (caodirui)	14ms	440 KiB		321 Bytes	2023-4-8 22:17:07
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	6.9 MiB		548 Bytes	2023-8-20 15:10:54
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	7.3 MiB	C++98	606 Bytes	2024-4-24 19:26:55
AC	蒲梓勋 (puzixun)	14ms	392 KiB		344 Bytes	2022-10-19 22:50:43
AC	蔡蕊池	14ms	7 MiB	C++11	460 Bytes	2024-5-24 22:26:38
AC	源著校区-惠予宸 (huiyuchen2)	14ms	512 KiB		399 Bytes	2023-5-13 17:43:52
AC	张玉坚 (zhangyuian)	14ms	384 KiB		376 Bytes	2022-10-23 19:58:42
AC	wzzjnb2012	14ms	428 KiB		943 Bytes	2022-11-12 15:19:31
AC	RanHao	14ms	6.7 MiB		271 Bytes	2023-8-23 10:56:21
AC	陈杰晟	14ms	528 KiB		377 Bytes	2022-3-4 19:22:24
AC	MoonLight ( aaa)	14ms	456 KiB		454 Bytes	2022-8-11 10:14:40
AC	xuniaoyin (徐袅音)	14ms	6.8 MiB		315 Bytes	2023-10-1 21:16:28
AC	liushenhao	14ms	384 KiB		324 Bytes	2022-3-4 19:23:42
AC	蒲梓勋 (puzixun)	14ms	384 KiB		312 Bytes	2022-10-21 19:38:50
AC	马渝杭 (mayuhang)	14ms	384 KiB		384 Bytes	2022-10-23 19:59:24
AC	代尚函笛卡尔 (daishanghan)	14ms	404 KiB		395 Bytes	2022-10-23 20:00:05
AC	guozuming	14ms	384 KiB		345 Bytes	2022-12-13 13:18:08
AC	miku (阳沐珊)	14ms	6.9 MiB		498 Bytes	2023-8-20 16:00:44
AC	刘老师 (图书管理员)	14ms	428 KiB		471 Bytes	2023-1-1 17:23:14
AC	姚宏逸	14ms	432 KiB		418 Bytes	2022-3-3 20:00:40
AC	ycy	14ms	384 KiB		686 Bytes	2022-10-21 20:10:11
AC	汪致卉 (wangzh)	14ms	440 KiB		586 Bytes	2022-4-22 19:55:12
AC	时代一校林星宇 (lxy)	15ms	424 KiB		417 Bytes	2023-2-10 18:47:23
AC	罗晨睿 (luochenrui)	15ms	384 KiB		351 Bytes	2022-10-23 19:58:21
AC	colin1112 (墙凌可)	15ms	7.1 MiB		305 Bytes	2023-11-4 17:42:35
AC	本人天生贪生pass (05c41-cqs)	15ms	384 KiB		282 Bytes	2022-10-23 19:09:23
AC	liusihan	15ms	440 KiB		387 Bytes	2022-10-23 20:00:47
AC	黄歆恬 (teresac)	15ms	508 KiB		341 Bytes	2023-3-11 16:09:12
AC	ycy	15ms	384 KiB		326 Bytes	2022-10-19 22:36:49
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB		305 Bytes	2023-7-25 12:26:03
AC	德克萨斯做的到吗 (liyangbao)	15ms	512 KiB		419 Bytes	2022-11-8 23:32:13
AC	黄誉翔 (黄誉翔)	15ms	408 KiB		296 Bytes	2022-10-19 19:44:00
AC	张峻熙	15ms	384 KiB		290 Bytes	2022-10-19 19:41:29
AC	陈玺宇	15ms	6.8 MiB		670 Bytes	2023-10-24 22:56:52
AC	SYH.邵允涵 (Zoe邵)	15ms	440 KiB		374 Bytes	2023-3-2 14:25:18
AC	贾鑫豪 (Mr Sam)	15ms	384 KiB		273 Bytes	2023-3-11 16:12:45
AC	huanglu	15ms	6.7 MiB		319 Bytes	2023-9-13 17:21:44
AC	蒲梓勋 (puzixun)	15ms	392 KiB		344 Bytes	2022-10-19 22:44:38
AC	朱老师 (zyp)	15ms	392 KiB		368 Bytes	2022-10-26 19:09:42
AC	scallway	15ms	7.3 MiB		279 Bytes	2024-1-24 3:54:17
AC	yxj	15ms	512 KiB		324 Bytes	2022-10-22 23:42:49
AC	王彬羽 (wby)	15ms	7.2 MiB	C++11	322 Bytes	2024-4-26 9:14:37
AC	坤坤荔枝小黑子 (zhonghaotian22006)	15ms	448 KiB		565 Bytes	2022-11-12 14:51:22
AC	1396013295	15ms	440 KiB		480 Bytes	2022-10-23 9:26:31
AC	李彭宋代诗人 (ljy123456)	15ms	440 KiB		391 Bytes	2023-4-6 21:07:46
AC	余晨浩 (yuchenhao)	15ms	384 KiB		387 Bytes	2022-10-23 19:58:47
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.8 MiB		286 Bytes	2023-10-26 20:21:11
AC	何晟瑞 (hsr01)	15ms	436 KiB		354 Bytes	2022-11-17 21:38:25
AC	李彦臻	15ms	512 KiB		606 Bytes	2022-11-11 17:42:35
AC	wangzihang	15ms	384 KiB		412 Bytes	2022-10-21 19:27:55
AC	刘致言	15ms	384 KiB		295 Bytes	2022-10-19 19:41:07
AC	zcx	15ms	7 MiB		276 Bytes	2023-7-5 16:25:17
AC	lch (凌昌瀚)	16ms	404 KiB		284 Bytes	2022-10-19 19:48:37
AC	Tender. (05c05-zhou)	16ms	436 KiB		324 Bytes	2022-10-17 21:15:35
AC	黄梓桐 (HuangZiTong)	16ms	400 KiB		334 Bytes	2022-10-15 11:37:07
AC	蒲梓勋 (puzixun)	16ms	512 KiB		344 Bytes	2022-10-26 18:58:59
AC	dengduxi	16ms	512 KiB		401 Bytes	2022-10-23 19:57:27
AC	周琪渃	16ms	6.8 MiB		379 Bytes	2023-6-30 22:40:00
AC	wangzihang	16ms	440 KiB		428 Bytes	2022-10-21 19:24:13
AC	文硕 (文硕1)	16ms	420 KiB		317 Bytes	2023-3-25 18:03:51
AC	dengduxi	16ms	6.8 MiB		398 Bytes	2023-6-23 15:28:06
AC	wuqilin	16ms	392 KiB		286 Bytes	2022-10-19 19:41:24
AC	zlx (xiao)	16ms	440 KiB		337 Bytes	2022-11-26 20:32:07
AC	黄梓桐 (HuangZiTong)	16ms	440 KiB		334 Bytes	2022-10-23 18:32:36
AC	新壹街校区-陈琬舒 (空空大师)	16ms	6.9 MiB		419 Bytes	2023-7-21 8:20:37
AC	陈秋石	16ms	428 KiB		404 Bytes	2022-11-26 18:32:35
AC	时代二校-焦雨齐 (Angel)	16ms	7 MiB		337 Bytes	2023-7-20 15:53:38
AC	关博源	16ms	444 KiB		240 Bytes	2023-3-6 19:45:07
AC	zhangheyi22006	16ms	384 KiB		310 Bytes	2022-10-26 19:15:59
AC	yanglang	16ms	440 KiB		321 Bytes	2022-10-23 11:33:24
AC	朱泽晟	16ms	440 KiB		440 Bytes	2022-10-24 22:26:52
AC	李树崑 (lishukun)	16ms	436 KiB		440 Bytes	2022-10-22 13:08:10
AC	吕淼 (05c41-lm)	17ms	512 KiB		362 Bytes	2022-11-25 20:21:23
AC	邹曜丞 (13983097018)	17ms	7 MiB		325 Bytes	2023-7-20 15:53:43