ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

Обсуждение задачи 1549. Японский пазл

Is the answer of second sample impossible?
Послано Beqa Lomitashvili [Freeuni] 24 окт 2013 23:14
49 3
I mean, FRRR or FLLL or FLFLLF could return us to the base,
it also doesn't violate any of two rules:
1. The total number of letters F must not exceed S and 2. the total number of letters L and R must not exceed T

are there any more restrictions???
Re: Is the answer of second sample impossible?
Послано 👨🏻‍💻 Spatarel Dan Constantin 6 сен 2019 00:05
The problem asks: "What is the longest closed path that you can assemble?"

Your examples are not closed loops. The first and last squares, although they are neighbours, they don't match their path endings.