VE280 SU2019 (Weikang and Paul)
Powered by JOJ
/ VE280 SU2019 (Weikang and Paul) /

Record Detail

Runtime Error 

/in/p2.cpp: In function 'int dot(list_t, list_t)':
/in/p2.cpp:19:31: warning: no return statement in function returning non-void [-Wreturn-type]
 int dot(list_t v1, list_t v2){};
                               ^
/in/p2.cpp: In function 'opaque_list* filter_odd(list_t)':
/in/p2.cpp:49:32: warning: no return statement in function returning non-void [-Wreturn-type]
 list_t filter_odd(list_t list){};
                                ^
/in/p2.cpp: In function 'opaque_list* filter(list_t, bool (*)(int))':
/in/p2.cpp:51:45: warning: no return statement in function returning non-void [-Wreturn-type]
 list_t filter(list_t list, bool (*fn)(int)){};
                                             ^
/in/p2.cpp: In function 'opaque_list* unique(list_t)':
/in/p2.cpp:53:28: warning: no return statement in function returning non-void [-Wreturn-type]
 list_t unique(list_t list){};
                            ^
/in/p2.cpp: In function 'opaque_list* insert_list(list_t, list_t, unsigned int)':
/in/p2.cpp:55:65: warning: no return statement in function returning non-void [-Wreturn-type]
 list_t insert_list(list_t first, list_t second, unsigned int n){};
                                                                 ^
/in/p2.cpp: In function 'opaque_list* chop(list_t, unsigned int)':
/in/p2.cpp:57:42: warning: no return statement in function returning non-void [-Wreturn-type]
 list_t chop(list_t list, unsigned int n){};
                                          ^
/in/p2.cpp: In function 'int depth(tree_t)':
/in/p2.cpp:73:24: warning: no return statement in function returning non-void [-Wreturn-type]
 int depth(tree_t tree){};
                        ^
/in/p2.cpp: In function 'int tree_max(tree_t)':
/in/p2.cpp:75:27: warning: no return statement in function returning non-void [-Wreturn-type]
 int tree_max(tree_t tree){};
                           ^
/in/p2.cpp: In function 'bool tree_hasMonotonicPath(tree_t)':
/in/p2.cpp:84:41: warning: no return statement in function returning non-void [-Wreturn-type]
 bool tree_hasMonotonicPath(tree_t tree){};
                                         ^
/in/p2.cpp: In function 'bool tree_allPathSumGreater(tree_t, int)':
/in/p2.cpp:86:51: warning: no return statement in function returning non-void [-Wreturn-type]
 bool tree_allPathSumGreater(tree_t tree, int sum){};
                                                   ^
/in/p2.cpp: In function 'opaque_tree* insert_tree(int, tree_t)':
/in/p2.cpp:108:42: warning: no return statement in function returning non-void [-Wreturn-type]
 tree_t insert_tree(int elt, tree_t tree){};
                                          ^
# Status Time Cost Memory Cost
#1 Accepted Detail 2ms 404.0 KiB
#2 Accepted Detail 2ms 388.0 KiB
#3 Accepted Detail 2ms 384.0 KiB
#4 Accepted Detail 2ms 384.0 KiB
#5 Accepted Detail 2ms 384.0 KiB
#6 Accepted Detail 2ms 600.0 KiB
#7 Accepted Detail 3ms 504.0 KiB
#8 Accepted Detail 3ms 636.0 KiB
#9 Accepted Detail 2ms 520.0 KiB
#10 Accepted Detail 2ms 512.0 KiB
#11 Accepted Detail 2ms 384.0 KiB
#12 Accepted Detail 2ms 380.0 KiB
#13 Accepted Detail 2ms 440.0 KiB
#14 Accepted Detail 1ms 456.0 KiB
#15 Accepted Detail 1ms 444.0 KiB
#16 Accepted Detail 1ms 384.0 KiB
#17 Accepted Detail 2ms 404.0 KiB
#18 Accepted Detail 2ms 384.0 KiB
#19 Accepted Detail 1ms 384.0 KiB
#20 Accepted Detail 2ms 404.0 KiB
#21 Accepted Detail 1ms 380.0 KiB
#22 Accepted Detail 3ms 460.0 KiB
#23 Accepted Detail 2ms 508.0 KiB
#24 Accepted Detail 2ms 328.0 KiB
#25 Accepted Detail 1ms 332.0 KiB
#26 Accepted Detail 1ms 404.0 KiB
#27 Accepted Detail 1ms 380.0 KiB
#28 Accepted Detail 1ms 376.0 KiB
#29 Accepted Detail 2ms 384.0 KiB
#30 Accepted Detail 2ms 428.0 KiB
#31 Accepted Detail 1ms 380.0 KiB
#32 Accepted Detail 1ms 456.0 KiB
#33 Accepted Detail 2ms 520.0 KiB
#34 Accepted Detail 5ms 824.0 KiB
#35 Accepted Detail 3ms 620.0 KiB
#36 Accepted Detail 2ms 512.0 KiB
#37 Accepted Detail 2ms 432.0 KiB
#38 Accepted Detail 3ms 640.0 KiB
#39 Accepted Detail 2ms 384.0 KiB
#40 Accepted Detail 3ms 508.0 KiB
#41 Accepted Detail 1ms 384.0 KiB
#42 Accepted Detail 3ms 376.0 KiB
#43 Accepted Detail 3ms 384.0 KiB
#44 Wrong Answer Detail 2ms 392.0 KiB
#45 Wrong Answer Detail 2ms 404.0 KiB
#46 Wrong Answer Detail 2ms 456.0 KiB
#47 Wrong Answer Detail 2ms 384.0 KiB
#48 Wrong Answer Detail 1ms 332.0 KiB
#49 Wrong Answer Detail 2ms 380.0 KiB
#50 Wrong Answer Detail 2ms 504.0 KiB
#51 Wrong Answer Detail 3ms 668.0 KiB
#52 Wrong Answer Detail 2ms 480.0 KiB
#53 Wrong Answer Detail 2ms 384.0 KiB
#54 Wrong Answer Detail 1ms 380.0 KiB
#55 Wrong Answer Detail 2ms 384.0 KiB
#56 Wrong Answer Detail 2ms 384.0 KiB
#57 Wrong Answer Detail 2ms 344.0 KiB
#58 Runtime Error (-6) Detail 2ms 468.0 KiB
#59 Runtime Error (-6) Detail 2ms 384.0 KiB
#60 Runtime Error (-6) Detail 2ms 460.0 KiB
#61 Wrong Answer Detail 2ms 384.0 KiB
#62 Wrong Answer Detail 2ms 384.0 KiB
#63 Wrong Answer Detail 1ms 424.0 KiB
#64 Wrong Answer Detail 2ms 384.0 KiB
#65 Wrong Answer Detail 2ms 448.0 KiB
#66 Wrong Answer Detail 2ms 384.0 KiB
#67 Wrong Answer Detail 2ms 384.0 KiB
#68 Runtime Error (-11) Detail 2ms 456.0 KiB
#69 Runtime Error (-11) Detail 2ms 448.0 KiB
#70 Runtime Error (-11) Detail 2ms 448.0 KiB
#71 Runtime Error (-11) Detail 2ms 432.0 KiB
#72 Runtime Error (-11) Detail 2ms 384.0 KiB
#73 Accepted Detail 2ms 384.0 KiB
#74 Accepted Detail 1ms 404.0 KiB
#75 Accepted Detail 2ms 384.0 KiB
#76 Accepted Detail 2ms 384.0 KiB
#77 Accepted Detail 2ms 384.0 KiB
#78 Accepted Detail 2ms 648.0 KiB
#79 Accepted Detail 3ms 768.0 KiB
#80 Accepted Detail 3ms 904.0 KiB
#81 Accepted Detail 3ms 808.0 KiB
#82 Accepted Detail 2ms 452.0 KiB
#83 Accepted Detail 2ms 384.0 KiB
#84 Accepted Detail 1ms 384.0 KiB
#85 Accepted Detail 2ms 384.0 KiB
#86 Accepted Detail 1ms 384.0 KiB
#87 Accepted Detail 1ms 424.0 KiB
#88 Accepted Detail 2ms 384.0 KiB
#89 Accepted Detail 9ms 4.746 MiB
#90 Runtime Error (-6) Detail 2ms 464.0 KiB
#91 Runtime Error (-6) Detail 2ms 472.0 KiB
#92 Runtime Error (-6) Detail 2ms 472.0 KiB
#93 Runtime Error (-6) Detail 2ms 464.0 KiB
#94 Runtime Error (-6) Detail 2ms 472.0 KiB
#95 Runtime Error (-6) Detail 2ms 464.0 KiB
#96 Wrong Answer Detail 4ms 784.0 KiB
#97 Wrong Answer Detail 2ms 456.0 KiB
#98 Runtime Error (-6) Detail 2ms 468.0 KiB
#99 Runtime Error (-6) Detail 2ms 504.0 KiB
#100 Runtime Error (-6) Detail 2ms 444.0 KiB
#101 Runtime Error (-6) Detail 2ms 468.0 KiB
#102 Runtime Error (-6) Detail 2ms 472.0 KiB
#103 Accepted Detail 8ms 1.18 MiB
#104 Accepted Detail 8ms 1.027 MiB
#105 Accepted Detail 2ms 384.0 KiB
#106 Accepted Detail 4ms 588.0 KiB
#107 Accepted Detail 2ms 384.0 KiB
#108 Accepted Detail 54ms 8.422 MiB
#109 Accepted Detail 58ms 8.457 MiB
#110 Accepted Detail 2ms 424.0 KiB
#111 Accepted Detail 53ms 8.406 MiB
#112 Accepted Detail 53ms 8.445 MiB
#113 Accepted Detail 2ms 404.0 KiB
#114 Wrong Answer Detail 26ms 4.418 MiB
#115 Wrong Answer Detail 26ms 4.438 MiB
#116 Runtime Error (-6) Detail 2ms 460.0 KiB
#117 Runtime Error (-6) Detail 28ms 4.562 MiB
#118 Wrong Answer Detail 2ms 412.0 KiB
#119 Wrong Answer Detail 4ms 656.0 KiB
#120 Accepted Detail 2ms 452.0 KiB
#121 Accepted Detail 43ms 6.957 MiB
#122 Accepted Detail 2ms 384.0 KiB
#123 Accepted Detail 3ms 504.0 KiB

Information

Submit By
Type
Submission
Homework
Project Two: Recursion
Language
C++
Submit At
2019-06-15 23:46:39
Judged At
2019-06-22 17:00:40
Judged By
Score
750
Total Time
650ms
Peak Memory
8.457 MiB
  1. Language
  1. © 2018 - 2022 Joint Online Judge
  2. FA2020-27-gec154be
  3. 沪交ICP备20190085号