This problem appears now in the practice section without any further changes. I haven’t seen any correct solution yet. It is either an unsolveable or very hard problem currently. It could be updated so that persons with A_i = -1 see all previous votes. Then the greedy solutions would work.
I would like to see either its testcases (accepts incorrect solutions) and difficulty (>> 2000) be updated, or its description and testcases.
In either case I would love to know a solution of the current problem description, if anyone solved it correctly by now.
Have a nice day!