-
-
The following solutions gets the accepted verdict using Hopcroft-Karp while allowing multiple visits to the same node in the same iteration. This is a fundamental flaw and makes running time exponenti…
-
You are given an integer sequence a_0, a_1, ..., a_{N-1} in order. Process the following Q queries:
- `i, x`: set `a_i
ldct updated
4 months ago
-
## Problem
- https://judge.yosupo.jp/problem/composition_of_formal_power_series
- https://judge.yosupo.jp/problem/compositional_inverse_of_formal_power_series
## Constraint
- $2\leq N\leq 2^{…
-
同じ有理数を 2 回以上質問する場合があります。
3 -> 0 , 4 -> 0 の遷移の間違いが原因です。
https://github.com/NachiaVivias/cp-library/blob/4d814fc3c2ed6555719399d9a5be7e41add1cff5/Cpp/Include/nachia/math/rational-number-search.hpp…
-
built-in + vector
```cpp
#include
using namespace std;
const double PI = acos(-1);
int main() {
cin.tie(nullptr)->sync_with_stdio(false);
int n, m, t, bit, len;
cin >> n >> m;
wh…
-
問題名: Primarity Test
## 問題
$Q$ クエリ
整数 $N$ が与えられるので、素数なら `YES`、そうでないなら `NO` と出力
## 制約
$1 \leq Q \leq 100,000$
$1 \leq N \leq 10^{18}$
-
reported in discord https://discord.com/channels/1087310259447681114/1098365529217061014/1208898310321086574
-
Problem name: Vertex Add Range Contour Max on Tree
## Problem
Given a tree with N vertices, where the i-th edge connects vertices ui and vi. Value ai is written on the vertex i. Process the f…
-
Problem name: Range Add Range Sum
## Remarks
I found what appears to actually, as surprising as it may be, be a bug in the AtCoder `lazysegtree` library, for which I filed https://github.com/atc…