提出一覧
コンテストの他の問題:| # | 提出日時 | 提出者 | 問題 | 言語 | 結果 | 実行時間 | コード長 | |
|---|---|---|---|---|---|---|---|---|
| 1187398 | 2026-09-18 16:49:10 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 3924 ms | 45,862 bytes | |
| 1187395 | 2026-09-18 16:42:37 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 4713 ms | 45,871 bytes | |
| 1187394 | 2026-09-18 16:41:04 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 4814 ms | 45,880 bytes | |
| 1187392 | 2026-09-18 16:37:56 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 4740 ms | 45,880 bytes | |
| 1187390 | 2026-09-18 16:34:27 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 5837 ms | 44,195 bytes | |
| 1187387 | 2026-09-18 16:29:20 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | AC | 4905 ms | 45,572 bytes | |
| 1187384 | 2026-09-18 16:27:45 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | MLE | - | 43,985 bytes | |
| 1187382 | 2026-09-18 16:26:36 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | MLE | - | 43,973 bytes | |
| 1187378 | 2026-09-18 16:21:19 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | TLE | - | 42,293 bytes | |
| 1187376 | 2026-09-18 16:19:11 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | TLE | - | 42,217 bytes | |
| 1187370 | 2026-09-18 16:11:14 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | TLE | - | 41,761 bytes | |
| 1187367 | 2026-09-18 15:37:18 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | TLE | - | 40,751 bytes | |
| 1187366 | 2026-09-18 15:36:42 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | WA | - | 40,917 bytes | |
| 1187365 | 2026-09-18 15:32:54 |
kemuniku |
No.3671 Reusable Lazy Segment Tree | Nim | WA | - | 40,889 bytes | |
| 1185181 | 2026-09-09 07:33:27 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 24,764 bytes | |
| 1182891 | 2026-09-05 02:05:49 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | RE | - | 17,035 bytes | |
| 1182856 | 2026-09-05 01:32:24 |
あいすあうと |
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 4979 ms | 12,025 bytes | |
| 1182830 | 2026-09-05 01:21:44 |
あいすあうと |
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 10,096 bytes | |
| 1182775 | 2026-09-05 00:42:02 |
akakimidori |
No.3671 Reusable Lazy Segment Tree | Rust | TLE | - | 12,183 bytes | |
| 1182765 | 2026-09-05 00:35:49 |
akakimidori |
No.3671 Reusable Lazy Segment Tree | Rust | TLE | - | 10,417 bytes | |
| 1182755 | 2026-09-05 00:26:36 |
Taiki0715 |
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 4959 ms | 11,625 bytes | |
| 1182752 | 2026-09-05 00:23:04 |
tatyam |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | AC | 4838 ms | 8,683 bytes | |
| 1182743 | 2026-09-05 00:16:15 |
Taiki0715 |
No.3671 Reusable Lazy Segment Tree | C++23 | WA | - | 11,612 bytes | |
| 1182731 | 2026-09-05 00:10:26 |
Taiki0715 |
No.3671 Reusable Lazy Segment Tree | C++23 | WA | - | 11,610 bytes | |
| 1182723 | 2026-09-05 00:07:40 |
Taiki0715 |
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 11,497 bytes | |
| 1182676 | 2026-09-04 23:44:17 |
ei1333333 |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | AC | 3104 ms | 10,254 bytes | |
| 1182661 | 2026-09-04 23:35:06 |
maspy |
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 2176 ms | 27,511 bytes | |
| 1182650 | 2026-09-04 23:29:56 |
ei1333333 |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 11,837 bytes | |
| 1182644 | 2026-09-04 23:27:54 |
ei1333333 |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 10,085 bytes | |
| 1182631 | 2026-09-04 23:23:15 |
ei1333333 |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 9,963 bytes | |
| 1182236 | 2026-09-03 17:16:27 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | WA | - | 1,298 bytes | |
| 1179481 | 2026-08-27 16:22:37 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 3265 ms | 8,118 bytes | |
| 1179480 | 2026-08-27 16:18:45 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 5939 ms | 8,083 bytes | |
| 1178819 | 2026-08-25 02:36:47 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 2732 ms | 6,203 bytes | |
| 1178817 | 2026-08-25 02:29:06 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 6,171 bytes | |
| 1178805 | 2026-08-25 01:58:15 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | WA | - | 6,330 bytes | |
| 1178799 | 2026-08-25 01:43:55 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 6,100 bytes | |
| 1178794 | 2026-08-25 01:02:11 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 5,784 bytes | |
| 1178779 | 2026-08-25 00:03:52 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 5,517 bytes | |
| 1178777 | 2026-08-24 23:37:54 |
|
No.3671 Reusable Lazy Segment Tree | C++23 | TLE | - | 5,129 bytes | |
| 1177596 | 2026-08-19 10:15:32 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 12,518 bytes | |
| 1177595 | 2026-08-19 10:09:15 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 12,515 bytes | |
| 1177594 | 2026-08-19 10:06:15 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | WA | - | 12,465 bytes | |
| 1177593 | 2026-08-19 10:00:53 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 12,254 bytes | |
| 1177592 | 2026-08-19 09:57:45 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | TLE | - | 12,195 bytes | |
| 1177460 | 2026-08-17 22:15:43 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | AC | 5227 ms | 19,838 bytes | |
| 1177459 | 2026-08-17 22:01:00 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) |
TLE
(最新) -- AC |
- | 19,714 bytes | |
| 1177222 | 2026-08-15 11:55:27 |
harurun |
No.3671 Reusable Lazy Segment Tree | Rust | AC | 4440 ms | 12,125 bytes | |
| 1177220 | 2026-08-15 11:52:50 |
harurun |
No.3671 Reusable Lazy Segment Tree | C++23(gcc16) | AC | 3820 ms | 10,540 bytes | |
| 1176395 | 2026-08-12 17:31:19 |
👑 |
No.3671 Reusable Lazy Segment Tree | C++23 | AC | 4581 ms | 50,247 bytes |
検索
kemuniku
あいすあうと
akakimidori
Taiki0715
tatyam
ei1333333
maspy
harurun