「NOIP 2018普及组」标题统计

状态	递交者	时间	内存	语言	代码	递交时间
AC	姚宏逸	13ms	308 KiB		312 Bytes	2022-1-22 22:33:07
AC	MoonLight ( aaa)	13ms	264 KiB		205 Bytes	2022-1-25 12:39:45
AC	朱泽晟	15ms	312 KiB		309 Bytes	2022-3-11 21:30:21
AC	曹埊睿 (caodirui)	15ms	384 KiB		309 Bytes	2023-5-5 20:06:59
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)	24ms	7.1 MiB		235 Bytes	2023-12-3 9:56:37
AC	12345	24ms	384 KiB		289 Bytes	2022-8-8 9:23:44
AC	张瑞博	25ms	6.8 MiB	C++11	196 Bytes	2024-8-6 12:05:02
AC	ywh	25ms	384 KiB		229 Bytes	2022-6-18 11:45:55
AC	阮 (媚狐不吃道旁李)	26ms	7.2 MiB	C++98	356 Bytes	2024-5-2 16:31:16
AC	11451254188 (22029-mjh)	26ms	6.7 MiB		309 Bytes	2023-9-15 19:17:34
AC	kapurua	26ms	384 KiB		202 Bytes	2023-4-3 20:31:40
AC	杜俊宏	26ms	512 KiB		215 Bytes	2022-6-17 19:24:50
AC	汪致卉 (wangzh)	26ms	384 KiB		291 Bytes	2022-1-29 0:11:50
AC	赵沛喆	26ms	384 KiB		372 Bytes	2022-6-20 22:05:16
AC	zyq1	27ms	384 KiB		210 Bytes	2023-4-3 20:44:35
AC	时代校区-孔令皓 (konglinghao)	27ms	7 MiB	C++98	217 Bytes	2024-5-28 21:09:24
AC	王晨志 (wangchenzhi)	27ms	436 KiB		237 Bytes	2022-7-1 14:41:57
AC	黄相茗	27ms	408 KiB		211 Bytes	2022-4-7 19:50:40
AC	李山水	27ms	384 KiB		256 Bytes	2022-3-12 18:29:22
AC	1396013295	27ms	384 KiB		319 Bytes	2022-1-23 20:01:12
AC	樊竣熠 (lft1114)	27ms	512 KiB		222 Bytes	2022-8-5 16:12:42
AC	李哲 (lizhe)	27ms	512 KiB		229 Bytes	2022-8-15 19:45:31
AC	疯神芭芭脱丝 (李卓修)	27ms	436 KiB		281 Bytes	2022-6-9 19:45:08
AC	曾御城（现用名） (Jason)	28ms	512 KiB		372 Bytes	2022-7-23 19:55:55
AC	赵泳鑫 (zhaoyongxin)	28ms	384 KiB		211 Bytes	2022-3-12 18:30:46
AC	李树崑 (lishukun)	28ms	512 KiB		196 Bytes	2022-6-25 14:48:21
AC	黄俊皓	28ms	384 KiB		308 Bytes	2022-3-12 18:31:53
AC	贾鑫豪 (Mr Sam)	28ms	512 KiB		433 Bytes	2022-3-3 21:59:05
AC	冒牌陈杰晟【MOD】 (wed)	28ms	512 KiB		291 Bytes	2022-4-10 16:35:40
AC	蒋青峰	28ms	428 KiB		195 Bytes	2023-3-4 21:06:33
AC	蒲梓勋 (puzixun)	28ms	512 KiB		156 Bytes	2022-8-12 17:46:03
AC	wangruibo20xh	28ms	444 KiB		159 Bytes	2022-2-11 19:28:12
AC	谢延灏 (xeiyanhao---a handsome boy)	28ms	440 KiB		208 Bytes	2022-7-9 18:56:58
AC	MacrozClick_ (蒋淞霖)	28ms	440 KiB		227 Bytes	2022-3-23 20:00:13
AC	Tang	28ms	512 KiB		209 Bytes	2022-6-2 20:01:53
AC	经常消失 (小萝卜)	29ms	436 KiB		377 Bytes	2022-3-13 18:19:52
AC	LukeDid	29ms	428 KiB		377 Bytes	2023-4-22 13:36:30
AC	朱老师 (zyp)	29ms	428 KiB		194 Bytes	2022-7-26 9:09:37
AC	坤坤荔枝小黑子 (zhonghaotian22006)	29ms	512 KiB		296 Bytes	2022-11-15 9:40:19
AC	李山水	30ms	512 KiB		256 Bytes	2022-3-12 18:29:22
AC	王晴萱	30ms	6.9 MiB		262 Bytes	2023-7-16 15:48:55
AC	马渝杭 (mayuhang)	30ms	512 KiB		224 Bytes	2023-3-6 19:06:07
AC	11111	30ms	512 KiB		210 Bytes	2022-10-29 20:38:22
AC	李彭宋代诗人 (ljy123456)	30ms	436 KiB		222 Bytes	2023-3-24 7:13:55
AC	RanHao	31ms	6.7 MiB		208 Bytes	2023-9-8 17:00:22
AC	新壹街——陈学彬 (BUG)	31ms	7.1 MiB		198 Bytes	2023-7-6 10:49:04
AC	colin1112 (墙凌可)	31ms	6.7 MiB		319 Bytes	2023-7-21 13:49:36
AC	周琪渃	32ms	512 KiB		280 Bytes	2022-12-9 21:48:09
AC	时代一校 - 冯隆浩 (冯隆浩)	32ms	6.9 MiB		210 Bytes	2023-7-18 10:47:54
AC	孙烽轶 (sfy)	32ms	7.1 MiB		188 Bytes	2023-7-9 9:51:00
AC	zlx (xiao)	32ms	436 KiB		259 Bytes	2022-11-27 12:24:21
AC	Randy Marsh (杨子腾)	33ms	440 KiB		239 Bytes	2023-1-12 13:29:47
AC	我推的乱破 (贺俊楠)	33ms	7 MiB		311 Bytes	2023-7-10 14:42:26
AC	黄梓轩 (huangzixuan)	34ms	6.9 MiB		209 Bytes	2023-7-24 10:38:15
AC	爱情海校区—沙天一 (沙天一)	35ms	6.9 MiB		173 Bytes	2023-7-9 8:44:20
AC	黄誉翔 (黄誉翔)	35ms	512 KiB		272 Bytes	2023-1-11 15:13:16
AC	陈风亦 (chenfengyi)	36ms	440 KiB		207 Bytes	2023-1-18 16:52:53
AC	明轩 (吕同学)	133ms	540 KiB		373 Bytes	2024-4-12 19:52:44
AC	Him神	135ms	764 KiB		183 Bytes	2024-2-23 16:16:47
AC	zyl	136ms	764 KiB		240 Bytes	2024-1-31 15:29:41
AC	安闵煜 (anzai)	136ms	552 KiB	C++11	255 Bytes	2024-8-31 14:26:59
AC	Accepted (周芷乐)	137ms	544 KiB	C++14	358 Bytes	2024-10-11 18:15:35
AC	爱琴海校区-刁钲洋 (刁钲洋)	420ms	4 MiB	Python 3	67 Bytes	2022-5-6 21:38:43
AC	梨冻亿 (wiueh)	422ms	3.9 MiB	Python 3	91 Bytes	2022-1-25 13:43:56