Comments (4)
ごめんなさい、悪いです。 どうもありがとう。
I got AC now. As for the machine translate generated above, I do not actually know Japanese other than the meaning of the Kanji, but AtCoder did inspire me to more seriously learn it. xD
私は実際に日本人とあまり話したことはありませんが、そのうち話すようになるかもしれません。
from library-checker-problems.
On your implementation
I think Your implementation in atcoder/ac-library#175 is just wrong, and it is not a bug of AtCoder Library.
As writtern in the document of lazy segtree of ACL: https://github.com/atcoder/ac-library/blob/master/document_en/lazysegtree.md
I think the correct implementation looks like:
struct T {
lint count, sum;
};
T op(T a, T b) { return {a.count + b.count, a.sum + b.sum}; }
T e() { return {0, 0}; }
T mapping(lint f, T x) { return {x.count, x.sum + f * x.count}; }
lint composition(lint f, lint g) { return f + g; }
We need to add
By keeping both count and sum, we can get the result.
from library-checker-problems.
On the problem proposal
We can verify the lazysegtree implementation by the following problem.
https://judge.yosupo.jp/problem/range_affine_range_sum
Furthermore, range add operation is a special case of range affine operation (
So I think we don't need a new problem.
However, we could consider adding it if there are new algorithms that need verification and cannot be tested in the existing problem.
If some hack cases are required, it should be added to range_affine_range_sum.
from library-checker-problems.
@guoyiz23 can you delete my commit in telegramdesktop/tdesktop#26626 (comment) lot guys add my qq account ,is my bad.
from library-checker-problems.
Related Issues (20)
- [テストケース案] Counting Primes HOT 6
- [問題案] composition of formal power series (Large), compositional_inverse_of_formal_power_series (Large) HOT 1
- [Problem proposal] Sum of Multiplicative Function HOT 6
- License file is broken
- [Problem proposal] Vertex Add Range Contour Max on Tree HOT 2
- [テストケース案] Matching on Bipartite Graph HOT 2
- テストケース追加(convolution mod 2^64)
- [機能案] library checker の双対 HOT 2
- [問題案] Point Set Tree Path Rooted Composite Sum HOT 4
- テストケース Range Chmin Chmax Add Range Sum HOT 3
- [問題案] Point Set Tree Path Composite Sum HOT 2
- 問題案:2変数 FPS operations HOT 2
- [Problem proposal] counting non-decreasing path between two sequence with certain transition polynomial HOT 3
- [テストケース案] 定数項が 0 : Power Projection of Set Power Series
- Actions: All generate test failed HOT 3
- [テストケース] matrix pow / characteristic polynomial
- [テストケース] zeros : Polynomial Interpolation
- generate.py の `|` による Union の是非 HOT 1
- [Problem proposal] All Farthest Neighbors in Convex Polygons HOT 6
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from library-checker-problems.