平方计算

状态	递交者	时间	内存	语言	代码	递交时间
AC	谭懿轩 (yanyixuan)	9ms	308 KiB		102 Bytes	2022-10-17 13:47:22
AC	11451254188 (22029-mjh)	12ms	408 KiB		131 Bytes	2022-11-20 19:07:08
AC	张瑞博	12ms	6.9 MiB	C++11	121 Bytes	2024-6-3 20:39:00
AC	胡澜之 (666hlz666)	13ms	7 MiB	C++11	136 Bytes	2024-8-24 20:25:28
AC	22029-zjs	13ms	384 KiB		133 Bytes	2022-11-20 18:54:44
AC	wuzhenghan	13ms	384 KiB		118 Bytes	2023-5-15 21:02:59
AC	TBB (杜昊燃)	13ms	436 KiB		187 Bytes	2022-9-13 16:19:24
AC	赵鑫宸 (xiaoxiao721)	13ms	456 KiB		118 Bytes	2022-9-17 15:47:56
AC	时代2校-程俊燃 (chengjunran)	14ms	6.9 MiB	C++11(O2)	118 Bytes	2024-8-24 16:47:55
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		122 Bytes	2023-10-15 10:39:24
AC	22029-hqh	14ms	444 KiB		111 Bytes	2022-11-20 20:47:13
AC	不怎么聪明的家伙 (贺俊楠)	14ms	6.8 MiB		115 Bytes	2023-10-15 9:03:28
AC	吴恩子	14ms	6.8 MiB		114 Bytes	2023-10-11 21:23:48
AC	lll	14ms	384 KiB		118 Bytes	2022-9-6 15:49:00
AC	李山水	14ms	512 KiB		113 Bytes	2022-9-12 15:14:25
AC	新壹街校区-杨轩懿 (杨轩懿1)	14ms	6.8 MiB		112 Bytes	2023-10-15 9:02:24
AC	许嘉恩 (xje22031)	14ms	444 KiB		127 Bytes	2022-11-20 18:59:21
AC	时代一校 - 冯隆浩 (冯隆浩)	14ms	444 KiB		113 Bytes	2023-4-18 15:24:56
AC	没有此人 (akm)	14ms	7 MiB	C++14	120 Bytes	2024-5-18 13:53:29
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	512 KiB		126 Bytes	2022-8-29 16:09:35
AC	爱琴海校区-刁钲洋 (刁钲洋)	14ms	440 KiB		101 Bytes	2023-2-7 19:29:27
AC	孙烽轶 (sfy)	14ms	6.8 MiB	C++98	106 Bytes	2024-8-11 20:36:22
AC	姚宏逸	14ms	388 KiB		248 Bytes	2022-10-17 19:57:01
AC	芒苒忧 (廖迦南)	14ms	452 KiB		126 Bytes	2022-8-27 15:38:52
AC	ttt123	14ms	432 KiB		123 Bytes	2022-11-20 19:37:11
AC	luoluonuoya	14ms	436 KiB		116 Bytes	2022-8-29 15:28:10
AC	(张洛诚)	14ms	436 KiB		132 Bytes	2023-4-23 20:32:58
AC	樊竣熠 (lft1114)	14ms	392 KiB		111 Bytes	2022-8-26 12:02:28
AC	ttt123	15ms	432 KiB		125 Bytes	2022-11-20 19:36:56
AC	杜俊宏	15ms	444 KiB		126 Bytes	2022-8-27 8:53:58
AC	新壹街校区--税崇峻 (税崇峻)	15ms	6.8 MiB		124 Bytes	2023-10-2 9:30:43
AC	Randy Marsh (杨子腾)	15ms	432 KiB		123 Bytes	2023-1-3 15:16:54
AC	22029-lsl	15ms	432 KiB		112 Bytes	2022-11-20 18:42:38
AC	leisixian (22029-lyh)	15ms	428 KiB		109 Bytes	2022-11-20 16:07:38
AC	疯神芭芭脱丝 (李卓修)	15ms	436 KiB		123 Bytes	2022-8-28 21:01:24
AC	wuzhenghan	15ms	440 KiB		118 Bytes	2023-5-15 21:01:51
AC	叶哲宇 (yzy)	15ms	6.7 MiB		118 Bytes	2023-9-3 17:29:15
AC	何昊宇 (22016-hhy)	15ms	6.9 MiB		139 Bytes	2023-8-13 10:23:56
AC	黄彦熹 (AK-203)	15ms	432 KiB		109 Bytes	2022-10-19 21:42:47
AC	曾御城（现用名） (Jason)	15ms	496 KiB		283 Bytes	2022-9-25 12:34:45
AC	1396013295	15ms	424 KiB		118 Bytes	2022-10-23 10:34:47
AC	唐良瑞 (22016-tlr01)	15ms	512 KiB		133 Bytes	2022-11-27 15:48:37
AC	付博plus	15ms	436 KiB		129 Bytes	2022-8-28 17:53:54
AC	李禹衡 (liyuheng22006)	15ms	512 KiB		115 Bytes	2022-11-17 16:27:14
AC	huyinuo	15ms	512 KiB		125 Bytes	2022-8-26 10:27:55
AC	王晨志 (wangchenzhi)	15ms	444 KiB		344 Bytes	2022-9-3 18:08:07
AC	缥 (王硕2012)	15ms	436 KiB		125 Bytes	2023-3-25 11:51:29
AC	曹埊睿 (caodirui)	15ms	6.7 MiB		444 Bytes	2023-9-16 19:28:35
AC	任远宁 (renyuanning)	15ms	432 KiB		152 Bytes	2022-11-5 13:07:46
AC	李树崑 (lishukun)	15ms	436 KiB		181 Bytes	2022-11-14 18:47:03
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		123 Bytes	2023-8-4 12:11:14
AC	陈骏逸 (chenjunyi)	16ms	6.9 MiB		152 Bytes	2023-7-9 9:37:30
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	6.8 MiB		129 Bytes	2023-6-11 10:31:57
AC	11111	16ms	440 KiB		118 Bytes	2022-9-22 16:33:41
AC	刘老师 (图书管理员)	16ms	512 KiB		137 Bytes	2022-8-26 9:46:04
AC	繁星 (05c35-zzm)	16ms	436 KiB		145 Bytes	2022-11-13 9:57:09
AC	何洋名 (heyangming)	16ms	6.9 MiB		147 Bytes	2023-7-3 19:03:09
AC	黄梓桐 (HuangZiTong)	16ms	440 KiB		111 Bytes	2022-10-30 18:58:49
AC	明轩 (吕同学)	16ms	436 KiB		120 Bytes	2022-8-27 14:37:58
AC	colin1112 (墙凌可)	16ms	512 KiB		121 Bytes	2023-3-23 17:33:26
AC	谭红中 (不知道)	17ms	436 KiB		124 Bytes	2023-1-9 16:55:59
AC	chaikexu	17ms	512 KiB		117 Bytes	2022-12-11 20:35:31
AC	时代一校-赵彦博 (zyb)	18ms	6.9 MiB		117 Bytes	2023-8-8 13:53:50
AC	任童(rentong)	19ms	436 KiB		158 Bytes	2022-9-9 17:22:45
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	21ms	512 KiB		153 Bytes	2022-11-25 18:04:44
AC	miku (阳沐珊)	62ms	548 KiB		187 Bytes	2024-4-6 9:07:58
AC	希蒙 (zhengxingya)	65ms	544 KiB		242 Bytes	2024-4-10 16:46:07
AC	Him神	66ms	604 KiB		118 Bytes	2024-3-4 15:29:18
AC	李 (李恺伦)	68ms	548 KiB		156 Bytes	2024-3-10 18:10:41
AC	zyl	70ms	540 KiB		115 Bytes	2024-1-25 14:53:34
AC	zzzrrrxxx	72ms	548 KiB		131 Bytes	2024-4-4 10:40:02
AC	新壹街校区-冉睦阳 (冉睦阳)	73ms	540 KiB	C++98	115 Bytes	2024-9-12 15:52:51
AC	不怎么聪明的家伙 (贺俊楠)	208ms	4 MiB	Python 3	69 Bytes	2023-1-4 11:30:28
AC	majinhui	228ms	3.9 MiB	Python 3	48 Bytes	2022-9-13 20:53:26