Hi, can anyone tell if there's a way to stress test solution to an interactive problem by running it over hundreds of test cases ?

Before contest

Divide by Zero 2021 and Codeforces Round #714 (Div. 2)

16:54:05

Register now »

Divide by Zero 2021 and Codeforces Round #714 (Div. 2)

16:54:05

Register now »

*has extra registration

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

1 | tourist | 3697 |

2 | Benq | 3583 |

3 | Petr | 3522 |

4 | ecnerwala | 3467 |

5 | Radewoosh | 3466 |

6 | maroonrk | 3369 |

7 | Um_nik | 3358 |

8 | jiangly | 3330 |

9 | Miracle03 | 3314 |

10 | scott_wu | 3313 |

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

1 | 1-gon | 213 |

2 | Errichto | 190 |

3 | rng_58 | 187 |

3 | awoo | 187 |

5 | SecondThread | 186 |

6 | Um_nik | 179 |

7 | Ashishgup | 177 |

8 | maroonrk | 173 |

8 | vovuh | 173 |

10 | antontrygubO_o | 172 |

Hi, I was trying to solve this problem from a coding test and came up with an O(n^4) solution which goes like first I will precompute the 2-D prefix sums of the entire grid and then for each cell naively Bruteforce for all possible solutions in n^2 operations, It would be great if you can share your insights/solutions for the problem. The contest is over 5 days back you can answer as late as you want until you are assured of this.

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Apr/11/2021 00:40:57 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|