Can someone please share their stress testing library?

I am looking for random tree, graph(connected/disconnected) generators and different type of array generators.

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 |

Can someone please share their stress testing library?

I am looking for random tree, graph(connected/disconnected) generators and different type of array generators.

I recently found out that inserting a `vector`

in a `map`

is possible :

```
map< vector<int>, int > mp;
vector<int> vec = {1,2,3,4,5};
mp[vec] = 5;
cout<<mp[vec];
// prints 5
```

- If there are
`N`

`vectors`

in mp present as keys already, what is the time complexity to insert a new`vector`

of size`M`

in`mp`

? Is it`O(M*log(N)`

or something else depending upon the sizes of vectors present in`mp`

already? - What would be the time complexity of a query operation such as
`mp[vec]`

? Please help.

By what factor is Kosaraju's algorithm for finding strongly connected component slower as compared to Tarjan's algorithm. It appears to me that the factor should be 3 as there are 2 dfs passes in Kosaraju's algorithm and we also have to transpose the graph once. Am I missing something ?

Also is there any way to find the tranpose graph without declaring a new graph and storing the edges in reverse order ? (Basically reversal of graph without use of extra memory)

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/11/2020 21:46:49 (i1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|