Status

# When Who Problem Lang Verdict Time Memory
72 2017-07-22 09:28:17 cyl A - Unimodal Array GNU G++ 5.1.0 Compilation Error - -
71 2017-07-22 09:27:57 saxin C - Five-In-a-Row GNU G++ 5.1.0 Wrong Answer on test 3 0 ms 2000 KB
70 2017-07-22 09:26:37 kf11 B - Binary Protocol GNU G++ 5.1.0 Accepted 15 ms 2100 KB
69 2017-07-22 09:25:34 Eden A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 40 31 ms 2000 KB
68 2017-07-22 09:25:34 cyl A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 4 15 ms 1800 KB
67 2017-07-22 09:25:19 cbjtu A - Unimodal Array GNU G++11 5.1.0 Accepted 30 ms 2100 KB
66 2017-07-22 09:24:55 Eden A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 40 31 ms 2000 KB
65 2017-07-22 09:23:52 莓良心 A - Unimodal Array GNU G++ 5.1.0 Accepted 31 ms 2100 KB
64 2017-07-22 09:22:57 cyl A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 8 15 ms 1800 KB
63 2017-07-22 09:21:56 邓响 A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 8 15 ms 1900 KB
62 2017-07-22 09:21:23 开元二十三年繁花斜坠 B - Binary Protocol GNU G++14 6.2.0 Accepted 15 ms 1900 KB
61 2017-07-22 09:20:21 开元二十三年繁花斜坠 A - Unimodal Array GNU G++14 6.2.0 Accepted 15 ms 1900 KB
60 2017-07-22 09:19:32 开元二十三年繁花斜坠 A - Unimodal Array GNU G++ 5.1.0 Accepted 15 ms 2100 KB
59 2017-07-22 09:18:10 邓响 A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 6 15 ms 1800 KB
58 2017-07-22 09:17:43 金睿琦 A - Unimodal Array GNU G++ 5.1.0 Accepted 31 ms 2100 KB
57 2017-07-22 09:13:07 kf11 A - Unimodal Array GNU G++ 5.1.0 Accepted 31 ms 2100 KB
56 2017-07-22 09:13:06 金睿琦 A - Unimodal Array GNU G++ 5.1.0 Wrong Answer on test 8 15 ms 2100 KB
55 2017-07-22 09:11:15 kf11 A - Unimodal Array GNU G++ 5.1.0 Runtime Error on test 1 15 ms 2000 KB
54 2017-07-22 09:10:03 Radium C - Five-In-a-Row GNU G++ 5.1.0 Accepted 30 ms 2100 KB
53 2017-07-22 09:09:16 Radium C - Five-In-a-Row GNU G++ 5.1.0 Accepted 15 ms 2100 KB
52 2017-07-22 09:08:30 saxin A - Unimodal Array GNU G++ 5.1.0 Accepted 15 ms 2100 KB
51 2017-07-22 09:07:35 saxin A - Unimodal Array GNU G++ 5.1.0 Compilation Error - -

© 2025 FAQs Contact About