출력

For each case, output a single line containing the starting times of task 1 through task n separated by a single space. Each starting time should specify the minute at which the task starts. The starting time of each task should be positive and less than 1000000. There may be many possible schedules, and any valid schedule will be accepted. If no valid schedule is possible, print Impossible. on a line instead.

실제 공식 사이트에서도 스폐셜 저지가 구현되어 있습니다.

problems.zip (압축 파일의 probD or task 폴더에 verifier cpp 코드가 있음.)