oj.uz

Submission #978105

# Submission time Handle Problem Language Result Execution time Memory
978105 2024-05-08T19:20:43 Z shadow_sami Spring cleaning (CEOI20_cleaning) C++17
28 / 100
 1000 ms 12632 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];
bool mark[mx];
ll tnc[mx];

void dfs(ll u,ll par){
	to[u] = par;
	if(adj[u].size()==1)
		mark[u] = 1;
	fx(adj[u])
		if(x!=par)
			dfs(x,u);				
	return;		
}

void ad(ll k){
	if(k==-1)
		return;	
	if(mark[k])
		tnc[k]++;
	dp[k] ^= 1;	
	if(dp[k])cnt++;
	else	cnt--;	
	ad(to[k]);
	return;
}

void remov(ll k){
	if(k==-1)
		return;		
	if(dp[k])cnt--;
	else	cnt++;
	dp[k] ^= 1;	
	if(mark[k])
		tnc[k]--;
	remov(to[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;
        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;  
        // tptp = 1; 
        // debug(tptp);     	
        dfs(tptp,-1);
        // fip(1,n+1)
        // 	cout<<to[i]<<" ";
        // cout<<nli;
        fip(1,n+1)
        	if(mark[i]){
        		tp = i;        		
        		while(tp!=-1){          			
        			dp[tp] ^= 1;
        			tp = to[tp];
        		}   
        	}
        cnt = 0;
        // debug(tptp);
        fip(1,n+1)	
        	cnt+=dp[i];   
        // fip(1,n+1)	
        // 	cout<<dp[i]<<" ";
        // cout<<nli;
        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);
        	}
        	// fip(1,n+1)	
	        // 	cout<<dp[i]<<" ";
	        // cout<<nli;
        	if(dp[tptp])
        		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 2 ms 4956 KB Output is correct
2 Correct 26 ms 6608 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5720 KB Output is correct
2 Correct 7 ms 5724 KB Output is correct
3 Correct 17 ms 9168 KB Output is correct
4 Correct 29 ms 8660 KB Output is correct
5 Correct 23 ms 9676 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 770 ms 5976 KB Output is correct
2 Correct 777 ms 5980 KB Output is correct
3 Correct 409 ms 12628 KB Output is correct
4 Execution timed out 1040 ms 12624 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1020 ms 6244 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 8280 KB Output is correct
2 Correct 42 ms 9296 KB Output is correct
3 Correct 26 ms 7628 KB Output is correct
4 Correct 40 ms 9308 KB Output is correct
5 Correct 42 ms 9444 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 9276 KB Output is correct
2 Execution timed out 1035 ms 12632 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Correct 26 ms 6608 KB Output is correct
3 Correct 7 ms 5720 KB Output is correct
4 Correct 7 ms 5724 KB Output is correct
5 Correct 17 ms 9168 KB Output is correct
6 Correct 29 ms 8660 KB Output is correct
7 Correct 23 ms 9676 KB Output is correct
8 Correct 770 ms 5976 KB Output is correct
9 Correct 777 ms 5980 KB Output is correct
10 Correct 409 ms 12628 KB Output is correct
11 Execution timed out 1040 ms 12624 KB Time limit exceeded
12 Halted 0 ms 0 KB -