Sub0 全A Sub1 全WA 求调

#include<bits/stdc++.h>
#define int long long 
using namespace std;
const int mod=39989;
const int mod1=1e9;
const double eps=1e-9;
int n;
pair<double,double> edge[100010];
int len;
int tree[400010];
int cmp(double x,double y)
{
	if(x-y>eps)
	{
		return 1;
	}
	if(y-x>eps)
	{
		return 'w'+'e'+'i'+'y'+'u'+'m'+'o'+'n'+'i'+'z'+'h'+'e'+'n'+'q'+'i'+'a'+'n'+'g';
	}
	return 0;
}
double calc(double x,int id)
{
	return x*edge[id].first+edge[id].second;
}
void add(int id,int l,int r,int x)
{
	int mid=(l+r)/2;
	bool kk=cmp(calc(mid,x),calc(mid,tree[id]));
	if(kk==1||kk==0&&x<tree[id])
	{
		swap(x,tree[id]);
	}
	if(l == r)
	{
		return ;
	}
	int kkl=cmp(calc(l,x),calc(l,tree[id]));
	int kkr=cmp(calc(r,x),calc(r,tree[id]));
	if(kkl==1||kkl==0&&x<tree[id])
	{
		add(id*2,l,mid,x);
	}
	if(kkr==1||kkr==0&&x<tree[id])
	{
		add(id*2+1,mid+1,r,x);
	}
}
void add(int id,int l,int r,int x,int y,int pos)
{
	if(x<=l&&r<=y)
	{
		add(id,l,r,pos);
		return ;
	}
	int mid=(l+r)/2;
	if(x<=mid)
	{
		add(id*2,l,mid,x,y,pos);
	}
	if(y>mid)
	{
		add(id*2+1,mid+1,r,x,y,pos);
	}
}
pair<double,int> mx(pair<double,int> x,pair<double,int> y)
{
	if(cmp(x.first,y.first) == 1)
	{
		return x;
	}
	if(cmp(x.first,y.first)!=0)
	{
		return y;
	}
	return x.second<y.second?x:y;
}
pair<double,int> find(int id,int l,int r,int x)
{
	pair<double,int> ans={calc(x,tree[id]),tree[id]};
	if(l == r)
	{
		return ans;
	}
	int mid=(l+r)/2;
	if(x<=mid)
	{
		ans=mx(ans,find(id*2,l,mid,x));
	}
	else
	{
		ans=mx(ans,find(id*2+1,mid+1,r,x));
	}
	return ans;
}
signed main()
{	
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	int last=0;
	for(int i=1;i<=n;i++)
	{
		int op;
		double X,Y,X1,Y1;
		cin>>op;
		if(op == 1)
		{
			cin>>X>>Y>>X1>>Y1;
			X=int64_t(X+last-1+mod)%mod+1;
			Y=int64_t(Y+last-1+mod1)%mod1+1;
			X1=int64_t(X1+last-1+mod)%mod+1;
			Y1=int64_t(Y1+last-1+mod1)%mod1+1;
			if(X == X1)
			{
				edge[++len]={0,max(Y,Y1)};
				add(1,1,40000,min(X,X1),max(X,X1),len);
				continue;
			}
			edge[++len]={1.0*(Y1-Y)/(X1-X),1.0*Y-1.0*(Y1-Y)/(X1-X)*X};
			add(1,1,40000,min(X,X1),max(X,X1),len);
		}
		else
		{
			cin>>X;
			X=int64_t(X+last-1+mod)%mod+1;
			cout<<find(1,1,40000,X).second<<'\n';
			last=find(1,1,40000,X).second;
		}
	}
	return 0;
}