Starry

#include<bits/stdc++.h> using namespace std; using ll=long long; const ll inf = 1e18; template < typename T, auto op, auto e, typename F, auto mapping, auto composition, auto e1 > class segtree { int n; vector< T > v; vector< F > l

需要O2优化 #include<bits/stdc++.h> using namespace std; using ll=long long; vector<double> st[(int)1e3+9]; ll n,m,id[(int)1e5+9],fk,l[(int)1e5+9],r[(int)1e5+9]; double a[(int)1e5+9]; int main(){ ios::sync_with_stdio(false); cin.tie(0); cin>>n>>m;

#include<bits/stdc++.h> using namespace std; using ll=long long; const int maxn=1e5+9; double mx[maxn<<2]; ll ans[maxn<<2],n,m; ll query(int l,int r,int k,double ma){ if(mx[k]<=ma)return 0; if(l==r)return 1; else if(mx[k<<1

开O2才可以进1s #include<bits/stdc++.h> using namespace std; using ll=long long; int P; using i64 = long long; // assume -P <= x < 2P int norm(int x) { if (x < 0) { x += P; } if (x >= P) { x -=

把lamda函数换成模板函数可以降到C++17 #include<bits/stdc++.h> using namespace std; using ll=long long; template < typename T, auto op, T e, typename F, auto mapping, auto composition, F e1 > class segtree { int n; vector< T > v; vector< F > lazy;