Universal Cup Judging System
Universal Cup
Osijek Competitive Programming Camp Winter 2024. Day 8. Borys Minaiev Contest
The contest is also known as:
| # | Problem |
|---|---|
| A | (A + B) mod P |
| B | The Best Wife |
| C | Cardinality |
| D | 3D |
| E | Equal Strings |
| F | Fast Tree Queries |
| G | Geo Sharding |
| H | Have You Seen This Subarray? |
| I | Interactive Casino |
| J | Jigsaw Puzzle |
| K | Knapsack |
| L | London Underground |
| M | Meta |
Notice
| Title | Content | Time |
|---|---|---|
| Regarding C | Please note that a TLE or RE verdict might be given for a WA submission. | 2025-01-26 04:18:59 |
Questions about problems
All Questions
| Asker | When | Questions |
|---|---|---|
| ucup-team087 | 2025-01-25 13:47:08 |
J: How is it judged if the pieces in output matchs the input? (i.e. precision when rotation)
回复：The checker tries to find the transformation (rotation + shift) of the answer piece to match the input piece and then checks that the Euclidean distance between corresponding points is not more than 10^-6.
|
| ucup-team087 | 2025-01-25 16:40:50 |
J: Please provide the number of test files.
回复：There are 65 test cases in problem J.
|
Contest Ended
Ruleset: ICPC
- Test full dataset
- Scoreboard available
- Penalty: 20 minute(s)
- Submission limit / problem: 1000
- Scoreboard will be frozen after 4:00:00
Virtual Contest
The virtual contest is in progress. You can start your participation.