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

Before contest

Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)

08:19:26

Register now »

Codeforces Round #749 (Div. 1 + Div. 2, based on Technocup 2022 Elimination Round 1)

08:19:26

Register now »

*has extra registration

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

1 | tourist | 3707 |

2 | Benq | 3672 |

3 | Radewoosh | 3627 |

4 | ksun48 | 3547 |

5 | Miracle03 | 3480 |

6 | maroonrk | 3463 |

7 | ecnerwala | 3400 |

8 | peehs_moorhsum | 3384 |

9 | sunset | 3338 |

10 | Um_nik | 3303 |

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

1 | 1-gon | 209 |

2 | Um_nik | 197 |

3 | YouKn0wWho | 192 |

4 | Errichto | 183 |

5 | sus | 181 |

5 | awoo | 181 |

7 | tourist | 175 |

8 | SecondThread | 172 |

9 | -is-this-fft- | 171 |

10 | Radewoosh | 170 |

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-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/17/2021 05:45:35 (h3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|