Lisan al Gaib | MatCom Online Grader

The 2024 ICPC Caribbean Finals (Qualifier) - Real Contest

Ended

Overview
Problems
Standing
Submissions
Submit
Clarifications
Virtual participation

Register

Are you sure you want to participate in this contest ? If you select a team then virtual participation for other team members will be disabled. So, pick one if and only if your teammates are ready to compete with you.

L - Lisan al Gaib

Languages: C, C++, Java, Python, Kotlin

Time & Memory limits: (details)

<div style="text-align: justify">
Today Axel is in a hot and dusty desert wearing weird cosplay with some tubes in his nose. Due to some misunderstandings in the past, blue-eyed people started calling him *Lisan al Gaib*, and he doesn't want to be part of their water fanatics group. These people decided to put Axel through a tough test that he can pass only if he is the savior they believe him to be.

The test is a game consisting of $n$ piles of stones laid out in a row, with positions numbered $1$ through $n$ from left to right, the $i$-th of them having $a_i$ stones. Two players (Axel and his tester) alternate turns. Axel will have the first turn.

Each turn, the current player has two possible moves:
1. Choose a non-empty pile $i$ $(2 \leq i \leq n)$ and move $c\ (0 < c \leq a_i)$ stones from this pile to the top of pile $i-1$.
2. Choose two non-empty piles $i, j$ $(2 \leq i < j \leq n)$. Combine the stones from piles $i$ and $i-1$ into one pile. This eliminates pile $i$ from the row. Then, take zero or more stones (you can take them all) from pile $j$ and place them directly to the right, creating a new pile between piles $j$ and $j+1$ (in case that pile $j+1$ exists). After the move, all piles are renumbered from left to right to restore the usual range ($1$ to $n$).

**The player with no possible moves is the winner**. Sadly, Axel promised himself that he will never lose a game he can win, and of course, his tester won't make it easy for him. So you can assume both players will play optimally. As a *bene gesserit* descendant and the real *Lisan al Gaib*, you want to know beforehand who will win.

Note that after each turn, the sum of the stones in the piles remains the same, and the number of piles doesn't change either. It can be proven that this game must end.
</div>

Input

Output

Sample test(s)

Input

2 3 4

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

Lisan al Gaib

--- Showing first 30 lines (click "Copy" to get full content) ---

Input

4 1 2 2 2

--- Showing first 30 lines (click "Copy" to get full content) ---

Output

It's just Axel

--- Showing first 30 lines (click "Copy" to get full content) ---

Matcom Online Grader

The 2024 ICPC Caribbean Finals (Qualifier) - Real Contest

Ended

L - Lisan al Gaib

Languages: C, C++, Java, Python, Kotlin

Time & Memory limits: (details)

Input

Output

Sample test(s)

Notes