WA on #7 #10 #11 #12
求条

#include<bits/stdc++.h>
using namespace std;
#define int long long
map<long long,long long>mp,mp1;
const int N=100001;
long long a[N<<2],w[N],t[N],L[N],R[N];
long long maxx=0,x1=LONG_LONG_MAX,y=0,num=LONG_LONG_MAX;
signed main()
{
	//freopen(".in","r",stdin);
	//freopen(".out","w",stdout);
	ios::sync_with_stdio(0);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n;
	cin>>n;
	mp[0]=-1;
	for(int i=1;i<=n;i++)
	{
		cin>>t[i];
		if(t[i]==1)
		{
			cin>>L[i]>>R[i]>>w[i];
			mp[L[i]]=mp[L[i]-1]=mp[R[i]]=mp[R[i]+1]=-1;
		}
		else if(t[i]==2)
		{
			cin>>L[i]>>w[i];
			mp[L[i]-1]=mp[L[i]]=mp[L[i]+1]=-1;
		}
		else
		{
			cin>>L[i]>>w[i];
			mp[L[i]-1]=mp[L[i]]=mp[L[i]+1]=-1;
			a[0]^=w[i];
		}
	}
	int cnt=0;
	for(map<long long,long long>::iterator x=mp.begin();x!=mp.end();x++)
	{
		x->second=++cnt;
		mp1[cnt]=x->first;
	}
	for(int i=1;i<=n;i++)
	{
		if(t[i]==1)
		{
			a[mp[L[i]]]^=w[i];
			a[mp[R[i]+1]]^=w[i];
		}
		else if(t[i]==2)
		{
			a[mp[L[i]]]^=w[i];
			a[mp[L[i]+1]]^=w[i];
		}
		else
		{
			a[mp[L[i]]]^=w[i];
			a[mp[L[i]+1]]^=w[i];
		}
	}
	maxx=a[0];
	num=mp1[1]-1;
	for(int i=1;i<=cnt;i++)
	{
		a[i]^=a[i-1];
		if(maxx<a[i])
		{
			maxx=a[i];
			num=mp1[i];
		}
		else if(abs(mp1[i])<abs(num)||(abs(mp1[i])==abs(num)&&mp1[i]>0))
			num=mp1[i];
	}
	cout<<maxx<<" "<<num;
	return 0;
}