Google code jam 2019 Round 1C solution

→ Обратите внимание

*есть доп. регистрация

→ Лидеры (рейтинг)

→ Лидеры (вклад)

Всё →

→ Найти пользователя

→ Прямой эфир

Детальнее →

Google code jam 2019 Round 1C solution

Правка en9, от Storm_Stark, 2019-05-10 02:27:47

A: Robot programming problem:
Logic:
P R S
0 0 0 break;
0 0 1 +R break;
0 1 0 +P break;
0 1 1 +R (S removed as R will defeat S)
1 0 0 +S break;
1 0 1 +S (P removed as S will defeat P)
1 1 0 +P (R removed as P will defeat R)
1 1 1 impossible to defeat all,break
0 represent count that hand for jth column is zero
1 represent count that hand for jth column of not yet defeated players is not zero
Code:
https://shashankmishracoder.wordpress.com/2019/05/07/google-code-jam19-round-1c-robot-programming-strategy/
B: Power Ranger:
https://shashankmishracoder.wordpress.com/2019/05/07/google-code-jam19-round-1c-power-rangers/
feel free to ask any doubt about solution any optimisation or alternate solution will be appreciated.

google code jam, round 1c, interactive problem

Правки

Rev.	Кто	Когда	Δ	Комментарий
en9	Storm_Stark	2019-05-10 02:27:47	2
en8	Storm_Stark	2019-05-08 18:43:43	105
en7	Storm_Stark	2019-05-08 06:28:40	141
en6	Storm_Stark	2019-05-07 20:42:46	18
en5	Storm_Stark	2019-05-07 20:35:17	10	Reverted to en3
en4	Storm_Stark	2019-05-07 20:34:23	10
en3	Storm_Stark	2019-05-07 20:33:00	22
en2	Storm_Stark	2019-05-07 20:31:10	258
en1	Storm_Stark	2019-05-07 19:11:47	292	Initial revision (published)

Соревнования по программированию 2.0

Время на сервере: 26.11.2024 12:29:00 (k2).

Десктопная версия, переключиться на мобильную.

При поддержке