Description
Range Queries
Problems this week will all be related to range queries and the data structures used to compute them quickly (Prefix Arrays, Sparse Tables, Fenwick Trees, Segment Trees, etc.)
Problems:
- Easy (A-B)
- Medium (C-D)
- Hard (E)
CPSC 599.4:
I know I said I was switching to a point based system but today is a special occasion as I was unable to find a reasonable balance of problems Goal: Solve both easy problems (A and B) or 1 medium or hard problem (C, D, or, E)
Start & End Times
| Start Time | 2025-02-26 00:30 CET |
| End time | 2025-03-05 00:00 CET |
Problems
| Label | Problem |
|---|---|
| A | Pivot |
| B | Ding Dong Ditch |
| C | Pulling Their Weight |
| D | Turbo |
| E | Worst Weather Ever |
Scoring
Pass/Fail — Ranked
Explanation:
Each problem is pass/fail. Participants are ranked by the number of solved problems, breaking ties by penalty (sum of time + 20 minutes per wrong submission, for all solved problems). Time is rounded to minutes.
Standings
- Standings are shown without limitation.
Languages
Ada Algol 68 APL Bash C C# C++ COBOL Common Lisp Crystal D Dart Elixir Erlang F# Forth Fortran Go Haskell Java JavaScript (Node.js) JavaScript (SpiderMonkey) Julia Kotlin Lua Modula-2 Nim Objective-C OCaml Octave Odin Pascal Perl PHP Prolog Python 2 Python 3 Racket Ruby Rust Simula 67 Smalltalk SNOBOL Swift TypeScript Visual Basic Zig