Hello dreamoon_love_AA. Its been long time i didn't post anything. So posting this. Petr hello 300iq hello

# | User | Rating |
---|---|---|

1 | tourist | 3735 |

2 | MiFaFaOvO | 3681 |

3 | Um_nik | 3553 |

4 | Benq | 3376 |

5 | ecnerwala | 3295 |

6 | maroonrk | 3229 |

7 | TLE | 3223 |

8 | Radewoosh | 3216 |

9 | scott_wu | 3209 |

10 | Petr | 3205 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 203 |

2 | antontrygubO_o | 191 |

3 | pikmike | 187 |

4 | Monogon | 185 |

5 | vovuh | 184 |

6 | Ashishgup | 182 |

7 | Um_nik | 180 |

8 | SecondThread | 173 |

9 | Radewoosh | 172 |

10 | McDic | 162 |

**What happened to Legend Petr Mitrichev. Why he is not doing screencast of contests he gives. I really loved his SC's.** **It was very motivating.**

Why such strange behaviour while outputting the difference in sizes of two queues. When i am storing them in a diff variable its showing right answer, while just outputting the difference gives wrong answer.

```
#include<bits/stdc++.h>
using namespace std;
int main()
{
priority_queue<int , vector<int> , greater<int> > pmin;
priority_queue<int , vector<int> >pmax;
pmin.push(5);
pmin.push(9);
pmin.push(10);
pmax.push(1);
cout << pmax.size() - pmin.size() << endl;
int diff = pmax.size() - pmin.size();
cout << diff <<endl;
return 0 ;
}
```

**** **TO DV : Since downvotes doesn't affects me, but I think this is a very good question whom most of have no idea about the flaw in this. So it would be good if some good answers known to other people.**

the first solution which gets ac , also recur for all the four case , and my 2nd solution also recur for all four cases .

But why i am getting tle at TC 6 , is there something i am missing , or something which is increasing the time complexity of 2nd sol.

someone please tell the mistake .

In problem Equivalent string , I am using Divide and Conquer approach to solve.

I am checking all four cases , left_left , right_right , left_right , right_left

by the code is giving time limit exeeded . Since we are not making more than log n divisions , why it is giving TLE and how to optimize it . Can anyone tell me . Thanks

```
bool lefleft = solve(i1 , i1 + mid -1 , i2 , i2 + mid -1 ) ;
bool rightright = solve(i1 + mid , j1 , i2 + mid , j2 ) ;
bool leftright = solve(i1 , i1 + mid -1 , i2 + mid , j2 ) ;
bool rightleft = solve(i1+ mid , j1 , i2 , i2 + mid -1 ) ;
if(lefleft == true and rightright == true ) {
return true ;
}
if(leftright == true and rightleft == true ) {
return true ;
}
else return false ;
```

**In problem , symmetric grid , can anyone give the proof why the method given in the editorial works . how to perform all rows and column swapping operation .**

*Anyone .*

can someone guide me how to use topcoder arena for competitive programming. i wanna participate in toc. rounds but its arena is too tough to handle .

and how to view other solutions at topcoder? Please tell. help would be appreciated. Thanks!

suppose u have to find a % b , i see many red coders solution instead of using directly a%b they do like ..

if (a >=mod) a-=mod ??

why so ?

how to solve problem 27D .

Can anyone please help me in solving lizards and basement 2 ? link

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/10/2020 08:30:18 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|