Hi Guys, my submission 77409380 for this 1181D - Irrigation is getting TLE'd. Can anyone help me in finding my mistake.

Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems.
×

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

1 | MiFaFaOvO | 3681 |

2 | tourist | 3669 |

3 | Um_nik | 3535 |

4 | 300iq | 3317 |

5 | ecnerwala | 3294 |

6 | maroonrk | 3268 |

7 | TLE | 3223 |

8 | scott_wu | 3209 |

9 | WZYYN | 3180 |

10 | boboniu | 3174 |

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

1 | Errichto | 197 |

2 | antontrygubO_o | 185 |

3 | pikmike | 183 |

4 | Ashishgup | 182 |

5 | vovuh | 179 |

6 | Radewoosh | 173 |

7 | SecondThread | 167 |

8 | Um_nik | 164 |

9 | Monogon | 163 |

10 | McDic | 162 |

Find a pair in an array with maximum bitwise OR? $$$1 \leq n \leq 1e6, 0 \leq a[i] \leq 1e6$$$

Can anyone help me with the solution or finding a blog somewhere.

Whomever are willing, comment their wannabe color and the time before they are gonna achieve it.

Note: Post the color you are actually practicing for past days. Please don't just spam red.

There are approximately 35 mid heroes in dota 2. You are given a matrix winprob[35][35], where winprob[i][j] denotes the probability of ith hero winning against jth hero in midlane (matrix is derived from previously played games).

Problem : What's the minimum cardinal subset of heroes (to learn) such that when the opponent picks a mid hero, we can always pick a hero from our subset and get the probability of winning atleast (60%).

I can only think of bruteforce. Is there any better algorithm?

Are Ladders still consistent with their corresponding ratings?

In this submission for the problem 31660028 the author used `if(ans[ni][nj] < ans[v.fi][v.se] + 1) break;`

condition. Can anyone guide me in proving that this algorithm with the break condition produces shortest paths and its complexity is O(n*m).

Problem Link: https://codeforces.com/problemset/problem/877/D

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/12/2020 06:41:11 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|