「NOIP 2017普及组」成绩

状态	递交者	时间	内存	语言	代码	递交时间
AC	赵沛喆	7ms	384 KiB		116 Bytes	2022-8-3 15:54:41
AC	李昱菡	8ms	384 KiB		162 Bytes	2022-8-20 12:59:53
AC	姚宏逸	12ms	416 KiB		191 Bytes	2022-7-9 10:52:03
AC	我推的乱破 (贺俊楠)	13ms	7.3 MiB		133 Bytes	2024-1-7 11:27:10
AC	朱泽晟	13ms	384 KiB		206 Bytes	2022-7-13 22:16:35
AC	ywh	13ms	384 KiB		131 Bytes	2022-7-11 18:45:34
AC	赵奕铭	13ms	7 MiB	C++98	132 Bytes	2024-6-26 16:55:17
AC	金沙校区-先珂熠 (九转大肠)	13ms	6.5 MiB	C++20(O2)	144 Bytes	2024-8-1 14:21:06
AC	朱老师 (zyp)	13ms	432 KiB		171 Bytes	2022-7-26 9:02:46
AC	胡瀚文	14ms	440 KiB		117 Bytes	2022-7-15 10:28:53
AC	李树崑 (lishukun)	14ms	444 KiB		157 Bytes	2022-8-4 13:28:50
AC	杜俊宏	14ms	432 KiB		142 Bytes	2022-7-10 9:16:36
AC	坤坤荔枝小黑子 (zhonghaotian22006)	14ms	512 KiB		139 Bytes	2022-8-14 12:32:12
AC	huyinuo	14ms	512 KiB		138 Bytes	2022-7-17 18:51:54
AC	LukeDid	14ms	512 KiB		173 Bytes	2023-4-21 22:26:14
AC	阮 (媚狐不吃道旁李)	14ms	7.1 MiB	C++98	150 Bytes	2024-5-18 11:19:00
AC	MacrozClick_ (蒋淞霖)	14ms	444 KiB		170 Bytes	2023-5-1 11:39:13
AC	蒲梓勋 (puzixun)	14ms	512 KiB		157 Bytes	2022-8-12 17:45:04
AC	12345	14ms	436 KiB		138 Bytes	2022-7-10 11:59:54
AC	孙天豪 (AliceSteven)	14ms	432 KiB		147 Bytes	2022-7-25 19:55:42
AC	疯神芭芭脱丝 (李卓修)	14ms	424 KiB		129 Bytes	2022-7-12 19:28:16
AC	ywh	14ms	440 KiB		131 Bytes	2022-7-11 18:45:33
AC	樊竣熠 (lft1114)	14ms	436 KiB		129 Bytes	2022-8-10 17:46:10
AC	张瑞博	14ms	7 MiB	C++11	128 Bytes	2024-8-24 17:37:52
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)	14ms	6.7 MiB		186 Bytes	2023-8-24 19:24:02
AC	庹仕杰	15ms	6.7 MiB		145 Bytes	2023-10-1 10:33:24
AC	时代一校蒋帛希 (13983392730)	15ms	6.8 MiB		132 Bytes	2023-10-16 21:25:47
AC	爱琴海校区-刁钲洋 (刁钲洋)	15ms	6.9 MiB		231 Bytes	2023-7-29 11:13:58
AC	孙烽轶 (sfy)	15ms	7.2 MiB		121 Bytes	2023-7-3 16:44:50
AC	新壹街校区-杨轩懿 (杨轩懿1)	15ms	6.9 MiB		125 Bytes	2023-7-24 14:24:52
AC	时代一校-赵彦博 (zyb)	15ms	6.8 MiB		126 Bytes	2023-11-5 22:03:59
AC	经常消失 (小萝卜)	15ms	440 KiB		173 Bytes	2022-9-15 19:15:01
AC	蓝色妖姬 (jiangpeiyu)	15ms	424 KiB		148 Bytes	2022-11-5 11:31:43
AC	11451254188 (22029-mjh)	15ms	6.9 MiB		162 Bytes	2023-7-27 11:25:44
AC	赵泳鑫 (zhaoyongxin)	16ms	512 KiB		122 Bytes	2022-7-15 14:32:07
AC	龙湖时代C馆-邹镇宇 (邹镇宇)	16ms	440 KiB		140 Bytes	2022-9-30 20:41:32
AC	钟元朗	16ms	420 KiB		131 Bytes	2023-1-14 21:00:22
AC	刘鹤枫 (liuhefeng)	16ms	432 KiB		135 Bytes	2022-8-7 14:14:25
AC	lihaotian	16ms	440 KiB		125 Bytes	2022-12-1 13:10:43
AC	colin1112 (墙凌可)	16ms	7.2 MiB		144 Bytes	2023-11-30 21:50:14
AC	易锦程 (sky)	16ms	6.9 MiB		135 Bytes	2023-8-11 12:51:30
AC	贾鑫豪 (Mr Sam)	17ms	416 KiB		161 Bytes	2022-8-24 13:20:24
AC	xuniaoyin (徐袅音)	18ms	6.9 MiB		120 Bytes	2023-8-3 12:15:22
AC	明轩 (吕同学)	65ms	548 KiB		119 Bytes	2024-4-12 19:55:47
AC	张祖名	68ms	536 KiB		145 Bytes	2024-3-11 21:40:19
AC	新壹街校区-冉睦阳 (冉睦阳)	74ms	536 KiB	C++98	129 Bytes	2024-11-15 20:30:45