「例题1-3」变量交换

状态	递交者	时间	内存	语言	代码	递交时间
AC	林子沫awa (linziyue)	13ms	384 KiB		126 Bytes	2022-7-11 19:53:45
AC	李雨宸 (lyc)	13ms	512 KiB		119 Bytes	2022-7-27 8:45:00
AC	旷山 (15213268688)	13ms	384 KiB		224 Bytes	2022-1-22 20:37:00
AC	向南地	13ms	436 KiB		170 Bytes	2022-2-19 9:34:26
AC	renqiumo	13ms	424 KiB		136 Bytes	2022-3-11 17:55:14
AC	huangxinyun	13ms	384 KiB		121 Bytes	2022-3-12 21:37:11
AC	杜俊宏	13ms	384 KiB		128 Bytes	2022-3-12 16:03:00
AC	Mr.zou(邹镇宇小号)	13ms	420 KiB		121 Bytes	2023-2-17 22:30:10
AC	崔欧辰	13ms	6.7 MiB	C++11	113 Bytes	2024-7-15 15:09:52
AC	cxk123 (tanzixuan)	13ms	384 KiB		151 Bytes	2023-4-8 19:06:57
AC	zzzrrrxxx	13ms	392 KiB		111 Bytes	2023-4-9 20:42:17
AC	LUKHE (LukeHu)	13ms	384 KiB		187 Bytes	2022-1-21 20:31:33
AC	我很6 (zjj22031)	13ms	384 KiB		121 Bytes	2023-4-5 13:44:05
AC	黄相茗	13ms	384 KiB		126 Bytes	2022-5-6 21:56:31
AC	樊竣熠 (lft1114)	13ms	384 KiB		116 Bytes	2022-1-23 18:05:31
AC	刘煜轩	13ms	384 KiB		122 Bytes	2023-4-9 14:55:13
AC	CPL	13ms	384 KiB		152 Bytes	2023-2-16 20:11:51
AC	hnd (陈皓洋)	13ms	392 KiB		197 Bytes	2022-6-19 15:56:30
AC	黄盛凯	13ms	6.7 MiB		117 Bytes	2023-9-30 12:57:44
AC	印昭旭（412） (印昭旭)	13ms	6.8 MiB		114 Bytes	2023-9-30 17:31:10
AC	ZERO_VOID	13ms	384 KiB		169 Bytes	2022-4-9 9:38:08
AC	56 (13883454928)	13ms	440 KiB		116 Bytes	2023-2-12 13:15:40
AC	Guest	13ms	6.7 MiB	C++98(O2)	111 Bytes	2024-7-14 21:58:10
AC	田信 (tianxincn1)	13ms	444 KiB		156 Bytes	2022-2-19 10:06:14
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	13ms	384 KiB		173 Bytes	2022-2-5 18:54:39
AC	yuzk	13ms	6.6 MiB	C++11	118 Bytes	2024-7-10 20:38:18
AC	张景豪	13ms	392 KiB		168 Bytes	2023-4-8 19:04:12
AC	廖海宇在追杀马牌痞 (liaohaiyu22031)	13ms	384 KiB		175 Bytes	2022-11-26 9:16:18
AC	yu (赵子瑜)	13ms	512 KiB		120 Bytes	2022-2-24 20:53:01
AC	钟京润	13ms	440 KiB		127 Bytes	2022-6-28 18:59:17
AC	Randy Marsh (杨子腾)	13ms	384 KiB		149 Bytes	2022-3-27 10:46:45
AC	张子扬	13ms	400 KiB		213 Bytes	2022-1-20 20:07:36
AC	谢博文	13ms	384 KiB		131 Bytes	2022-2-11 9:09:42
AC	新壹街校区-周士杰 (zsj)	13ms	384 KiB		110 Bytes	2022-4-10 9:15:50
AC	马渝杭 (mayuhang)	13ms	436 KiB		111 Bytes	2022-5-5 19:36:53
AC	🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕🖕 (bro)	13ms	404 KiB		142 Bytes	2022-1-23 16:17:00
AC	zjz	13ms	384 KiB		116 Bytes	2022-3-13 17:22:47
AC	黄梓轩 (huangzixuan)	13ms	512 KiB		116 Bytes	2022-9-17 8:10:02
AC	王泓涵 (whh)	13ms	492 KiB		110 Bytes	2022-7-3 19:10:01
AC	什蒂尔布 (吴东航)	13ms	6.9 MiB	C++98	173 Bytes	2024-5-20 16:55:43
AC	李某人	13ms	384 KiB		123 Bytes	2022-1-25 16:16:03
AC	我是个s* (lijinze)	13ms	384 KiB		105 Bytes	2023-4-11 21:46:19
AC	偽艺術家 (chenyanchi22006)	14ms	416 KiB		128 Bytes	2022-5-2 10:17:19
AC	章愉霖	14ms	512 KiB		125 Bytes	2023-4-29 14:26:42
AC	中岛敦 (黄麒瑞)	14ms	6.8 MiB		113 Bytes	2023-9-29 10:34:22
AC	TBB (杜昊燃)	14ms	384 KiB		152 Bytes	2022-2-25 17:05:08
AC	ywh	14ms	440 KiB		121 Bytes	2022-4-28 18:55:50
AC	徐正旺 (xzw)	14ms	384 KiB		110 Bytes	2023-3-3 21:57:04
AC	黄歆恬 (teresac)	14ms	520 KiB		123 Bytes	2022-7-29 10:35:34
AC	cxk123 (tanzixuan)	14ms	412 KiB		151 Bytes	2023-4-8 19:06:48
AC	李彦臻	14ms	420 KiB		118 Bytes	2023-5-24 18:23:50
AC	余晨浩 (yuchenhao)	14ms	388 KiB		115 Bytes	2022-8-24 15:27:45
AC	林小博	14ms	392 KiB		121 Bytes	2022-5-12 22:03:50
AC	任舒尧	14ms	512 KiB		129 Bytes	2023-2-1 9:11:43
AC	雷诺伊尔 (崔金鹏)	14ms	7.3 MiB		121 Bytes	2024-1-2 21:17:29
AC	金沙校区-王俊元 (王俊元)	14ms	7 MiB	C++98	139 Bytes	2024-6-22 9:00:20
AC	谢欣霖 (xiexinlin)	14ms	512 KiB		171 Bytes	2022-3-5 14:34:22
AC	代尚函笛卡尔 (daishanghan)	14ms	440 KiB		113 Bytes	2023-5-11 13:21:02
AC	kin of kin (jojo)	14ms	384 KiB		117 Bytes	2022-8-22 9:02:05
AC	源著校区陈锐霖 (13983855850)	14ms	6.8 MiB	C++11	126 Bytes	2024-8-12 15:31:20
AC	杨淇瑞 (杨淇瑞29)	14ms	6.8 MiB		159 Bytes	2023-10-17 19:49:50
AC	褚博艺	14ms	6.8 MiB		141 Bytes	2023-10-4 15:25:59
AC	程子杰 (05c41-czj)	14ms	512 KiB		120 Bytes	2022-7-27 11:29:44
AC	lvlu	14ms	436 KiB		128 Bytes	2022-7-23 15:56:54
AC	某某 (xuhaotian)	14ms	436 KiB		171 Bytes	2022-2-28 21:27:11
AC	洛谷：AIDczy（uid:656765） (chenzeyu)	14ms	384 KiB		133 Bytes	2022-2-5 18:57:26
AC	陈杰晟	14ms	384 KiB		120 Bytes	2022-2-12 15:47:12
AC	星野光 (Hoshino Hikari)	14ms	6.8 MiB		154 Bytes	2023-10-20 15:30:34
AC	Z.饮月君 (张皓南)	14ms	384 KiB		114 Bytes	2022-4-8 17:15:36
AC	啊...这 (炼狱杏寿郎)	14ms	392 KiB		166 Bytes	2022-8-12 16:23:16
AC	zcx	14ms	7 MiB		146 Bytes	2023-6-10 11:28:47
AC	时代一校-王宥量 (wangyouliang)	14ms	384 KiB		111 Bytes	2022-9-11 13:02:50
AC	芒苒忧 (廖迦南)	14ms	384 KiB		149 Bytes	2022-1-25 14:27:12
AC	余晨浩 (yuchenhao)	14ms	384 KiB		115 Bytes	2022-8-24 15:28:23
AC	xxteacher	14ms	384 KiB		191 Bytes	2022-1-25 13:39:55
AC	SYC0226	14ms	384 KiB		140 Bytes	2022-1-2 12:32:50
AC	郭睿	14ms	6.9 MiB	C++98	120 Bytes	2024-5-25 13:13:00
AC	wky	14ms	400 KiB		123 Bytes	2022-4-10 18:05:36
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	512 KiB		142 Bytes	2023-4-23 19:27:47
AC	罗伟杰 (13308275065)	14ms	384 KiB		153 Bytes	2022-7-14 11:13:46
AC	赵泳鑫 (zhaoyongxin)	14ms	440 KiB		135 Bytes	2022-4-13 20:07:12
AC	﹢•﹡🕉☽✝⚜Halanfus⚜✝☾⚔⚝﹡﹢• (黄子瑞)	14ms	6.9 MiB	C++98	108 Bytes	2024-8-21 9:22:12
AC	zhangheyi22006	14ms	6.8 MiB		120 Bytes	2023-9-28 21:25:44
AC	Guest	14ms	7 MiB		156 Bytes	2023-12-3 12:30:27
AC	姚宏逸	14ms	392 KiB		108 Bytes	2022-5-1 20:03:28
AC	时代二校-陈天成 (鸭缩毛巾)	14ms	384 KiB		124 Bytes	2023-4-1 16:23:41
AC	啊...这 (炼狱杏寿郎)	14ms	392 KiB		126 Bytes	2022-8-12 16:23:38
AC	本人天生贪生pass (05c41-cqs)	14ms	6.9 MiB		116 Bytes	2023-7-26 15:36:34
AC	陈年保宁醋 (dengboren)	14ms	384 KiB		142 Bytes	2022-1-22 19:38:02
AC	heyuzhe	14ms	7 MiB	C++98	141 Bytes	2024-6-19 18:57:35
AC	hzm	14ms	384 KiB		113 Bytes	2022-9-23 20:28:04
AC	Eastwa	14ms	6.8 MiB	C++98(O2)	183 Bytes	2024-8-11 17:32:44
AC	龚信丞	14ms	384 KiB		132 Bytes	2023-4-8 19:06:13
AC	wangjun	14ms	6.8 MiB		173 Bytes	2023-11-7 17:45:49
AC	tsc_ (杨悦堃)	14ms	512 KiB		166 Bytes	2023-2-26 21:49:50
AC	徐梓尧 (xuziyao001)	14ms	384 KiB		130 Bytes	2022-8-25 17:42:00
AC	梦之泪伤	14ms	432 KiB		123 Bytes	2022-2-11 19:13:35
AC	李禹衡 (liyuheng22006)	14ms	436 KiB		119 Bytes	2022-8-3 10:36:45
AC	kkksc03 (彭士锋)	14ms	436 KiB		111 Bytes	2022-3-5 13:35:51
AC	. (Pig)	14ms	512 KiB		139 Bytes	2022-1-20 9:28:32