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

Обсуждение задачи 1156. Два тура

Показать все сообщения Спрятать все сообщения


My programm passes all my tests, but WA#3.
Please, help.
Thanks a lot.
How you here have applied Dinamic Prog.? I the ambassador aside graph.
Hi, Taras.
I use simple method:
I read two variables ot and ku.
If ot and ku are in the same group, I Output('IMPOSSIBLE');
If they are in the different groups then I Continue
else I put one variable into the first group
and other into the second group.
After that I divide "free" tasks between the groups...
I hoped that It would get more than two tests...
May be I should try to use graphs...

BTW, tell me youre ICQ number, I cann't find you...

Edited by author 02.05.2006 13:17
try this test, maybe will help you:

4 6
1 2
2 3
3 4
4 5
6 7
7 8

ANS:
 1 3 5 7
 2 4 6 8
You can use it. I used it as well. First you must paint the graph with black and white (use BFS) so that two vertices with the same edge are of different colors. After that you have pairs of integers and you have to combine them so that you have N in each round (that's not always possible).
how I should combine them ??