This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <bits/stdc++.h> | |
| #include <atcoder/lazysegtree> | |
| using namespace std; | |
| using namespace atcoder; | |
| /******************************************************************************************* | |
| * For i<j, x in the i-th interval [Li,Ri], and y in the j-th interval [Lj,Rj] | |
| * the contribution of (x,y) to the answer is 1/(Ri-Li+1)*(1/(Rj-Lj+1)) if x>y and 0 if x<=y | |
| * Note that 1/(Ri-Li+1) only depends on i, and 1/(Rj-Lj+1) only depends on j | |
| * |