The Question is -> https://codeforces.net/contest/2013/problem/D
My approach is as follows :
If someone could help me out it would be greatly appreciated.
My submission for ref -> https://codeforces.net/contest/2013/submission/297131396
Thanks!!
# | 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 |
The Question is -> https://codeforces.net/contest/2013/problem/D
My approach is as follows :
I simply binary search on the minimum possible max that can be achieved. Similarly, I binary search on the max possible min that can be achieved.
I had a gut feeling that obtaining the minimum possible max and the maximum possible min would not interfere with each other and so the answer would just be their difference.
But I just can't prove why.
If someone could help me out it would be greatly appreciated.
My submission for ref -> https://codeforces.net/contest/2013/submission/297131396
Thanks!!
This is the question. https://codeforces.net/contest/1974/problem/E
AC submission -> https://codeforces.net/contest/1974/submission/287177874
WA submission -> https://codeforces.net/contest/1974/submission/287176403
In both my submissions, i have the exact same approach, only diff being in 1 case i use the current dp state to update the next dp states(in the WA submission) and in the AC submission i use previous dp states to update current dp states.
Where am i going wrong?
*Edit -> Resolved
Problem Link -> https://codeforces.net/contest/776/problem/D
My submission -> https://codeforces.net/contest/776/submission/285238557
Its pretty obvious from my code what i am trying to do. My Question is that is the logic correct? Where am I going wrong?
I just take cases of whether the door is locked or not and accordingly I build the adj list for the corresponding switch combinations.
*Edit -> Resolved now.
Name |
---|