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 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 167 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
5 | nor | 151 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
9 | Petr | 145 |
10 | pajenegod | 143 |
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 |
---|