oj.uz

Submission #669585

# Submission time Handle Problem Language Result Execution time Memory
669585 2022-12-06T19:28:29 Z dozer Spring cleaning (CEOI20_cleaning) C++14
34 / 100
 1000 ms 18876 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 200005


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];
    //cout<<node<<sp<<flag<<endl;
    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);
    }
    
    while(q--)
    {
        int d;
        cin>>d;
        ans = 0;
        vector<int> v(d, 0);
        for (int i = 0; i < d; i++)
        {
            int node;
            cin>>node;
            adj[n + i + 1].pb(node);
            adj[node].pb(n + i + 1);
            v[i] = node;
        }
        int flag = dfs(1, 0);
        ans -= val[1];
        if (flag) cout<<-1<<endl;
        else cout<<ans<<endl;
        
        for (int i = 0; i < d; i++)
        {
            int node = v[i];
            adj[node].pop_back();
            adj[n + i + 1].pop_back();
        }
    }
    
    
    cerr<<"time taken : "<<(float)clock() / CLOCKS_PER_SEC<<" seconds\n";
}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Execution timed out 1097 ms 6088 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 9240 KB Output is correct
2 Correct 18 ms 9348 KB Output is correct
3 Correct 30 ms 9796 KB Output is correct
4 Correct 52 ms 12228 KB Output is correct
5 Correct 61 ms 13376 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 9760 KB Output is correct
2 Correct 21 ms 9744 KB Output is correct
3 Correct 38 ms 15384 KB Output is correct
4 Correct 69 ms 18876 KB Output is correct
5 Correct 36 ms 15108 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 200 ms 6388 KB Output is correct
2 Correct 131 ms 6416 KB Output is correct
3 Correct 191 ms 6072 KB Output is correct
4 Correct 223 ms 6448 KB Output is correct
5 Correct 179 ms 6612 KB Output is correct
6 Correct 235 ms 6780 KB Output is correct

Subtask #5
0 / 19.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Execution timed out 1097 ms 6088 KB Time limit exceeded
3 Halted 0 ms 0 KB -