Submission #60283350

---

Source Code Expand

#include<bits/stdc++.h>
#include"atcoder/all"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a) a.begin(),a.end()
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll,ll> P;
const ll mod=998244353;
const ll inf=1ll<<61;
typedef modint998244353 mi;

struct S{
	ll sum=0;
	int len=1;
	int valid=0;
};

S op(S x,S y){
	if(y.len%2){
		return {-x.sum+y.sum,x.len+y.len,x.valid&y.valid};
	}
	else{
		return {x.sum+y.sum,x.len+y.len,x.valid&y.valid};
	}

}

S e(){
	return {0,0,1};
}

int main(){
	int n,q;cin>>n>>q;
	vector<S>init;
	rep(i,n)init.push_back({0,1,0});
	segtree<S,op,e>seg(init);

	rep(i,q){
		ll t,x,y,v;
		cin>>t>>x>>y>>v;
		x--;y--;
		if(t==0){
			seg.set(x,{v,1,1});
		}
		else{
			if(x==y){
				cout<<v<<endl;
			}
			else{
				S interval=seg.prod(min(x,y),max(x,y));
				if(interval.valid){
					if(interval.len%2)cout<<interval.sum-v<<endl;
					else if(x<y)cout<<v+interval.sum<<endl;
					else cout<<v-interval.sum<<endl;
				}
				else{
					cout<<"Ambiguous"<<endl;
				}
			}
		}
	}
}

Submission Info

Judge Result