奇数求和

状态	递交者	时间	内存	语言	代码	递交时间
AC	李 (李恺伦)	216ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:44
AC	李 (李恺伦)	216ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:43
AC	李 (李恺伦)	216ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:44
AC	李 (李恺伦)	217ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:45
AC	李 (李恺伦)	217ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:43
AC	不怎么聪明的家伙 (贺俊楠)	217ms	3.9 MiB	Python 3	108 Bytes	2023-1-1 11:47:10
AC	李 (李恺伦)	217ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:39
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)	217ms	3.9 MiB	Python 3	118 Bytes	2023-5-10 19:21:20
AC	李 (李恺伦)	217ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:42
AC	李 (李恺伦)	218ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:41
AC	龙吉先 (ljx)	218ms	4 MiB	Python 3	105 Bytes	2023-5-10 19:27:00
AC	yangyutong22003	218ms	3.9 MiB	Python 3	114 Bytes	2022-8-6 15:38:09
AC	稻妻第一深情 (喝酒の吟游诗人)	218ms	4 MiB	Python 3	116 Bytes	2023-1-14 15:01:14
AC	李 (李恺伦)	219ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:41
AC	时代二校-焦雨齐 (Angel)	219ms	4.1 MiB	Python 3	123 Bytes	2023-1-11 21:57:59
AC	李 (李恺伦)	220ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:42
AC	李 (李恺伦)	220ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:40
AC	李 (李恺伦)	220ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:41
AC	易锦程 (sky)	220ms	3.9 MiB	Python 3	108 Bytes	2022-9-7 21:31:53
AC	李 (李恺伦)	220ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:43
AC	李 (李恺伦)	221ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:40
AC	Wling	222ms	4 MiB	Python 3	95 Bytes	2022-11-1 15:23:01
AC	李祥睿	224ms	3.9 MiB	Python 3	111 Bytes	2023-5-28 18:42:06
AC	李 (李恺伦)	226ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:44
AC	陈荣添	229ms	4.1 MiB	Python 3	101 Bytes	2023-5-28 18:40:43
AC	范老师	229ms	3.9 MiB	Python 3	97 Bytes	2022-12-13 17:22:16
AC	11451254188 (22029-mjh)	230ms	4.1 MiB	Python 3	104 Bytes	2022-11-25 18:57:55
AC	陈荣添	231ms	3.9 MiB	Python 3	101 Bytes	2023-5-28 18:40:48
AC	李 (李恺伦)	236ms	3.9 MiB	Python 3	104 Bytes	2023-5-28 18:43:42
AC	11451254188 (22029-mjh)	319ms	9.8 MiB	Python 3	104 Bytes	2023-12-13 19:24:43
AC	许炜铭 (xuweiming)	347ms	9.8 MiB	Python 2	100 Bytes	2023-11-26 13:11:34
AC	Qinxiu	534ms	3.8 MiB	Python 3	137 Bytes	2024-2-1 11:23:54
AC	Qinxiu	538ms	4 MiB	Python 3	191 Bytes	2024-2-1 11:23:43