[BZOJ4722]由乃 结论+线段树

大神博客说的很好：http://blog.csdn.net/werkeytom_ftd/article/details/54429577

细节不多注意一下就好

#include 
#include 
#include 

#define mid ( (l + r) >> 1 )
#define ls l,mid,t<<1
#define rs mid+1,r,t<<1^1

#define N 100050
#define LOG 20

using namespace std;

int ag[4*N],a[N],F[10*N],g[1050][LOG+5],tme,ans,n,m,v;

void push_down(int t) {
	ag[t<<1] += ag[t]; ag[t<<1^1] += ag[t]; ag[t] = 0;
}

int trans(int x,int y) {
	for (int i=LOG;i>=0;i--)
		if (y-(1<= 0)
			x = g[x][i] , y -= (1< rr || r < ll) return ;
	if (l >= ll && r <= rr) {ag[t] ++; return ;}
	push_down(t); update(ls); update(rs);
}

int x;
void query(int l,int r,int t) {
	if (l > x || r < x) return ;
	if (l == r) { a[l] = trans(a[l],ag[t]); ag[t] = 0; return ; }
	push_down(t); query(ls); query(rs);
}

int dest;
void dfs1(int x,int y,int tot) {
	if (x >= dest) {
		if (tot == 0) return ;
		if (y == 0) ans = 1;
		F[y] = y >= 0 ? tme : F[y];
		return ;
	}
	for (int _=-1;_<=1 && !ans;_++)
		dfs1(x+1,y+_*(a[x]+1),tot+(int)abs((double)_));
}

void dfs2(int x,int y,int tot) {
	if (x >= dest) {
		if (tot == 0) return ;
		if (y == 0) ans = 1;
		if (y >= 0 && F[y] == tme) ans = 1;
		if (y < 0 && F[-y] == tme) ans = 1;
		return ;
	}
	for (int _=-1;_<=1 && !ans;_++) 
		 dfs2(x+1,y+_*(a[x]+1),tot+(int)abs((double)_));
}

void ask() {
	scanf("%d%d",&ll,&rr);
	if (rr - ll >= 14) { puts("Yuno"); return ; }
	for (int _=ll;_<=rr;_++) x = _ , query(1,n,1);
	ans=0; ++tme; 
	dest = (ll+rr)/2 + 1;
	dfs1(ll,0,0); 
	dest = rr+1;
	if ((ll+rr)/2+1 < dest) dfs2((ll+rr)/2+1,0,0);
	if (ans) puts("Yuno"); else puts("Yuki");
}

void modify() {
	scanf("%d%d",&ll,&rr);
	update(1,n,1);
}

void pre() {
	for (int _=0;_