Record Detail

/in/p2.cpp: In function 'opaque_list* filter(list_t, bool (*)(int))':
/in/p2.cpp:348:9: warning: unused variable 'n' [-Wunused-variable]
     int n = list_first(list);
         ^
/in/p2.cpp: In function 'bool tree_allPathSumGreater(tree_t, int)':
/in/p2.cpp:841:9: warning: unused variable 'n' [-Wunused-variable]
     int n = 0;
         ^
/in/p2.cpp: In function 'int isIncreasing_help(list_t, int)':
/in/p2.cpp:128:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'opaque_list* reverse_help(list_t, list_t)':
/in/p2.cpp:170:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'opaque_list* append_help(list_t, list_t)':
/in/p2.cpp:202:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'int isArithmeticSequence_help(list_t, int, int)':
/in/p2.cpp:244:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'opaque_list* unique_helper2(int, list_t, list_t)':
/in/p2.cpp:388:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'bool tree_hasMonotonicPath(tree_t)':
/in/p2.cpp:777:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
/in/p2.cpp: In function 'int tree_allPathSumGreater_help(tree_t, int, int, int)':
/in/p2.cpp:807:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

#	Status	Time Cost	Memory Cost
#1	Accepted Detail	2ms	404.0 KiB
#2	Wrong Answer Detail	2ms	388.0 KiB
#3	Wrong Answer Detail	1ms	328.0 KiB
#4	Wrong Answer Detail	1ms	384.0 KiB
#5	Accepted Detail	2ms	384.0 KiB
#6	Wrong Answer Detail	1ms	456.0 KiB
#7	Wrong Answer Detail	2ms	504.0 KiB
#8	Wrong Answer Detail	3ms	532.0 KiB
#9	Wrong Answer Detail	3ms	504.0 KiB
#10	Wrong Answer Detail	2ms	508.0 KiB
#11	Wrong Answer Detail	1ms	380.0 KiB
#12	Wrong Answer Detail	2ms	384.0 KiB
#13	Wrong Answer Detail	2ms	440.0 KiB
#14	Wrong Answer Detail	2ms	436.0 KiB
#15	Accepted Detail	2ms	424.0 KiB
#16	Accepted Detail	2ms	384.0 KiB
#17	Accepted Detail	2ms	424.0 KiB
#18	Accepted Detail	2ms	376.0 KiB
#19	Accepted Detail	2ms	380.0 KiB
#20	Accepted Detail	2ms	396.0 KiB
#21	Accepted Detail	1ms	384.0 KiB
#22	Accepted Detail	18ms	672.0 KiB
#23	Accepted Detail	9ms	552.0 KiB
#24	Accepted Detail	2ms	412.0 KiB
#25	Accepted Detail	2ms	380.0 KiB
#26	Accepted Detail	1ms	396.0 KiB
#27	Accepted Detail	2ms	444.0 KiB
#28	Accepted Detail	2ms	432.0 KiB
#29	Accepted Detail	2ms	408.0 KiB
#30	Accepted Detail	2ms	384.0 KiB
#31	Accepted Detail	2ms	388.0 KiB
#32	Accepted Detail	2ms	384.0 KiB
#33	Accepted Detail	3ms	532.0 KiB
#34	Accepted Detail	4ms	744.0 KiB
#35	Accepted Detail	3ms	640.0 KiB
#36	Accepted Detail	2ms	512.0 KiB
#37	Accepted Detail	3ms	512.0 KiB
#38	Accepted Detail	3ms	636.0 KiB
#39	Accepted Detail	2ms	440.0 KiB
#40	Accepted Detail	3ms	536.0 KiB
#41	Accepted Detail	2ms	376.0 KiB
#42	Accepted Detail	2ms	404.0 KiB
#43	Accepted Detail	2ms	376.0 KiB
#44	Accepted Detail	2ms	392.0 KiB
#45	Accepted Detail	2ms	384.0 KiB
#46	Accepted Detail	2ms	392.0 KiB
#47	Accepted Detail	2ms	384.0 KiB
#48	Accepted Detail	2ms	508.0 KiB
#49	Accepted Detail	2ms	384.0 KiB
#50	Accepted Detail	3ms	504.0 KiB
#51	Accepted Detail	6ms	664.0 KiB
#52	Accepted Detail	3ms	428.0 KiB
#53	Accepted Detail	2ms	384.0 KiB
#54	Accepted Detail	2ms	456.0 KiB
#55	Accepted Detail	2ms	404.0 KiB
#56	Accepted Detail	2ms	384.0 KiB
#57	Accepted Detail	3ms	456.0 KiB
#58	Accepted Detail	2ms	428.0 KiB
#59	Accepted Detail	2ms	388.0 KiB
#60	Accepted Detail	2ms	360.0 KiB
#61	Accepted Detail	1ms	380.0 KiB
#62	Accepted Detail	2ms	376.0 KiB
#63	Accepted Detail	2ms	384.0 KiB
#64	Accepted Detail	2ms	380.0 KiB
#65	Accepted Detail	1ms	376.0 KiB
#66	Accepted Detail	2ms	436.0 KiB
#67	Accepted Detail	3ms	384.0 KiB
#68	Accepted Detail	2ms	548.0 KiB
#69	Wrong Answer Detail	2ms	512.0 KiB
#70	Wrong Answer Detail	4ms	776.0 KiB
#71	Wrong Answer Detail	3ms	564.0 KiB
#72	Wrong Answer Detail	5ms	760.0 KiB
#73	Accepted Detail	2ms	396.0 KiB
#74	Accepted Detail	3ms	384.0 KiB
#75	Accepted Detail	2ms	440.0 KiB
#76	Accepted Detail	2ms	404.0 KiB
#77	Accepted Detail	2ms	380.0 KiB
#78	Accepted Detail	11ms	1.09 MiB
#79	Accepted Detail	14ms	1.434 MiB
#80	Accepted Detail	12ms	1.605 MiB
#81	Accepted Detail	9ms	1.281 MiB
#82	Accepted Detail	7ms	664.0 KiB
#83	Accepted Detail	2ms	452.0 KiB
#84	Accepted Detail	2ms	380.0 KiB
#85	Accepted Detail	3ms	448.0 KiB
#86	Accepted Detail	3ms	512.0 KiB
#87	Accepted Detail	2ms	452.0 KiB
#88	Accepted Detail	1ms	388.0 KiB
#89	Accepted Detail	4ms	504.0 KiB
#90	Accepted Detail	2ms	448.0 KiB
#91	Accepted Detail	2ms	460.0 KiB
#92	Accepted Detail	1ms	384.0 KiB
#93	Accepted Detail	2ms	408.0 KiB
#94	Accepted Detail	2ms	384.0 KiB
#95	Accepted Detail	2ms	508.0 KiB
#96	Accepted Detail	7ms	804.0 KiB
#97	Accepted Detail	2ms	456.0 KiB
#98	Accepted Detail	2ms	436.0 KiB
#99	Accepted Detail	1ms	384.0 KiB
#100	Accepted Detail	1ms	400.0 KiB
#101	Accepted Detail	2ms	384.0 KiB
#102	Accepted Detail	1ms	384.0 KiB
#103	Accepted Detail	8ms	1.188 MiB
#104	Accepted Detail	8ms	1.055 MiB
#105	Accepted Detail	2ms	384.0 KiB
#106	Accepted Detail	8ms	764.0 KiB
#107	Accepted Detail	2ms	524.0 KiB
#108	Accepted Detail	55ms	8.371 MiB
#109	Accepted Detail	55ms	8.461 MiB
#110	Accepted Detail	2ms	344.0 KiB
#111	Accepted Detail	55ms	8.34 MiB
#112	Accepted Detail	55ms	8.457 MiB
#113	Accepted Detail	2ms	424.0 KiB
#114	Accepted Detail	28ms	4.441 MiB
#115	Accepted Detail	30ms	4.449 MiB
#116	Wrong Answer Detail	2ms	392.0 KiB
#117	Accepted Detail	36ms	4.496 MiB
#118	Runtime Error (-6) Detail	2ms	504.0 KiB
#119	Wrong Answer Detail	8ms	684.0 KiB
#120	Accepted Detail	1ms	384.0 KiB
#121	Accepted Detail	46ms	6.941 MiB
#122	Accepted Detail	2ms	380.0 KiB
#123	Accepted Detail	9ms	656.0 KiB

Submit By: 朱舜奕 LV 0
Type: Submission
Homework: Project Two: Recursion
Language: C++
Submit At: 2019-06-13 10:02:26
Judged At: 2019-06-22 17:00:13
Judged By: 密院最笨ds

Score: 1040
Total Time: 761ms
Peak Memory: 8.461 MiB

Runtime Error

Information

Don't have an account?

SIGN IN