比赛成绩表 - XSM

#	用户	总分数	A 99/180	B 79/306	C 57/206	D 23/71	E 16/61
1	zhangyh (张育菡)	500	100	100	100	100	100
1	李林峰 (金克拉)	500	100	100	100	100	100
1	Tender. (05c05-zhou)	500	100	100	100	100	100 / 100
1	姚宏逸	500	100	100	100	100	100 / 100
1	11111	500	100	100	100	100	100
1	蒲梓勋 (puzixun)	500	100	100	100 / 100	100	100
1	疯神芭芭脱丝 (李卓修)	500	100	100	100	100	100
1	赵泳鑫 (zhaoyongxin)	500	100	100	100	100	100
1	德克萨斯做的到吗 (liyangbao)	500	100	100	100	100	100
1	金锦泽 (jinjinze)	500	100	100	100	100	100
1	本人天生贪生pass (05c41-cqs)	500	100	100	100	100	100
1	wzzjnb2012	500	100	100	100	100	100
13	yxj	490	100	100	100	100	90
14	老六 (......)	420	100	100	100	100	20 / 0
15	坤坤荔枝小黑子 (zhonghaotian22006)	400	100	100	100	-	100
15	wuqilin	400	100	100	100	100	-
15	05c05-zzx	400	100	100	100	100	-
15	刘政君 (lzj)	400	100	100	100	100	-
15	奇怪的正义人！ (leweiqi)	400	100	100	100	100	-
15	陈海骞 (chq)	400	100	100	100	100	-
15	fzx	400	100	100	100	100	-
15	我是傻逼	400	100	100	100	-	100
15	曹埊睿 (caodirui)	400	100 / 100	100 / 100	100	100	0
24	余龙恩 (小码君)	387	100	87	100	100	-
25	RanHao	330	100 / 100	100 / 100	100	30 / 100	-/ 100
26	yangbinyu	320	100	100	100	20 / 0	-
27	zry	310	100	100	100	10 / 10	-
27	王重道	310	100	100	100	10	-
29	天之渺 (05c41-dd)	300	100	100	0 / 0	100	0
29	傅翊航 (fyh)	300	100	100	100	-	-
29	汤杰尧 (05c05-tjy1)	300	100	100	100	-	-
29	朱老师 (zyp)	300	100	100	100	-/ 100	-/ 100
29	1396013295	300	100	100	100	-	-
29	李禹衡 (liyuheng22006)	300	100	100	100	-	-/ 100
29	黄梓桐 (HuangZiTong)	300	100	100	100	-	-
29	刘致言	300	100	100	100	0	-
29	zhangheyi22006	300	100	100	100	-	-/ 100
29	罗翌珂 (dangdang)	300	100	100	100 / 100	-	-
29	何晟瑞 (hsr01)	300	100	100	100	-	-
29	刘老师 (图书管理员)	300	-	100	100	-/ 100	100
29	郑岐蔚	300	100	100 / 100	100	-	-
29	wangzihang	300	100	100 / 100	100 / 100	-	-
29	colin1112 (墙凌可)	300	100	100	100	-	-/ 0
29	zyp (wangjunling23010)	300	100	100	100	-	-
29	手搓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)	300	100 / 100	100	100	-	-
29	南坪校区-龙浩睿 (longhaorui)	300	100	100	100	-	-
29	南坪协信校区-叶钟阳 (yezhongyang23010)	300	100	100	100	-	-
29	南坪校区-郑力博 (zhenglibo23003)	300	100	100	100	-	-
29	sb (linjiayu23010)	300	100	100	100	-	-
29	龙吉先 (ljx)	300	100	100	100	-	-
29	11451254188 (22029-mjh)	300	100 / 100	100	100	-	-/ 30
29	xuniaoyin (徐袅音)	300	100 / 100	100	100	-	-/ 0
29	CK (李弘毅)	300	100	100	100	-	-
54	陈杰晟 (王梓屹)	287	100	87 / 87	100	-	-
54	李彦臻	287	100	87 / 100	100	-	-/ 10
56	文硕 (文硕1)	270	100	100	-	70	-
57	昌文迪 (05c05-cwd2)	230	100	100	10 / 0	10	10
58	赵沛喆	200	100	100	-	-	-
58	繁星 (05c35-zzm)	200	100	100	0 / 0	-	-
58	(05c35-cyd)	200	100	100	0 / 0	-	0 / 0
58	05c05-yyc	200	100	100	-	-	-
58	05c05-scl	200	100	100	-	-	-
58	谭红中 (不知道)	200	100	100	0 / 0	-	-
58	王宇桐 (我是外挂)	200	100	100	-	-	-
58	Randy Marsh (杨子腾)	200	100	100	-	-	-
58	赵志陶 (zztzzt)	200	100	100	-	-	-
58	muwangjunxi	200	100	100	-	-	-
58	张峻熙	200	100	100	0 / 0	-	-
58	杜俊宏	200	100	100	-	-	-
58	蓝色妖姬 (jiangpeiyu)	200	100	0	100	-	0
58	zlx (xiao)	200	100	100	-	-/ 100	-/ 100
58	爱琴海校区-刁钲洋 (刁钲洋)	200	100	100	0	0	0
58	SYH.邵允涵 (Zoe邵)	200	100	100	0	-	-
58	经常消失 (小萝卜)	200	100	-	100	-	-/ 100
58	何星震 (Jacob)	200	100	100	0 / 0	0	0
58	曾翊洋 (海洋万象)	200	100	100	-	-	-
58	关博源	200	100	100	-	-	-
58	源著校区-惠予宸 (huiyuchen2)	200	100	100	-	-	-
58	我推的乱破 (贺俊楠)	200	100 / 100	100 / 100	-/ 100	-/ 100	-
58	杨颂恩 (yangsongen)	200	100	100	-/ 100	-	-
58	许炜铭 (xuweiming)	200	100 / 100	100 / 100	-	-	-
58	希蒙 (zhengxingya)	200	100 / 100	100	-	-	-
58	廖海宇在追杀马牌痞 (liaohaiyu22031)	200	100 / 100	100 / 100	-/ 100	-	-
84	彭嘉豪 (pengjiahao)	187	100	87 / 0	-	-	0
84	马渝杭 (mayuhang)	187	100	87 / 87	-	-	-
84	lch (凌昌瀚)	187	100	87 / 87	-	-	-
84	dustsans (njo)	187	100	87	-	-	-
84	龙湖时代C馆-邹镇宇 (邹镇宇)	187	100	87	-	-	-
84	偽艺術家 (chenyanchi22006)	187	100	87	0	-	-
84	可恶的张映栩 (Johnson)	187	100	87 / 100	-	-	-
84	sqmyb	187	100	87	-	-	-
84	源著校区-宋昊成 (马冬梅)	187	100 / 100	87 / 0	-	-	-
93	徐康景 (dcm)	137	50 / 50	87 / 87	-	-	-
94	Eric Zoe (05c35-zyr)	100	100	-	0 / 0	0	-
94	05c05-hzy	100	100	-	-	-	0
94	ycy	100	-	-	-	-	100
94	李树崑 (lishukun)	100	100	-	0	-	-
94	时代一校蒋帛希 (13983392730)	100	0 / 100	0 / 87	100	-	-
94	MoonLight ( aaa)	100	100	0	-	-	-
94	陈秋石	100	-	100	-	-	-
94	缥 (王硕2012)	100	100 / 100	0 / 87	-	-	-
94	raozheng	100	100	-	-	-	-
94	chenjunyao	100	100	-/ 0	-	-	-
94	没有此人 (akm)	100	100 / 100	-/ 100	-/ 100	-	-/ 100
105	lyk	40	40	-	-	-	-
105	zhuqiwei22006	40	40	0	-	-	-
107	吴卓轩	36	-	36 / 36	-	-	-
108	黄鹏翰	10	10 / 100	-/ 87	-	-	-
108	喻兴诚 (Brian)	10	10	-	-	-	-
110	05c05-zjk	0	0	-	-	-	-
110	cupy战士 (05c05-dkf)	0	-	0	-	-	-
110	baijinlin22003	0	0 / 0	-	-	-	-
110	时代校区-孔令皓 (konglinghao)	0	-/ 100	0 / 100	-	-	-
114	Alduin	0	-	-	-	-	-
114	何洋名 (heyangming)	0	-	-	-	-	-
114	谭懿轩 (yanyixuan)	0	-	-	-	-	-/ 100
114	huanglu	0	-/ 100	-/ 100	-	-	-/ 100
114	罗伟杰 (13308275065)	0	-	-	-/ 0	-	-
114	LDE__113 (逯典恩)	0	-	-	-	-	-
114	jdy	0	-/ 100	-	-	-	-/ 100
114	诸禹吉 (zhuyuji)	0	-	-	-	-	-
114	梁金同 (liangjintong)	0	-	-	-	-	-
114	luozixi	0	-	-	-	-	-
114	罗晨睿 (luochenrui)	0	-	-	-	-	-
114	林小博	0	-/ 100	-/ 36	-	-	-
114	zhm123	0	-/ 100	-/ 100	-/ 100	-/ 100	-/ 100
114	MOD	0	-	-	-	-	-
114	邵冠铖 (shaoguancheng22031)	0	-/ 100	-	-	-	-
114	唐梓竣	0	-/ 100	-/ 100	-/ 100	-	-/ 100
114	陈风亦 (chenfengyi)	0	-	-/ 100	-	-	-
114	zhangxinchen	0	-	-	-	-	-
114	曾子墨	0	-	-	-	-	-
114	dengduxi	0	-/ 100	-	-/ 100	-/ 100	-
114	李龙腾 (llt)	0	-	-	-	-	-
114	余彦瑞	0	-	-/ 87	-	-	-
114	曹元明	0	-	-	-	-	-
114	liuser	0	-	-	-	-	-
114	孟子轩	0	-	-	-	-	-
114	yanxiaosong	0	-	-	-	-	-
114	CPL	0	-/ 100	-	-	-	-
114	刘昱辰	0	-	-	-	-	-
114	wangziji	0	-	-	-	-	-
114	曾御城（现用名） (Jason)	0	-	-	-	-	-
114	唐臣谦 (tangchenqian1)	0	-	-	-	-	-
114	吕淼 (05c41-lm)	0	-	-	-	-	-
114	SHY20091224	0	-	-	-	-	-
114	zhangzhimo	0	-	-	-	-	-/ 100
114	范老师	0	-/ 100	-/ 100	-	-	-
114	任童(rentong)	0	-	-	-	-	-
114	10255	0	-	-	-/ 100	-	-
114	郭人瑀1	0	-/ 100	-	-	-	-
114	quzhibo	0	-	-	-	-	-
114	周琪渃	0	-/ 100	-/ 100	-	-	-/ 100
114	ych	0	-/ 0	-	-	-	-
114	22029-lsl	0	-/ 100	-	-	-	-
114	临时账户（dangdang）	0	-	-	-	-	-
114	RACOP	0	-	-	-	-	-
114	胡宸华 (huchenhua)	0	-/ 100	-/ 100	-	-	-
114	罗竣瀚	0	-	-	-	-	-
114	无尽的想象 (谭仕高)	0	-	-	-	-	-
114	黄誉翔 (黄誉翔)	0	-	-	-	-	-
114	坤坤荔枝小黑子	0	-	-	-	-	-
114	kongchenxu2024	0	-	-	-	-	-
114	xflt_dyp	0	-	-	-	-	-
114	时代一校-曾科智 (曾科智)	0	-	-	-	-	-
114	余晨浩 (yuchenhao)	0	-	-	-	-	-
114	Nico	0	-/ 100	-/ 100	-/ 100	-	-/ 100
114	dd123	0	-	-	-	-	-
114	刘昊臻 (liuhaozhen)	0	-	-	-	-	-/ 100
114	新壹街朱启航 (zhuqihang)	0	-	-	-	-	-
114	陈家齐 (陈家齐1)	0	-/ 100	-	-	-	-
114	周靖松 (ZhouJS)	0	-	-	-	-	-
114	邹曜丞 (13983097018)	0	-/ 100	-	-	-	-
114	edy	0	-	-	-	-	-
114	x0l0x	0	-	-	-	-	-
114	南坪校区-邓皓文 (nth_element)	0	-	-	-	-	-

状态

开发

支持

状态

开发

支持

还没有账户？

登录