oj.uz

Submission #669580

# Submission time Handle Problem Language Result Execution time Memory
669580 2022-12-06T19:08:27 Z dozer Spring cleaning (CEOI20_cleaning) C++14
28 / 100
 1000 ms 13048 KB 
#include <bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define N 100005


vector<int> adj[N];
int val[N], par[N], deg[N];
int ans;

int dfs(int node, int root)
{
    int flag = 0;
    par[node] = root;
    for (auto i : adj[node])
    {
        if (i != root) flag ^= dfs(i, node);
    }
    if (adj[node].size() == 1) flag ^= 1;
    val[node] = flag;
    if (flag == 0) val[node] = 2;
    ans += val[node];
    return flag;
}

int32_t main()
{
    fastio();
    int n, q;
    cin>>n>>q;
    for (int i = 1; i < n; i++)
    {
        int u, v;
        cin>>u>>v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    int flag = dfs(1, 0);
    for (int i = 1; i <= n; i++)
        deg[i] = adj[i].size();
    ans -= val[1];
    //cout<<flag<<sp<<ans<<endl;
    while(q--)
    {
        int d;
        cin>>d;
        vector<int> v(d, 0);
        for (int i = 0; i < d; i++)
        {
            int node;
            cin>>node;
            if(deg[node] != 1)
            {
                flag ^= 1;
                int curr = node;
                while(curr != 1)
                {
                    ans -= val[curr];
                    val[curr] = 3 - val[curr];
                    ans += val[curr];
                    curr = par[curr];
                }
            }
            deg[node]++;
            v[i] = node;
        }
        
        if (flag) cout<<-1<<endl;
        else cout<<ans + d<<endl;
        
        for (auto node : v)
        {
            deg[node]--;
            if(deg[node] != 1)
            {
                flag ^= 1;
                int curr = node;
                while(curr != 1)
                {
                    ans -= val[curr];
                    val[curr] = 3 - val[curr];
                    ans += val[curr];
                    curr = par[curr];
                }
            }
        }
    }
    
    cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 22 ms 3512 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 3028 KB Output is correct
2 Correct 8 ms 3028 KB Output is correct
3 Correct 27 ms 7360 KB Output is correct
4 Correct 23 ms 6220 KB Output is correct
5 Correct 34 ms 7620 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 970 ms 3412 KB Output is correct
2 Correct 978 ms 3412 KB Output is correct
3 Correct 501 ms 13048 KB Output is correct
4 Execution timed out 1086 ms 12496 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 1087 ms 4052 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 5756 KB Output is correct
2 Correct 40 ms 5520 KB Output is correct
3 Correct 26 ms 4132 KB Output is correct
4 Correct 38 ms 5496 KB Output is correct
5 Correct 41 ms 5520 KB Output is correct

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 7516 KB Output is correct
2 Execution timed out 1091 ms 9192 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 Correct 22 ms 3512 KB Output is correct
3 Correct 8 ms 3028 KB Output is correct
4 Correct 8 ms 3028 KB Output is correct
5 Correct 27 ms 7360 KB Output is correct
6 Correct 23 ms 6220 KB Output is correct
7 Correct 34 ms 7620 KB Output is correct
8 Correct 970 ms 3412 KB Output is correct
9 Correct 978 ms 3412 KB Output is correct
10 Correct 501 ms 13048 KB Output is correct
11 Execution timed out 1086 ms 12496 KB Time limit exceeded
12 Halted 0 ms 0 KB -