This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#pragma GCC target("popcnt")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)
bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int N = 2e5 + 7, LOG=20;
vll graph[N];
ll ni[N],szl[N],pa[N],cn[N],szl2[N], ans=0,r=0,n,q,k;
void dfs(ll u,ll p=0){
szl[u]=0;
for(ll v:graph[u]){
if(v==p)continue;
ni[v]=ni[u]+1;
pa[v]=u;
dfs(v, u);
szl[u]+=szl[v];
}
if(sz(graph[u])==1){
szl[u]=1;
ans+=ni[u];
return;
}
assert(szl[u]>=1);
ans-=ni[u]*((szl[u]+1)/2-1)*2;
szl[u]=(szl[u]&1?1:2);
szl2[u]=szl[u];
}
void test_case(){
cin>>n>>q;
fo(i,n-1){
ll a,b;
cin>>a>>b;
cn[a]++;
cn[b]++;
graph[a].pb(b);
graph[b].pb(a);
}
fore(i,1,n+1)if(sz(graph[i])>1)r=i;
dfs(r);
while(q--){
cin>>k;
vll u(k);
ll ans2=ans;
fo(i,k){
cin>>u[i];
ans2+=ni[u[i]]+1;
ll v=u[i],x=1;
cn[u[i]]++;
if(cn[u[i]]==2){
ans2-=ni[u[i]];
continue;
}
while(v!=0){
szl2[v]+=x;
if(szl2[v]==3){
x=-1;
ans2-=2*ni[v];
szl2[v]=1;
}
if(szl2[v]==0){
x=0;
ans2+=ni[v]*2;
szl2[v]=2;
}
v=pa[v];
}
}
if(szl2[r]!=1){
cout<<ans2<<endl;
}else cout<<-1<<endl;
fo(i,k){
cn[u[i]]--;
ll v=u[i];
while(v!=0){
szl2[v]=szl[v];
v=pa[v];
}
}
}
}
int main(){cin.tie(0)->sync_with_stdio(0);
int t=1;
// cin >> t;
while(t--)test_case();
}
Compilation message (stderr)
cleaning.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
4 | #pragma GCC optimization ("O3")
|
cleaning.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
5 | #pragma GCC optimization ("unroll-loops")
|
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |