-
UnionFind
データのグループ化を素早く行う
not sameな頂点をN-1回つなげるとN頂点の木になる
UnionFind + スタック芸
https://atcoder.jp/contests/acl1/submissions/18374339 A - Reachable Towns
グラフの問題になる
G の各辺に対して、端点のうちどちらかを光らせることができる。光る頂点の…
-
In [`8f68f4f`](https://github.com/xcpcio/codeforces.uptime/commit/8f68f4f308f4d2e3c6dc2065886b1869be7a55e1
), Polygon (https://polygon.codeforces.com) was **down**:
- HTTP code: 520
- Response time: 6…
-
**Article:** [Arbitrary-Precision Arithmetic](https://cp-algorithms.com/algebra/big-integer.html)
**Problem:**
Is using base 10^9 really better than using a base like 2^30? Seems like modulo and …
-
Hi!
I do coding on many platforms and I got TLE(time limit exceed) errors many times so I just want to know how can I reduce the time complexity of my python program.
-
I would like to add O(nlogn) implementation of Longest Increasing Subsequence in an array.
#### This issue is about [Algo/LongestIncreasingSubsequence] [C++] in nlogn
(http://codeforces.com/blog/en…
-
It would be more helpful if it display a notification icon, to draw attention, i think so.
ghost updated
8 years ago
-
現在は、大量のファイルを変更してしまったときや大量のファイルに依存されているファイルを変更してしまったとき、 `GITHUB_TOKEN` の timeout 問題 #51 のために途中で verify が打ち切られてしまう。空コミットをタイミングよく push するのは簡単に自動化できるとはいえ、あまり良くない。
選択肢はふたつ:
1. 再帰的にやる: `GH_PAT` を使えば再帰…
kmyk updated
3 months ago
-
### Description of feature request, idea
Many Hacktoberfest issues shown on the website were created in collection repos. Collection repos are repos where their only purpose is to get easy 4 PRs fo…
-
In [`5ca4124`](https://github.com/xcpcio/codeforces.uptime/commit/5ca4124f35d4666332cfc9e8a2bde929f794d030
), m2 (https://m2.codeforces.com) was **down**:
- HTTP code: 403
- Response time: 102 ms
-
In [`5683d31`](https://github.com/xcpcio/codeforces.uptime/commit/5683d312fe3e18f3f816252820d7081fbb6b571a
), Polygon (https://polygon.codeforces.com) was **down**:
- HTTP code: 403
- Response time: 4…