oj.uz

Submission #978766

# Submission time Handle Problem Language Result Execution time Memory
978766 2024-05-09T16:02:57 Z shadow_sami Spring cleaning (CEOI20_cleaning) C++17
100 / 100
 489 ms 26196 KB 
#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 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8028 KB Output is correct
2 Correct 183 ms 11092 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 107 ms 9564 KB Output is correct
2 Correct 93 ms 9564 KB Output is correct
3 Correct 107 ms 19400 KB Output is correct
4 Correct 141 ms 17112 KB Output is correct
5 Correct 159 ms 20424 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 10076 KB Output is correct
2 Correct 65 ms 10072 KB Output is correct
3 Correct 48 ms 26196 KB Output is correct
4 Correct 142 ms 25940 KB Output is correct
5 Correct 33 ms 24660 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 11732 KB Output is correct
2 Correct 76 ms 10588 KB Output is correct
3 Correct 27 ms 10580 KB Output is correct
4 Correct 16 ms 10776 KB Output is correct
5 Correct 24 ms 11104 KB Output is correct
6 Correct 79 ms 11356 KB Output is correct

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 16796 KB Output is correct
2 Correct 446 ms 16700 KB Output is correct
3 Correct 341 ms 12824 KB Output is correct
4 Correct 489 ms 16624 KB Output is correct
5 Correct 452 ms 16780 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 419 ms 20796 KB Output is correct
2 Correct 197 ms 24180 KB Output is correct
3 Correct 234 ms 22708 KB Output is correct
4 Correct 222 ms 23036 KB Output is correct

Subtask #7
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8028 KB Output is correct
2 Correct 183 ms 11092 KB Output is correct
3 Correct 107 ms 9564 KB Output is correct
4 Correct 93 ms 9564 KB Output is correct
5 Correct 107 ms 19400 KB Output is correct
6 Correct 141 ms 17112 KB Output is correct
7 Correct 159 ms 20424 KB Output is correct
8 Correct 67 ms 10076 KB Output is correct
9 Correct 65 ms 10072 KB Output is correct
10 Correct 48 ms 26196 KB Output is correct
11 Correct 142 ms 25940 KB Output is correct
12 Correct 33 ms 24660 KB Output is correct
13 Correct 146 ms 11732 KB Output is correct
14 Correct 76 ms 10588 KB Output is correct
15 Correct 27 ms 10580 KB Output is correct
16 Correct 16 ms 10776 KB Output is correct
17 Correct 24 ms 11104 KB Output is correct
18 Correct 79 ms 11356 KB Output is correct
19 Correct 312 ms 16796 KB Output is correct
20 Correct 446 ms 16700 KB Output is correct
21 Correct 341 ms 12824 KB Output is correct
22 Correct 489 ms 16624 KB Output is correct
23 Correct 452 ms 16780 KB Output is correct
24 Correct 419 ms 20796 KB Output is correct
25 Correct 197 ms 24180 KB Output is correct
26 Correct 234 ms 22708 KB Output is correct
27 Correct 222 ms 23036 KB Output is correct
28 Correct 292 ms 15700 KB Output is correct
29 Correct 280 ms 23040 KB Output is correct
30 Correct 163 ms 20436 KB Output is correct
31 Correct 139 ms 25724 KB Output is correct
32 Correct 457 ms 16500 KB Output is correct
33 Correct 184 ms 20764 KB Output is correct
34 Correct 267 ms 22100 KB Output is correct
35 Correct 230 ms 22868 KB Output is correct