Submission #978766

#	Time	Username	Problem	Language	Result	Execution time	Memory
978766		shadow_sami	Spring cleaning (CEOI20_cleaning)	C++17	100 / 100	489 ms	26196 KiB

cleaning

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 1e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
vi adj[mx];
ll to[mx];
ll dp[mx];
ll sz[mx];
ll hld[mx];
ll id[mx];
ll up[mx];
bool mark[mx];
ll tnc[mx];
ll timer = 0;

typedef struct SEGMENT_TREE{
	vi arr,laz;
	ll range;
	void prop(ll ptr,ll l,ll r){
		if(laz[ptr]){
			arr[ptr] = (r-l+1) - arr[ptr];
			if(l!=r){
				laz[2*ptr] ^= laz[ptr];
				laz[2*ptr+1] ^= laz[ptr];
			}
			laz[ptr] = 0;
		}
		return;
	}
	void init(ll k){
		range = 4 * k;
		arr.resize(range);
		laz.resize(range);
		fip(0,range){
			arr[i] = 0;
			laz[i] = 0;
		}
		return;
	}
	void update(ll ptr,ll l,ll r,ll st,ll en){
		prop(ptr,l,r);
		if(l>en || r<st)
			return;
		if(l>=st && r<=en){
			laz[ptr] ^= 1;
			prop(ptr,l,r);
			return;
		}
		ll mid = l + (r-l) / 2;
		update(2*ptr,l,mid,st,en);
		update(2*ptr+1,mid+1,r,st,en);
		arr[ptr] = arr[2*ptr] + arr[2*ptr+1];
		return;
	}
	ll query(ll ptr,ll l,ll r,ll st,ll en){
		prop(ptr,l,r);
		if(l>en || r<st)
			return 0;
		if(l>=st && r<=en){						
			return arr[ptr];
		}
		ll mid = l + (r-l) / 2;
		return (query(2*ptr,l,mid,st,en)+query(2*ptr+1,mid+1,r,st,en));
	}
}SGT;
SGT sgt;

void dfs(ll u,ll par){
	to[u] = par;
	sz[u] = 1;
	if(adj[u].size()==1)
		mark[u] = 1;
	fx(adj[u])
		if(x!=par){			
			dfs(x,u);				
			sz[u] += sz[x];
		}
	ll pt = -1;
	ll pt2 = -1;
	fx(adj[u])
		if(x!=par)		
			if(sz[x] > pt){
				pt = sz[x];
				pt2 = x;
			}
	hld[u] = pt2;
	return;		
}

void dfs2(ll u,ll par,ll k){
	id[u] = timer++;
	up[u] = k;
	if(hld[u]!=-1)
		dfs2(hld[u],u,k);
	fx(adj[u])
		if(x!=par && hld[u]!=x){			
			dfs2(x,u,x);
		}
	return;
}

void ad(ll k){
	while(k!=-1){
		cnt -= sgt.query(1,0,n-1,id[up[k]],id[k]);		
		sgt.update(1,0,n-1,id[up[k]],id[k]);
		cnt += sgt.query(1,0,n-1,id[up[k]],id[k]);		
		k = to[up[k]];
	}
	return;
}

void remov(ll k){
	while(k!=-1){
		cnt -= sgt.query(1,0,n-1,id[up[k]],id[k]);
		sgt.update(1,0,n-1,id[up[k]],id[k]);
		cnt += sgt.query(1,0,n-1,id[up[k]],id[k]);
		k = to[up[k]];
	}
	return;
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        ll sr,de;
        sgt.init(n);
        fip(0,n-1){
        	cin>>sr>>de;
        	adj[sr].push_back(de);
        	adj[de].push_back(sr);
        }
        fip(1,n+1)
        	if((ll)adj[i].size()>1)
        		tptp = i;  
        dfs(tptp,-1);
        dfs2(tptp,-1,tptp);
        cnt = 0;
        fip(1,n+1)
        	if(mark[i]){
        		ad(i);
        	}
        fip(0,m){
        	cin>>tp;        	
        	vi v(tp);
        	fip(0,tp)cin>>v[i];
        	fx(v){
        		if(mark[x])
        			tnc[x]++;
        		if(mark[x] && tnc[x]>1)
        			ad(x);
        		else if(!mark[x])
        			ad(x);
        	}
        	res = sgt.query(1,0,n-1,id[tptp],id[tptp]);        	
        	if(res)
        		ans = -1;
        	else
        		ans = n + (n-cnt)+tp - 2;
        	cout<<ans<<nli;
        	fx(v){        		
        		if(mark[x] && tnc[x]>1)
        			remov(x);        		
        		else if(!mark[x])
        			remov(x);        		
        		if(mark[x])
        			tnc[x]--;        	
        	}
        }
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;        	
}

• Subtask 1: 0 / 0
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 16 / 16
• Subtask 5: 19 / 19
• Subtask 6: 17 / 17
• Subtask 7: 30 / 30