i spent a lot of time on this task and i am very happy that i did it, i recommend that you also try to solve it yourself to improve your optimization skills

I devised that maybe I need to solve many systems of equations.

I know the solution if the system has odd equations, but how do I solve the one with even equations?

For example: solve for ai, with ki = initial cups at knight i, and F as the final cups to be achieved.

a1 + a2 + k2 = F
a2 + a3 + k3 = F
a3 + a4 + k4 = F
a4 + a1 + k1 = F

I cannot solve this, even if I could I couldn't image myself programmatically solve it.

If the solution is different, please give me some advise. Thanks!

can you help me with some tests? I tried every tests in the discussions and they're fine, I also try my own tests with big number too.

to clarify, my understanding is that, 0 <= F <= 1000 right?

so in my solution i use o(N^3) space and i got mle ( i expected that) but what makes me confused that people says they passed wih o(n^3) time i know there is a different between memory and time complexity but i have some doubts they may also used o(n^3) space too
so can someone tell me whether they added a new cases or whats is the problem?

O(n*m*k) solution is AC. Rating 731 is too big. Very simple geometry task

Little bit boring, but anyway rating is too big

In the measurements it is written that when 1 response 1 2 3. But in the condition said "If there are several solutions, display, where a minimum. If such multiple, display, where the minimum of b and so on". So the correct answer should be 1 1 2.

(В промерах написано, что при 1 ответ 1 2 3. Но в условии сказано "Если решений несколько, вывести то, где a минимально. Если и таких несколько, вывести то, где минимально b и т.д". Поэтому правильный ответ должен быть 1 1 2.)

Edited by author 09.11.2014 17:33

In my solution, it was a bug with precision. So I fixed it, by using int instead of double, as much as it was possible

sys.setrecursionlimit(10**9) + python instead of PyPy

Test:

1 4
m
m a
a b
b c
c a

Output:
-1

How I can check the tests?

Use BFS, use bitset, use binsearch, use random shuffle and get easy AC!

The description of the problem says: "Your program must take into account the command \", which is used to write two dots above a vowel. For example, \"e means the symbol ë." But you don't really have to distinguish between vowels and consonants for this command.

Edited by author 26.08.2024 17:37

My program use iostream for reading data. Always when i use iostream i add this lines to turn off flushing after each line:

signed main(void) {
    cin.tie(nullptr)->sync_with_stdio(false);
    cout.tie(nullptr)->sync_with_stdio(false);
    // solution
    return 0;
}

But in this problem program with this lines getting WA#1, without - AC. Why?

Use Manaker's algorithm

I've got WA 5 cause I checked that distance less than d only in case where Gnusmas is not on the border of the arc.

So, if you have WA#5 be careful with case where Gnusmas is on the border of the arc of fire.

Один и тот же алгоритм и практически один и тот же код,  с учётом схожести синтаксиса языков,  даёт :

AC 15 ms C++14 Clang

TLE #9 Python  2.7/3.4