求平方

状态	递交者	时间	内存	语言	代码	递交时间
AC	时代一校-赵彦博 (zyb)	41ms	7.2 MiB		222 Bytes	2023-11-30 18:54:42
AC	kapurua	46ms	7.1 MiB		222 Bytes	2024-1-22 17:08:06
AC	陈诺	46ms	7.1 MiB		186 Bytes	2023-12-31 22:48:43
AC	陈诺	46ms	7.3 MiB		190 Bytes	2023-12-31 15:37:43
AC	李安桐23025	47ms	7 MiB		194 Bytes	2024-1-6 22:33:33
AC	盛稚涵 (shengzhihan)	68ms	1 MiB	C++11	178 Bytes	2024-11-21 19:11:27
AC	李浩然	70ms	1.1 MiB		192 Bytes	2024-4-4 15:27:33
AC	金沙-文豪 (wenhao)	75ms	1 MiB		158 Bytes	2024-3-3 16:39:38
AC	＞﹏＜ AAA?白猫YYDS (爱搞笑的张浩宇)	75ms	1.1 MiB		282 Bytes	2024-4-14 10:17:01
AC	赵奕铭	77ms	1.1 MiB		165 Bytes	2024-2-7 17:00:03
AC	章愉霖	77ms	1.1 MiB		161 Bytes	2024-4-10 21:29:09
AC	颜梓宇	77ms	1 MiB		177 Bytes	2024-4-6 15:29:04
AC	wuenzi	77ms	1.1 MiB		427 Bytes	2024-2-22 19:28:44
AC	周浩楠 (开朗的周好难)	80ms	1.5 MiB		294 Bytes	2024-4-10 21:59:58
AC	原著校区巫映秋 (巫映秋1a)	81ms	1 MiB		167 Bytes	2024-4-4 15:48:40
AC	新壹街—熊轩杭 (xiongxuanhang)	81ms	1 MiB		163 Bytes	2024-3-16 16:14:40
AC	源著校区-老师：刘扬-张博涵 (张博涵)	82ms	1 MiB		234 Bytes	2024-4-10 0:02:18
AC	黄立信	82ms	1 MiB		241 Bytes	2024-2-14 8:26:37
AC	杨博文05	82ms	1 MiB	C++98	165 Bytes	2024-9-21 8:34:54
AC	阮 (媚狐不吃道旁李)	83ms	1 MiB		184 Bytes	2024-4-5 21:58:01
AC	0721 (龙浩恩)	83ms	1 MiB		207 Bytes	2024-4-4 19:31:59
AC	邵清泉	83ms	1 MiB		187 Bytes	2024-4-5 16:07:08
AC	曹星羽	83ms	1 MiB		156 Bytes	2024-3-2 15:08:20
AC	陈家熠	83ms	1008 KiB		187 Bytes	2024-4-7 20:12:50
AC	JOKER (hhy)	84ms	1 MiB		297 Bytes	2024-2-19 19:08:09
AC	zzl	85ms	1016 KiB		181 Bytes	2024-4-4 15:24:17
AC	源著校区-老师：刘扬-张博涵 (张博涵)	85ms	968 KiB		234 Bytes	2024-4-10 23:11:25
AC	yyds (杨骐嘉)	85ms	1 MiB		183 Bytes	2024-4-11 19:04:46
AC	李彦臻	85ms	936 KiB	C++98	161 Bytes	2024-8-31 10:55:04
AC	汪之含	86ms	1.1 MiB	C++98	170 Bytes	2024-11-22 16:45:26
AC	郑尧 (zhengyao)	86ms	1.1 MiB		182 Bytes	2024-4-13 9:25:30
AC	曹星羽	86ms	1.1 MiB		146 Bytes	2024-4-14 9:26:55
AC	zzzrrrxxx	87ms	968 KiB		270 Bytes	2024-4-14 15:16:13
AC	张三	87ms	1008 KiB		213 Bytes	2024-3-31 16:33:26
AC	时代二校+王吕棪 (wanglvyan)	90ms	1 MiB		212 Bytes	2024-2-19 17:56:08
AC	周浩楠 (开朗的周好难)	93ms	1.5 MiB		294 Bytes	2024-4-9 21:42:01
AC	wrz	93ms	1 MiB		178 Bytes	2024-3-8 15:37:19
AC	fcxin	179ms	9.4 MiB	Python 3	93 Bytes	2024-8-9 13:11:05
AC	11451254188 (22029-mjh)	184ms	9.4 MiB	Python 3	85 Bytes	2024-4-25 19:31:29
AC	可爱酱 (张可忻)	217ms	16.5 MiB	Python 3	99 Bytes	2023-10-5 17:44:54
AC	shenyushun1	220ms	9.8 MiB	Python 3	92 Bytes	2022-1-20 16:10:18
AC	爱琴海校区-刁钲洋 (刁钲洋)	222ms	14.6 MiB	Python 3	108 Bytes	2023-7-9 8:41:19
AC	Croco (rrh)	226ms	9.7 MiB	Python 3	108 Bytes	2022-3-23 12:57:07
AC	伍行念 (wuxingnian)	227ms	14.4 MiB	Python 3	103 Bytes	2023-8-25 10:21:34
AC	11111	231ms	9.7 MiB	Python 3	93 Bytes	2022-2-14 16:25:45
AC	爱琴海校区-刁钲洋 (刁钲洋)	235ms	9.7 MiB	Python 3	108 Bytes	2022-4-5 21:25:20
AC	啊...这 (炼狱杏寿郎)	246ms	9.7 MiB	Python 3	89 Bytes	2022-8-11 15:41:28
AC	19598	258ms	14.4 MiB	Python 3	95 Bytes	2023-8-13 17:02:04
AC	高俊	259ms	14.4 MiB	Python 3	106 Bytes	2023-10-18 14:53:24
AC	重庆龙湖源著校区+杨聆暄 (杨聆暄)	260ms	1 MiB		657 Bytes	2024-4-5 19:46:48
AC	范老师	263ms	9.7 MiB	Python 3	89 Bytes	2022-12-10 15:05:20
AC	南坪校区-龙浩睿 (longhaorui)	271ms	4.2 MiB	Python 3	76 Bytes	2023-5-10 19:34:03
AC	sb (linjiayu23010)	275ms	4.2 MiB	Python 3	71 Bytes	2023-5-10 19:34:29
AC	安闵煜 (anzai)	276ms	9.2 MiB	Python 3	82 Bytes	2023-11-8 12:06:14
AC	zyp (wangjunling23010)	283ms	4.2 MiB	Python 3	74 Bytes	2023-5-10 19:33:18
AC	龙吉先 (ljx)	284ms	4.2 MiB	Python 3	69 Bytes	2023-5-10 19:36:14
AC	戴玉彤	285ms	4.2 MiB	Python 3	106 Bytes	2022-4-10 15:47:41
AC	朱老师 (zyp)	291ms	4.2 MiB	Python 3	76 Bytes	2023-5-10 19:33:00
AC	猫不理包子	293ms	10.9 MiB	Python 3	96 Bytes	2023-7-14 11:00:29
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)	301ms	4.2 MiB	Python 3	87 Bytes	2023-5-10 19:33:54
AC	谭红中 (不知道)	304ms	4.2 MiB	Python 3	113 Bytes	2022-3-23 17:03:27
AC	11451254188 (22029-mjh)	305ms	4.2 MiB	Python 3	85 Bytes	2023-5-10 19:34:09
AC	Wling	307ms	4.2 MiB	Python 3	92 Bytes	2022-11-1 18:22:31
AC	cola	307ms	4.2 MiB	Python 3	124 Bytes	2022-12-16 18:42:44
AC	李艾芯 (starry sky)	311ms	4.2 MiB	Python 3	74 Bytes	2022-6-25 10:58:34
AC	南坪协信校区-叶钟阳 (yezhongyang23010)	321ms	4.2 MiB	Python 3	127 Bytes	2023-5-10 19:20:39
AC	kongql	326ms	4.2 MiB	Python 3	71 Bytes	2022-7-21 15:58:20
AC	谭红中 (不知道)	327ms	4.3 MiB	Python 3	108 Bytes	2023-1-15 9:25:05
AC	稻妻第一深情 (喝酒の吟游诗人)	334ms	4.2 MiB	Python 3	100 Bytes	2023-1-14 15:14:03
AC	南坪校区-郑力博 (zhenglibo23003)	348ms	4.2 MiB	Python 3	69 Bytes	2023-5-10 19:34:33
AC	kongql	465ms	10 MiB	Python 3	71 Bytes	2023-11-30 19:56:08
AC	Qinxiu	670ms	4.3 MiB	Python 3	91 Bytes	2024-2-1 13:43:27