作业成绩表 - XSM

排名	用户	分数	总耗时	A 10/28	B 6/17	C 4/11	D 2/6	E 2/2	F 2/6	G 1/1	H 1/1	I 3/4	J 3/10	K 1/1	L 2/2	M 3/3	N 1/12
1	黄立信是XXS (吕同学)	1300	31373:54	100 2240:39	100 2240:49	100 2240:50	100 2240:51	100 2240:52	100 2240:54	100 2240:55	100 2240:55	100 2240:52	100 2240:56	100 2240:57	100 2240:53	100 2240:53	0 2242:31
2	王彬羽 (wby)	1100	15129:53	100 688:30	100 688:41	100 1194:32	100 760:34	100 1195:04	100 1194:48			100 928:20	100 4891:34		100 1195:34	100 1196:00	100 1196:11
3	新壹街校区--税崇峻 (税崇峻)	400	18779:26	100 4694:49	100 4694:50	100 4694:51										100 4694:54
4	刘老师 (图书管理员)	200	1856:51									100 928:11	100 928:40
4	希蒙 (zhengxingya)	200	2003:40	100 1001:50	100 1001:50
4	zvt_132 (任子轩)	200	2679:10	100 1339:22	100 1339:48
4	你个你怎么跟个一样 (钟卓劭)	200	6941:41	100 3470:44	100 3470:57
8	三差学生(尘埃蓝莓) (白佳睿)	100	897:28	100 897:28
8	ReFly (NKZKY)	100	1170:52			100 1170:52
8	颜梓宇	100	1804:49	100 902:24	0 902:25
8	季禹廷 (kali user)	100	9108:59	100 9108:59
8	段淏泷	100	9429:34	100 4714:47	0 4714:47
13	jiangzhenghan	0	3378:51	0 3378:51
14	yao yanzhan	0	0:00
14	wangmulai	0	0:00
14	lao_ba	0	0:00
14	zhongjunxuan	0	0:00
14	代梓航 (dzh)	0	0:00
14	YDX	0	0:00
14	王冉燚默(重庆龙湖U城天街A馆) (wangranyimo)	0	0:00
14	罗浩瑀	0	0:00
14	徐伟宸 (徐伟宸1)	0	0:00
14	李安桐23025	0	0:00
14	游智棋	0	0:00
14	王浩沣	0	0:00
14	杜雨帆	0	0:00
14	美术猫映画 (mkh)	0	0:00
14	林正张______________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________________ (姚博文)	0	0:00
14	爱琴海校区-刁钲洋 (刁钲洋)	0	0:00
14	皮蛋	0	0:00
14	穆萨	0	0:00
14	封宜江（fengyijiang） (封宜江)	0	0:00
14	开朗网友	0	0:00
14	Noah (mwx)	0	0:00
14	爱琴海校区-黄辰浩 (huangchenhao)	0	0:00
14	胡宇尧	0	0:00
14	唐翰	0	0:00
14	新壹街校区-周士杰 (zsj)	0	0:00
14	杨雅童	0	0:00
14	金沙校区-先珂熠 (九转大肠)	0	0:00
14	胡宸瑞	0	0:00
14	technoblade	0	0:00
14	爱琴海校区-李卓翰 (李卓翰)	0	0:00
14	欧俊阳	0	0:00
14	江子墨	0	0:00
14	贾易征	0	0:00
14	勾晨禹	0	0:00
14	Accepted (周芷乐)	0	0:00
14	heyuzhe	0	0:00
14	CPL	0	0:00
14	沈煜恒 (一位老六)	0	0:00
14	赵奕铭	0	0:00
14	陈家熠	0	0:00
14	acacac (董子溪)	0	0:00
14	夏麟然	0	0:00
14	可爱酱 (张可忻)	0	0:00
14	张瑞博	0	0:00
14	洛阳锦程 (郭思利)	0	0:00
14	佘灏然	0	0:00
14	蒋金卓	0	0:00
14	xuniaoyin (徐袅音)	0	0:00
14	手搓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)	0	0:00
14	田博宇	0	0:00
14	时代一校-王宥量 (wangyouliang)	0	0:00
14	邱越1	0	0:00
14	shangtian	0	0:00
14	冯若涵	0	0:00
14	王培锦	0	0:00
14	周子义	0	0:00
14	新壹街-王俊博 (王俊博)	0	0:00
14	6 (龙浩恩)	0	0:00
14	王昱祺 (12王昱祺)	0	0:00
14	新壹街—熊轩杭 (xiongxuanhang)	0	0:00
14	张宸睿	0	0:00
14	11451254188 (22029-mjh)	0	0:00
14	zhangyouze (张佑泽)	0	0:00
14	新壹街校区-陈琬舒 (空空大师)	0	0:00
14	爱情海校区—沙天一 (沙天一)	0	0:00
14	没有此人 (akm)	0	0:00
14	邹智吉	0	0:00
14	金沙—彭智宸 (彭智宸)	0	0:00
14	曼波（＾-＾） (hechenxuan23005)	0	0:00
14	311	0	0:00
14	吴佳智 (AWM)	0	0:00
14	新壹街校区-付宇轩 (fyx)	0	0:00
14	雷诺伊尔 (崔金鹏)	0	0:00
14	天天（聂振洺） (icefall)	0	0:00
14	王婕斯	0	0:00
14	小忙果 (王昱杰)	0	0:00
14	何煜琦	0	0:00
14	盗号者该死 (陶欣垚)	0	0:00
14	RanHao	0	0:00
14	吴子逸	0	0:00
14	liuyuanxi23017	0	0:00
14	时代二校+王吕棪 (wanglvyan)	0	0:00
14	雷承翰 (雷承翰lch)	0	0:00
14	xsm陶品旭	0	0:00
14	取个名字真难 (13883236511)	0	0:00
14	xsm杜俊杰	0	0:00
14	xsm吴佳锐	0	0:00
14	程舒然	0	0:00
14	李yc	0	0:00
14	向羿龙	0	0:00
14	爱琴海校区-穆宏斌 (穆宏斌)	0	0:00

状态

开发

支持

状态

开发

支持

还没有账户？

登录