I tried to search sth, but no result found. I tried to search sth else, the same result, but I knew there are relevant blogs in CF. Here is an example:
Sorry for my bad English :)
# | User | Rating |
---|---|---|
1 | jiangly | 3976 |
2 | tourist | 3815 |
3 | jqdai0815 | 3682 |
4 | ksun48 | 3614 |
5 | orzdevinwang | 3526 |
6 | ecnerwala | 3514 |
7 | Benq | 3482 |
8 | hos.lyric | 3382 |
9 | gamegame | 3374 |
10 | heuristica | 3357 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | -is-this-fft- | 162 |
3 | Um_nik | 161 |
3 | atcoder_official | 161 |
5 | djm03178 | 157 |
5 | Dominater069 | 157 |
7 | adamant | 154 |
8 | luogu_official | 152 |
9 | awoo | 151 |
10 | TheScrasse | 148 |
I tried to search sth, but no result found. I tried to search sth else, the same result, but I knew there are relevant blogs in CF. Here is an example:
Sorry for my bad English :)
Hi;
can you help me with this problem?:
We have DAG with n vertices and m edges. We have q queries, each query has two integers v[i] and u[i], determine for each query that if there is a path starting at v[i] and finishing at u[i].
n, m, q <= 1e5
thanks, and sorry for my bad English. (:
Name |
---|