← All problemsSign in

Seats

There are N seats in a theatre, all of them in a single row. The seats are numbered from 1 to N. You are given two types of events: - 1 — A person arrives. Persons are numbered from 1 in order of their arrival. - 2 i — Person i leaves the theatre. A person arriving in the theatre chooses a seat according to the following algorithm: If the entire theatre is empty, the person will occupy sea

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start