Datasets:
Add USACO-Judge: 39 problems, 900 submissions
#1
by dzy97 - opened
- README.md +44 -1
- figure_composition.png +3 -0
- problems.jsonl +0 -0
- submissions.jsonl +0 -0
README.md
CHANGED
|
@@ -1,3 +1,46 @@
|
|
| 1 |
---
|
| 2 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 3 |
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
---
|
| 2 |
+
task_categories:
|
| 3 |
+
- text-generation
|
| 4 |
+
language:
|
| 5 |
+
- en
|
| 6 |
+
tags:
|
| 7 |
+
- code
|
| 8 |
+
- competitive-programming
|
| 9 |
+
- verification
|
| 10 |
+
- usaco
|
| 11 |
+
size_categories:
|
| 12 |
+
- n<1K
|
| 13 |
+
configs:
|
| 14 |
+
- config_name: problems
|
| 15 |
+
data_files: problems.jsonl
|
| 16 |
+
- config_name: submissions
|
| 17 |
+
data_files: submissions.jsonl
|
| 18 |
---
|
| 19 |
+
|
| 20 |
+
# USACO-Judge
|
| 21 |
+
|
| 22 |
+
A benchmark for judging competitive-programming solutions: given a problem and a candidate
|
| 23 |
+
solution, decide Accept / Reject, and on Reject, produce a concrete input that breaks the code.
|
| 24 |
+
Existing hacking benchmarks are built entirely from known-wrong candidates, so they only test
|
| 25 |
+
the breaking half of verification. USACO-Judge is balanced 1:2 AC:non-AC, so it also tests
|
| 26 |
+
whether a verifier correctly accepts solutions that are actually correct. Built from 39 official
|
| 27 |
+
USACO 2026 problems and 900 real candidate submissions.
|
| 28 |
+
|
| 29 |
+
## `problems` (39 rows)
|
| 30 |
+
|
| 31 |
+
One row per problem: `cpid` (USACO's official problem id — `usaco.org/index.php?page=viewproblem2&cpid=<cpid>`),
|
| 32 |
+
`title`, `contest`, `division`, `problem_number`, `source_url`, `statement_md`, `checker_kind`,
|
| 33 |
+
`time_limit_s`, `memory_limit_mb`, `n_tests`, `n_sample_tests`, `point_scores`, `val_cpp`
|
| 34 |
+
(validator), `std_cpp` (reference solution), `chk_cpp` (custom checker, null for problems that
|
| 35 |
+
use a standard comparator), `std_source_submission_id`, `std_origin`.
|
| 36 |
+
|
| 37 |
+
## `submissions` (900 rows: 270 easy + 630 hard)
|
| 38 |
+
|
| 39 |
+
One row per submission: `sid`, `cpid` (links to `problems`), `split` (`easy`/`hard`), `code`,
|
| 40 |
+
`verdict` (`AC`/`WA`/`TLE`/`MLE`/`RE`), `score` (0-100). 300 are AC, 600 are not. The `easy`
|
| 41 |
+
split draws from the 18 Bronze/Silver problems, `hard` from the 21 Gold/Platinum/Open problems.
|
| 42 |
+
|
| 43 |
+

|
| 44 |
+
|
| 45 |
+
Non-AC candidates are stratified across five score bands (1-19, 20-39, 40-59, 60-79, 80-99),
|
| 46 |
+
each a distinct plateau of suboptimal algorithms rather than a single bug pattern.
|
figure_composition.png
ADDED
|
Git LFS Details
|
problems.jsonl
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|
submissions.jsonl
ADDED
|
The diff for this file is too large to render.
See raw diff
|
|
|