2022 跳坑记录

//Said no more counting dollars. We'll be counting stars.
#include<bits/stdc++.h>
using namespace std;
#define For(i,j,k) for(int i=j;i<=k;i++)
#define Rof(i,j,k) for(int i=j;i>=k;i--)
#define N 100002
#define V 500002
#define C 20000002
#define ll long long
#define low (x&(-x))
char buf[1<<21],*p1,*p2;
#define gc() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
#define rg register
inline int read() {
  rg int x=0,f=1;
  rg char c=gc();
  while(c<'0'||c>'9'){if(c=='-')f=-1;c=gc();}
  while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=gc();}
  return x*f;
}
inline long long lread() {
  rg long long x=0,f=1;
  rg char c=gc();
  while(c<'0'||c>'9'){if(c=='-')f=-1;c=gc();}
  while(c>='0'&&c<='9'){x=(x<<3)+(x<<1)+(c^48);c=gc();}
  return x*f;
}
int n,m,g[N],lim=0;
ll c[N];
inline void add(int x,int y){
	while(x<=n){
		c[x]+=y;
		x+=low;
	}
}
inline ll que(int x){
	ll res=0;
	while(x){
		res+=c[x];
		x-=low;
	}
	return res;
}
struct node{int nxt,id;}e[N];
int head[V],tot=0,d[C],cnt[V],L[V],R[V],f[C];
inline int gf(int x){return (x^f[x])?f[x]=gf(f[x]):x;}
#define lb lower_bound
inline void work(int l,int r,int w){
	int i=gf(lb(d+L[w],d+R[w],l)-d),val; 
	while(d[i]<=r && i<R[w]){
		val=g[d[i]];
		if(val%w){
			f[i]=gf(i+1);
		}else{
			add(d[i],val/w-val);
			g[d[i]]=val/w;
		}
		i=gf(i+1);
	}
}
int main(){
	n=read();m=read();
	int x;
	For(i,1,n){
		g[i]=x=read();
		if(!x) continue;
		if(lim<x) lim=x;
		add(i,x);
		cnt[x]++;
		e[++tot]=(node){head[x],i};head[x]=tot;
	} 
	For(i,1,lim)
		for(int j=i;j<=lim;j+=i)
			L[i+1]+=cnt[j];
	For(i,2,lim) L[i]+=L[i-1];
	For(i,1,lim) R[i]=L[i];
	For(i,1,lim)
		for(int j=i;j<=lim;j+=i)
			for(int k=head[j];k;k=e[k].nxt)
				d[R[i]++]=e[k].id;
	For(i,1,lim) sort(d+L[i],d+R[i]);
	For(i,0,R[lim]) f[i]=i;
	int opt;
	ll lst=0,l,r,w;
	while(m--){
		opt=read();l=lread()^lst;r=lread()^lst; 
		if(opt==1){
			w=lread()^lst; 
			if(w==1) continue;
			work(l,r,w);
		}else{
			lst=que(r)-que(l-1);
			printf("%lld\n",lst);
		}
	}
return 0;}

//Said no more counting dollars. We'll be counting stars.
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")//DONT use rashly,I have suffered
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")//DONT use rashly,I have suffered
#include<bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define fir first
#define sec second
#define mkp make_pair
#define pb emplace_back
#define mem(x,y) memset(x,y,sizeof(x))
#define For(i,j,k) for(int i=j;i<=k;i++)
#define Rof(i,j,k) for(int i=j;i>=k;i--)
#define Fe(x,y) for(int x=head[y];x;x=e[x].nxt)
#define ckmx(a,b) a=max(a,b)
#define ckmn(a,b) a=min(a,b)
#define fin(s) freopen(s,"r",stdin)
#define fout(s) freopen(s,"w",stdout)
#define file(s) fin(s".in");fout(s".out")
#define cerr cerr<<'_'
#define debug cerr<<"Passed line #"<<__LINE__<<endl
template<typename T>T ov(T x){cerr<<"Value: "<<x<<endl;return x;}
#define ll long long
const ll mod=1000000007;
inline ll pw(ll x,ll y){ll r=1;while(y){if(y&1)r=r*x%mod;x=x*x%mod;y>>=1;}return r;}
inline void mad(ll &a,ll b){a=(a+b)%mod;while(a<0)a+=mod;}
inline void mmu(ll &a,ll b){a=a*b%mod;while(a<0)a+=mod;}
#define inv(a) pw(a,mod-2)
#define int long long
#define N 110
//405. 将他们分好队
int n,tot=1;
int f[N][N];
int cnt[2*N];
bool a[N][N],flag=1,out[2*N];
vector<int> e[N];
int col[N];
void dfs(int x,int y){
	col[x]=y;
	cnt[y]++;
	For(i,1,n) if(a[x][i] || a[i][x]){
		if(col[i]==y){
			flag=0;
			return ;
		}else if(!col[i]) dfs(i,y^1);
	}
}
signed main(){IOS;
	cin>>n;
	int x;
	For(i,1,n) For(j,1,n) a[i][j]=(i!=j);
	For(i,1,n){
		while(1){
			cin>>x;
			if(!x) break;
			a[i][x]=0;
		}
	} 
	For(i,1,n) if(!col[i]){
		tot+=2;
		dfs(i,tot);
		if(!flag){
			cout<<"No solution"<<endl;
			return 0;
		}
	}
	mem(f,-1);
	f[0][0]=0;
	for(int i=2;i<=tot;i+=2){
		Rof(j,n,0){
			if(j-cnt[i]>=0 && f[i/2-1][j-cnt[i]]>=0) f[i/2][j]=i;
			else if(j-cnt[i^1]>=0 && f[i/2-1][j-cnt[i^1]]>=0) f[i/2][j]=i^1;
		}
	}
	int ans=0;
	For(i,1,n) if(f[tot/2][i]>=0 && abs(n-2*i)<abs(n-2*ans)) ans=i;
	Rof(i,tot/2,1){
		out[f[i][ans]]=1;
		ans-=cnt[f[i][ans]];
	}
	For(i,1,n) if(out[col[i]]) ans++;
	cout<<ans;   For(i,1,n) if(out[col[i]])  cout<<" "<<i; cout<<endl;
	cout<<n-ans; For(i,1,n) if(!out[col[i]]) cout<<" "<<i; cout<<endl; 
return 0;}