GP of Ekateinburg has just finished. Let's discuss problems here. How to solve H?
(Russian version of the post contains my anger about statements).
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
GP of Ekateinburg has just finished. Let's discuss problems here. How to solve H?
(Russian version of the post contains my anger about statements).
Name |
---|
Problem H: https://en.wikipedia.org/wiki/Schreier%E2%80%93Sims_algorithm
Well, is it allowed to use such tasks in contests? This task is just a copy of Schreier and Sims' idea and there is zero originality. I hope authors to come up with original tasks.
And problem I — I believe it's not a good idea to try to separate MCMF and Hungarian. Both are O(n^3).
MCMF worked 0.336 seconds in my case, not even close to TL (and I believe it can be still optimized a lot, by changing long long to int etc.).
Interesting fact: most of the people who had issues with MCMF fitting into the time limit never have issues with
long long
.Were they actually trying to separate them though? I passed with Dijkstra on Set in my Min Cost Flow. So it was even O(N^3logN).
OK maybe my implementation was bad — is O(E log E) dijkstra faster than O(V^2) in practice?
With set: 1.2s
V^2: 0.49s
MCMF with Ford-Bellman works 0.8
Non-deterministic?
where can see the problems?