oj.uz

Submission #558073

# Submission time Handle Problem Language Result Execution time Memory
558073 2022-05-06T16:55:06 Z status_coding Spring cleaning (CEOI20_cleaning) C++14
0 / 100
 1000 ms 9676 KB 
#include <bits/stdc++.h>

using namespace std;

int n,q,sz,root;
int cntEven;

int nrLeaf[100005];
int aux[100005];

int parV[100005];
vector<int> v[100005];

vector<int> upd;

void dfs(int p, int par)
{
    parV[p] = par;

    nrLeaf[p] = 0;

    for(int it : v[p])
    {
        if(it == par)
            continue;

        dfs(it, p);
        nrLeaf[p] += nrLeaf[it];
    }

    nrLeaf[p] += aux[p];

    if(!nrLeaf[p])
        nrLeaf[p] = 1;

    if(nrLeaf[p] % 2 == 0)
        cntEven++;
}

void solveBig(int k, vector<int> &upd)
{
    for(int it : upd)
        aux[it] ++;

    cntEven=0;
    dfs(root, 0);

    if(nrLeaf[root] % 2)
        cout<<"-1\n";
    else
        cout<<n+k-1 + cntEven-1<<'\n';

    for(int i=1; i<=n; i++)
        aux[i] = 0;

    cntEven=0;
    dfs(root, 0);
}

void add(int p)
{
    if((int)v[p].size() == 1)
        return;

    while(p)
    {
        nrLeaf[p]++;

        if(nrLeaf[p] % 2 == 0)
            cntEven++;
        else
            cntEven--;

        p = parV[p];
    }

}

void del(int p)
{
    if((int)v[p].size() == 1)
        return;

    while(p)
    {
        nrLeaf[p]--;

        if(nrLeaf[p] % 2 == 0)
            cntEven++;
        else
            cntEven--;

        p = parV[p];
    }
}

void solveSmall(int k, vector<int> &upd)
{
    for(int it : upd)
        add(it);

    if(nrLeaf[root] % 2)
        cout<<"-1\n";
    else
        cout<<n+k-1 + cntEven-1<<'\n';

    for(int it : upd)
        del(it);
}

int main()
{
    cin>>n>>q;
    //sz = sqrt((int)1e5);
    //sz=0;
    sz = 1e9;

    for(int i=1; i<n; i++)
    {
        int x, y;
        cin>>x>>y;

        v[x].push_back(y);
        v[y].push_back(x);
    }

    for(int i=1; i<=n; i++)
        if((int)v[i].size() >= 2)
            root = i;

    cntEven=0;
    dfs(root, 0);

    while(q)
    {
        q--;

        upd.clear();

        int k;
        cin>>k;

        for(int i=1; i<=k; i++)
        {
            int x;
            cin>>x;

            upd.push_back(x);
        }

        if(k >= sz)
            solveBig(k, upd);
        else
            solveSmall(k, upd);
    }
    return 0;
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Incorrect 52 ms 3504 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 5492 KB Output is correct
2 Incorrect 129 ms 5240 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 268 ms 7156 KB Output is correct
2 Execution timed out 1086 ms 9676 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Incorrect 52 ms 3504 KB Output isn't correct
3 Halted 0 ms 0 KB -