While trying to solve this, I made 2 submissions with only difference in using Array<Array<Int>> instead of Array<IntArray>.

1. IntArray got AC in 546 ms
2. Array got TLE with more then 3 sec

Can anyone please explain reason for this?

Problem B of previous Div 2 (711), 2 almost same code gives different verdicts, TreeSet gives TLE, while Mutatable List got Accepted.

1. Using TreeSet: TreeSet using frequency array gives TLE, even though treeset has Log(n) removal time.

2. Using MutableList: Gets AC even with linear removal time.

I'm not sure what am I missing.

I don't know if there's a better way to get the python submissions for a contest, but for this I wrote a small python utility that returns a set() of handles of member who submitted a particular problem in python.

import requests
import json
url = 'https://mirror.codeforces.com/api/contest.status?contestId=1453&from=1&count=15419'
r=requests.get(url=url)
data=r.json()
s=set()
for i in data:
    for j in data['result']:
        if((j['problem']['index']=='D' and j['verdict']=='OK' and (j['programmingLanguage']=='Python 3' or j['programmingLanguage']=='PyPy 3')) or (j['problem']['index']=='E' and j['verdict']=='OK' and (j['programmingLanguage']=='Python 3' or j['programmingLanguage']=='PyPy 3'))):
            s.add(j['author']['members'][0]['handle'])
print(s)