Sign in to watch this lesson
Algorithms - Foundations · 5:06
How a Judge Works and the Complexity Budget
The first lesson of the algorithms track: what an online judge does with your code (compile, run every hidden test under a time and memory limit, compare tokens, give a verdict) and how much work fits in a second. We read the right algorithm straight off the constraints, measure an all-pairs loop, a grid that blows the memory limit and a per-test reset trap on a Mac, and catch a wrong answer at seed 137 with a stress test.
You will learn
- Describe the judge pipeline (compile, run under limits, compare tokens) and what each verdict means
- Estimate whether an algorithm fits the time limit using a budget of about 10^8 simple steps per second
- Read the intended complexity family straight off the constraints, and check the memory limit the same way
- Build a stress test (brute force, random generator, diff loop) to find a counterexample for a wrong answer