rt，我开的 long long 类型，开到了 $n \sqrt n$。

// Problem: T320308 『STA - R2』机场修建
// Contest: Luogu
// URL: https://www.luogu.com.cn/problem/T320308?contestId=108450
// Memory Limit: 125 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include<bits/stdc++.h>
#define ll unsigned long long
#define pb push_back
#define N 200005
#define S 450
using namespace std;
ll sta[N][S];
ll ans[N];
ll f[N];
ll add[S];
ll find(ll x){
	if(f[x]==x) return f[x];
	else return find(f[x]);
}
int main(){
	ll n,m,opt,x,y,z;
	cin>>n>>m;
	ll t=sqrt(n),len=t;
	if(t*len<n) t++;
	for(ll i=1;i<=n;i++) f[i]=i;
	for(ll i=1;i<=t;i++){
		ll lim=min(n,i*len);
		for(ll j=(i-1)*len+1;j<=lim;j++){
			sta[j][i]++;
		}
	}
	for(ll i=1;i<=m;i++){
		cin>>opt;
		if(opt==3){
			cin>>x;
			x=find(x);
			ll an=ans[x];
			for(ll j=1;j<=t;j++)an+=sta[x][j]*add[j];
			cout<<an<<endl;
		}
		else if(opt==1){
			cin>>x>>y;
			x=find(x);y=find(y);
			if(x==y) continue;f[x]=y;
			for(ll j=1;j<=t;j++) sta[y][j]+=sta[x][j];
			ans[y]+=ans[x];
		}
		else{
			cin>>x>>y>>z;
			ll a=(x-1)/len,lim=min((a+1)*len,n);
			for(ll j=a*len+1;j<=lim;j++){
				if(j>=x && j<=y){ll tmp=find(j);ans[tmp]+=z;}
			}
			ll b=(y-1)/len;
			for(ll j=a+2;j<=b;j++)add[j]+=z;
			if(a==b) continue;
			lim=min((b+1)*len,n);
			for(ll j=b*len+1;j<=lim;j++){
				if(j<=y && j>=x){ll tmp=find(j);ans[tmp]+=z;}
			}
		}
		
	}
}