【蓝桥杯stema测试】拼写单词

状态	递交者	时间	内存	语言	代码	递交时间
AC	SYH.邵允涵 (Zoe邵)	14ms	416 KiB		255 Bytes	2023-3-2 13:08:21
AC	lao_ba	14ms	6.8 MiB		234 Bytes	2023-10-21 8:01:34
AC	李昀铂 (liyunbo)	14ms	6.8 MiB		268 Bytes	2023-10-26 20:08:19
AC	南坪协信校区-叶钟阳 (yezhongyang23010)	14ms	6.8 MiB		213 Bytes	2023-10-26 18:45:57
AC	曹埊睿 (caodirui)	14ms	436 KiB		206 Bytes	2023-5-5 19:40:25
AC	陈风亦 (chenfengyi)	14ms	6.8 MiB		316 Bytes	2023-10-21 21:31:38
AC	吴卓轩	14ms	400 KiB		322 Bytes	2023-3-4 15:23:31
AC	芒苒忧 (廖迦南)	14ms	436 KiB		223 Bytes	2023-3-5 15:46:23
AC	陈玺宇	14ms	6.8 MiB		332 Bytes	2023-10-26 21:37:47
AC	源著校区-惠予宸 (huiyuchen2)	14ms	412 KiB		219 Bytes	2023-3-6 22:04:28
AC	soha (武夷岩)	14ms	6.8 MiB		292 Bytes	2023-10-21 14:49:24
AC	zzl	14ms	6.8 MiB		222 Bytes	2023-10-25 16:56:23
AC	希蒙 (zhengxingya)	14ms	6.8 MiB		393 Bytes	2023-10-21 8:50:28
AC	新壹街校区-冉睦阳 (冉睦阳)	14ms	7 MiB	C++98	215 Bytes	2024-4-26 20:20:35
AC	时代一校-王宥量 (wangyouliang)	15ms	428 KiB		250 Bytes	2023-3-12 11:24:54
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)	15ms	6.7 MiB		233 Bytes	2023-8-24 19:02:15
AC	阚一鸣	15ms	440 KiB		372 Bytes	2023-3-12 9:11:34
AC	阮 (媚狐不吃道旁李)	15ms	7 MiB		247 Bytes	2023-10-21 10:24:04
AC	美术猫映画 (mkh)	15ms	6.8 MiB		279 Bytes	2023-10-22 14:28:19
AC	曾子墨	15ms	6.9 MiB		205 Bytes	2023-10-28 17:25:58
AC	微风将至 (李睿轩)	15ms	444 KiB		226 Bytes	2023-3-10 21:25:49
AC	曹元明	15ms	7 MiB		238 Bytes	2023-10-14 11:06:37
AC	56HXuZiHang	15ms	6.8 MiB		243 Bytes	2023-10-26 18:29:18
AC	05c05-zzx	15ms	420 KiB		233 Bytes	2023-3-31 17:51:06
AC	xuniaoyin (徐袅音)	15ms	6.9 MiB		241 Bytes	2023-8-11 15:27:16
AC	贾博涵	15ms	6.9 MiB		292 Bytes	2023-8-10 13:49:52
AC	叶哲宇 (yzy)	15ms	7.1 MiB		248 Bytes	2024-1-22 10:15:01
AC	秦子越 (13883322087)	15ms	6.8 MiB		232 Bytes	2023-11-6 11:39:32
AC	AC[谭赫奕] (tanheyi)	15ms	432 KiB		277 Bytes	2023-4-15 20:13:04
AC	15823239925	16ms	7.1 MiB		255 Bytes	2024-1-21 14:55:41
AC	86想要钱 (twt)	16ms	436 KiB		284 Bytes	2023-4-18 12:53:21
AC	tyx_9192596	16ms	416 KiB		195 Bytes	2023-3-15 17:57:08
AC	林子沫awa (linziyue)	16ms	392 KiB		322 Bytes	2023-3-12 9:12:18
AC	爱琴海校区-刁钲洋 (刁钲洋)	17ms	6.7 MiB		421 Bytes	2023-8-22 16:16:19
AC	不怎么聪明的家伙 (贺俊楠)	17ms	512 KiB		288 Bytes	2023-4-16 9:13:32
AC	陈雨泽1	18ms	7.3 MiB		399 Bytes	2024-1-16 17:47:23
AC	wanghuaiying	18ms	7.1 MiB		248 Bytes	2024-1-18 13:12:59
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	19ms	7.1 MiB		247 Bytes	2024-1-22 9:10:08
AC	张雯皓 (zhangwenhao)	20ms	7.1 MiB		267 Bytes	2024-1-22 10:35:24
AC	dyp (hhy)	23ms	7.1 MiB		239 Bytes	2024-1-22 10:14:11
AC	张瑞博	29ms	544 KiB	C++11	221 Bytes	2024-9-15 17:21:15
AC	y s e	30ms	540 KiB	C++14(O2)	312 Bytes	2024-9-8 10:07:42
AC	史继来	31ms	764 KiB	C++98	234 Bytes	2024-9-3 17:02:09
AC	K517	46ms	9.4 MiB	Python 3	130 Bytes	2024-8-21 19:49:15
AC	K517	50ms	9.4 MiB	Python 3	130 Bytes	2024-5-9 19:00:55
AC	谭杨睿	54ms	532 KiB		297 Bytes	2024-3-7 19:22:11
AC	zhangyouze (张佑泽)	57ms	764 KiB		253 Bytes	2024-1-27 19:26:27
AC	新壹街-李昕宇 (李昕宇)	58ms	532 KiB		253 Bytes	2024-3-8 19:08:13
AC	黄立信	59ms	532 KiB		244 Bytes	2024-2-6 13:48:09
AC	南坪-叶梓曦 (yezixi)	60ms	532 KiB		242 Bytes	2024-3-6 19:18:45
AC	黄立信	61ms	532 KiB		229 Bytes	2024-2-6 13:17:04
AC	胡澜之 (666hlz666)	61ms	532 KiB		295 Bytes	2024-2-27 20:11:59
AC	时代二校-王盼兮 (wangpanxi)	61ms	532 KiB		242 Bytes	2024-4-6 17:46:56
AC	高敏睿	62ms	544 KiB		275 Bytes	2024-3-3 19:31:35
AC	明轩 (吕同学)	62ms	768 KiB		523 Bytes	2024-3-2 12:06:42
AC	经常消失 (小萝卜)	62ms	656 KiB		212 Bytes	2024-1-27 19:36:27
AC	曹雅萱	63ms	764 KiB		306 Bytes	2024-3-7 18:51:24
AC	黄立信	63ms	764 KiB		244 Bytes	2024-2-6 13:48:18
AC	marz	63ms	764 KiB		295 Bytes	2024-3-8 19:04:59
AC	zhangyouze (张佑泽)	63ms	532 KiB		253 Bytes	2024-3-3 19:25:19
AC	lvyanshan	63ms	532 KiB		298 Bytes	2024-3-2 13:40:16
AC	李浩然	64ms	532 KiB		217 Bytes	2024-3-7 18:41:39
AC	源著+王新睿 (王新睿)	64ms	532 KiB		272 Bytes	2024-4-3 21:33:11
AC	Viserion	64ms	532 KiB		233 Bytes	2024-1-26 18:42:36
AC	杨淇瑞 (杨淇瑞29)	64ms	532 KiB		337 Bytes	2024-4-6 19:32:25
AC	新壹街-曾浩坤 (曾浩坤)	64ms	764 KiB		222 Bytes	2024-4-3 21:56:31
AC	CK (李弘毅)	65ms	532 KiB		307 Bytes	2024-4-6 20:18:06
AC	王彬羽 (wby)	65ms	532 KiB		294 Bytes	2024-4-4 12:26:16
AC	徐瑀阳	65ms	532 KiB		277 Bytes	2024-4-6 20:34:37
AC	褚博艺	65ms	532 KiB		259 Bytes	2024-4-9 20:35:52
AC	嘉宝 (王淳恺)	65ms	764 KiB		271 Bytes	2024-4-13 13:16:20
AC	Billy52013 (李子轩)	65ms	532 KiB		237 Bytes	2024-4-5 17:17:45
AC	时代一校-赵彦博 (zyb)	65ms	764 KiB		255 Bytes	2024-1-30 21:09:05
AC	明轩 (吕同学)	66ms	536 KiB		295 Bytes	2024-3-2 12:01:30
AC	经常消失 (小萝卜)	66ms	536 KiB		222 Bytes	2024-3-1 19:51:36
AC	时代校区-孔令皓 (konglinghao)	66ms	536 KiB		257 Bytes	2024-2-12 9:54:00
AC	max	66ms	532 KiB		220 Bytes	2024-3-7 19:21:28
AC	爱琴海校区-刁钲洋 (刁钲洋)	67ms	536 KiB		224 Bytes	2024-3-10 11:31:47
AC	zyl	67ms	764 KiB		211 Bytes	2024-2-28 18:51:03
AC	爱情海校区—沙天一 (沙天一)	67ms	536 KiB		273 Bytes	2024-2-6 18:02:50
AC	123 (刘侑昊)	67ms	532 KiB		252 Bytes	2024-2-29 21:55:10
AC	zvt_132 (任子轩)	67ms	532 KiB		274 Bytes	2024-2-27 21:12:28
AC	殷梓琦	67ms	532 KiB		240 Bytes	2024-3-8 19:08:04
AC	徐绅博	68ms	544 KiB		247 Bytes	2024-3-7 19:06:13
AC	不怎么聪明的家伙 (贺俊楠)	68ms	532 KiB		235 Bytes	2024-1-27 19:34:52
AC	黄立信	68ms	764 KiB		244 Bytes	2024-2-6 14:13:18
AC	Viserion	68ms	532 KiB		230 Bytes	2024-4-8 18:18:40
AC	新一街校区Jason_LuoYouZheng (罗友峥)	68ms	764 KiB		353 Bytes	2024-4-4 11:21:52
AC	ReFly (NKZKY)	68ms	532 KiB		292 Bytes	2024-3-7 21:57:11
AC	陈家熠	68ms	548 KiB		298 Bytes	2024-3-7 19:23:01
AC	时代二校+马嘉宸 (majiachen)	68ms	764 KiB		244 Bytes	2024-4-11 20:22:44
AC	新壹街-曾浩坤 (曾浩坤)	68ms	544 KiB		222 Bytes	2024-4-3 21:21:33
AC	新壹街-康哲朗 (康哲朗)	69ms	532 KiB		249 Bytes	2024-3-8 19:07:08
AC	除了我全部人都是SB (车涌樯)	69ms	532 KiB		239 Bytes	2024-4-13 12:26:42
AC	zhongjunxuan	69ms	764 KiB		291 Bytes	2024-3-1 17:23:29
AC	黄立信	69ms	532 KiB		229 Bytes	2024-3-2 18:04:13
AC	wanghaixi xxx	70ms	764 KiB		257 Bytes	2024-1-25 17:16:57
AC	付柏乐	70ms	764 KiB		317 Bytes	2024-3-5 18:16:39
AC	Guest	71ms	532 KiB		269 Bytes	2024-4-4 12:01:44
AC	罗元邑2	71ms	548 KiB		396 Bytes	2024-3-1 20:15:36