Intellectual Olympiad in Informatics - 2026 ongoing

Subject: Informatics
Level: XII (I is easiest, XII is hardest)
Category: student
Question language: English
Questions: 15
Example question: A directed graph is given in adjacency-list form. Which algorithm computes single-source shortest paths in linear time when every edge has weight either 0 or 1? Dijkstra’s algorithm with an arbitrary priority queue, 0–1 BFS using a deque, Floyd–Warshall algorithm, Kruskal’s algorithm
Participants: 2