From IOI Wiki
Jump to: navigation, search

Public task: Architecture

General information

  • Type: Batch
  • Topic(s): Dynamic programming
  • Task: Optimise some property over all polyominoes that satisfy certain constraints
  • Solution: Dynamic programming with subtle optimisations to meet complexity requirements
  • Difficulty: Silver, Task 3/4 in a 4-hour contest

Task details

  • Task statement: English PDF, French PDF
  • Solution: Document missing!
  • Limits: 2 seconds, 32 MB (3.00GHz Intel Xeon CPU)
  • Evaluator: Simple diff

Full archive