oj.uz

Submission #878153

# Submission time Handle Problem Language Result Execution time Memory
878153 2023-11-24T06:14:08 Z Alish Spring cleaning (CEOI20_cleaning) C++17
26 / 100
 479 ms 22868 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;


#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl;
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);


ll mod = 1e9+7 ;


const int N = 1e5+23;

vector<int> g[N];
int par[N], head[N], h[N], sz[N], bi[N], pos[N]; // hld
int seg[4*N], lpz[4*N], st[N], ft[N], tim;//segment
int n, q;
int is[N];

void DFS(int v, int p=0){
    int Mx=0;
    sz[v]=1;
    for (int u: g[v]){
        if(u==p) continue;
        h[u]=h[v]+1;
        par[u]=v;
        DFS(u, v);
        if(sz[u]>Mx){
            bi[v]=u;
            Mx=sz[u];
        }
        sz[v]+=sz[u];
        is[v]+=is[u];
    }
}

void dfs(int v, int p=0){
    st[v]=tim;
    pos[st[v]]=v;
    tim++;
    if(!p) head[v]=v;
    if(bi[v]){
        head[bi[v]]=head[v];
        dfs(bi[v], v);
    }
    for (int u: g[v]){
        if(u==p || u==bi[v]) continue;
        head[u]=u;
        dfs(u, v);
    }
    ft[v]=tim;
}

void Shift(int l, int r, int ind){
    if(r-l==1) return;
    if(!lpz[ind]) return ;
    int mid=(r+l)>>1;
    seg[2*ind+1]=mid-l-seg[2*ind+1];
    seg[2*ind+2]=r-mid-seg[2*ind+2];
    lpz[2*ind+1]^=1;
    lpz[2*ind+2]^=1;
    lpz[ind]=0;
}
void build(int l=0, int r=n, int ind=0){
    if(r-l==1){
        seg[ind]=1-is[pos[l]]&1;
        return;
    }
    int mid=(r+l)>>1;
    build(l, mid, 2*ind+1); build(mid, r, 2*ind+2);
    seg[ind]=seg[2*ind+1]+seg[2*ind+2];
}

void upd(int lx, int rx, int l=0, int r=n, int ind=0){
    Shift(l, r, ind);
    if(lx>=r || rx<=l) return;
    if(lx<=l && rx>=r){
        seg[ind]=r-l-seg[ind];
        lpz[ind]^=1;
        return;
    }
    int mid=(r+l)>>1;
    upd(lx, rx, l, mid, 2*ind+1); upd(lx, rx, mid, r, 2*ind+2);
    seg[ind]=seg[2*ind+1]+seg[2*ind+2];
}

void updd(int v, int u){
    while(head[u]!=head[v]){
        if(h[head[u]] < h[head[v]]) swap(u, v);
        upd(st[head[u]], st[u]+1);
        u=par[head[u]];
    }
    if(st[v]>st[u]) swap(u, v);
    upd(st[v], st[u]+1);
}


int main()
{
    fast_io
    cin>>n>>q;
    for (int i=0; i<n-1; i++){
        int u, v; cin>>v>>u;
        g[v].pb(u); g[u].pb(v);
    }
    int r=0;
    int leaf=0;
    for (int i=1; i<=n; i++){
        if(g[i].size()==1) {leaf++; is[i]=1; }
        else r=i;
    }
    DFS(r); dfs(r);
    build();
    while(q--){
        vector<int> d;
        int k; cin>>k;
        for (int i=0; i<k; i++) {
            int p; cin>>p;
            d.pb(p);
        }
        leaf+=k;
        for (auto pp: d) if(g[pp].size()==1) {leaf--; updd(r, pp);}
        for (auto pp: d) updd(r, pp);
        if(leaf&1)cout<<-1<<endl;

        else cout<<n+k-1+seg[0]-1<<endl;
        leaf-=k;
        for (auto pp: d) if(g[pp].size()==1) {leaf++; updd(r, pp);}
        for (auto pp: d) updd(r, pp);
    }
}

Compilation message

cleaning.cpp: In function 'void build(int, int, int)':
cleaning.cpp:78:19: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   78 |         seg[ind]=1-is[pos[l]]&1;
      |                  ~^~~~~~~~~~~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Incorrect 242 ms 10048 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 88 ms 9956 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 10464 KB Output is correct
2 Correct 44 ms 10976 KB Output is correct
3 Correct 48 ms 22868 KB Output is correct
4 Correct 107 ms 22736 KB Output is correct
5 Correct 29 ms 21596 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 147 ms 10832 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 300 ms 11780 KB Output is correct
2 Incorrect 479 ms 11608 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 369 ms 13008 KB Output is correct
2 Correct 171 ms 16980 KB Output is correct
3 Correct 184 ms 17588 KB Output is correct
4 Correct 164 ms 18152 KB Output is correct

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 9052 KB Output is correct
2 Incorrect 242 ms 10048 KB Output isn't correct
3 Halted 0 ms 0 KB -