Support ICPC-style scoring
Open
Nobody has claimed this yet.
feature_request
- Dominant language
- Python
- Stars
- 1k
- Forks
- 412
- Avg merge
- 6d 10h
- Merged PRs (30d)
- 3
Description
Something on these line:
- score of contest is sum of scores of tasks;
- score of task is 1 if solved, 0 if not solved;
- ties are solved by time;
- time of contest is sum of times of each task;
- time of a task is time of first correct submission, plus X * # failed submission.
We should avoid over-generalizing and support ICPC-style scoring with tasks that can be partially solved.
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no files, tests, or entry points. Start by locating the contest-scoring implementation and tracing how task scores, solved status, submissions, and times are represented. Done means ICPC-style scoring supports partially solved tasks without over-generalizing, including the stated score, tie-break, and penalty-time rules.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- python
- Domain
- backend
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100