task-proposal-repo-showcase/.gitea/issue_template/proposal.yaml

179 lines
4.3 KiB
YAML
Raw Normal View History

2023-07-21 21:29:27 +02:00
name: Task Proposal
about: Propose an idea for a task to be used in contests at SOI.
2023-07-22 01:40:27 +02:00
labels:
- task
- task/round/any
- task/difficulty/any
2023-07-21 21:29:27 +02:00
body:
- type: markdown
attributes:
value: |
Thanks for taking the time to propose a task!
Do not forget to **update the issue title** with your unique task name.
- type: input
id: author
attributes:
label: Author
description: Who had the idea for this task? If applicable, also link original source.
placeholder: stofl and binna, inspired by https://codeforces.com/problemset/problem/1/A
validations:
required: true
2023-07-24 00:00:56 +02:00
- type: textarea
id: task
attributes:
label: Task description
description: "Formal problem statement. Optional: Add your story idea."
validations:
required: true
2023-07-24 00:00:56 +02:00
- type: textarea
id: subtasks
attributes:
label: Subtasks
description: Possible subtasks or variations of the task.
- type: input
2023-07-22 01:27:39 +02:00
id: spoiler-begin
attributes:
2023-07-22 01:35:14 +02:00
label: "---"
description: "No change is required: Opening the spoiler tag to hide solution and topic ideas, preventing accidential spoiling."
placeholder: <details><summary>Topic Tags</summary>
value: <details><summary>Topic Tags</summary>
- type: dropdown
id: round
2023-07-21 21:29:27 +02:00
attributes:
label: "Topics"
description: "Relevant topics for this task."
multiple: true
options:
- 2d segment tree
- 2sat
- 3d prefix sum
- adhoc
- aho-corasic
- amortization
- articulation points
- bellman-ford
- bfs
- bignum
- binary search
- binary search tree
- bipartite matching
- bridges
- brute force
- cartesian tree
- centroid decomposition
- combinatorics
- connected components
- convex hull
- convex hull trick
- deque
- dfs
- dijkstra
- divide and conquer
- dp
- edit distance
- fastpow
- fenwick tree
- floyd-warshall
- gcd
- geometry
- grahams scan
- graph
- greedy
- hashmap
- heap
- implementation
- interactive
- interval tree
- kmp
- kruskal
- lca
- lcd
- lcs
- line intersection
- lis
- map
- math
- matrix
- maxflow
- mcm
- median
- mer
- min-cost flow
- mst
- multimap
- multiset
- next permutation
- number theory
- offline processing
- output only
- path
- longest path in dag
- permutations
- precomputation
- prefix sum
- prim
- priority queue
- quad tree
- queue
- range minimum query
- scanline
- scc
- search
- segment tree
- set
- shortest path
- sorting
- stack
- string
- subsets
- toposort
- tree
- trivial
- union find
- warmup
validations:
required: false
- type: input
id: topics-freeform
attributes:
label: "Topics (free-form)"
description: "Additional topics which are not available in the dropdown."
validations:
required: false
2023-07-21 21:29:27 +02:00
- type: markdown
attributes:
2023-07-21 21:33:49 +02:00
value: |
2023-07-21 21:44:18 +02:00
### Rounds
Which rounds would this task be applicable?
Choose the corresponding *round* label(s) for this issue on the right.
2023-07-21 21:29:27 +02:00
- type: markdown
attributes:
2023-07-21 21:33:49 +02:00
value: |
2023-07-21 21:44:18 +02:00
### Difficulty
How would you rate the difficulty of this task? Relative to the highest round you selected.
Choose the corresponding *difficulty* label for this issue on the right.
2023-07-21 21:29:27 +02:00
- type: textarea
id: solution
attributes:
label: Solution
description: Solution idea or possible approaches. You don't need to have a full solution to propose a task, but please write down a few thoughts about how you would approach the task.
validations:
required: true
2023-07-24 00:00:56 +02:00
- type: input
id: spoiler-end
attributes:
label: "---"
description: "No change is required: Closing the spoiler tag"
2023-07-24 00:00:56 +02:00
placeholder: </details>
value: </details>