#include<bits/stdc++.h>
using namespace std;
#define debug cout<<"YES\n";
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<pii,int>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=201314;
const int maxn=1e5+100;
const int lz=0;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){if(y==0) return x;return gcd(y,x%y);}
vector<int> g[maxn];
///线段树
void Mod(int &x){x%=mod;}
struct segtree{
int sum[maxn<<2],lazy[maxn<<2];
void init(){
mst(sum,0),mst(lazy
P4211 [LNOI2014]LCA (树链剖分+思维)
最新推荐文章于 2024-01-26 20:14:48 发布