oj.uz

Submission #888289

# Submission time Handle Problem Language Result Execution time Memory
888289 2023-12-16T21:04:59 Z SzypkiBill Spring cleaning (CEOI20_cleaning) C++17
0 / 100
 1000 ms 13648 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vii vector<pii>
#define siz(x) (int)x.size()
#define pb push_back
#define rep(i,x) for(int i=0; i<x; i++)
#define rep1(i,x) for(int i=1; i<=x; i++)
using namespace std;
const int inf = 1e9, maxn = 1e5+5, mod = 1e9+7;
int n,q,ileparzystych,ilelisci;

int liscie[maxn];
bool parzyste[maxn];
int parent[maxn];
vi graf[maxn];

void DFS(int v, int p){
    parent[v] = p;
    if(siz(graf[v])==1){liscie[v] = 1;ilelisci++;}
    for(auto u:graf[v])if(u!=p){
        DFS(u,v);
        liscie[v]+=liscie[u];
    }
    parzyste[v] = !(liscie[v]%2);
    if(parzyste[v] && v!=1)ileparzystych++;
}

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>q;
    rep(i,n-1){
        int a,b;
        cin>>a>>b;
        graf[a].pb(b);
        graf[b].pb(a);
    }
    DFS(1,0);

    rep(i,q){
        int d;
        cin>>d;
        vi a(d);
        int dojeden = 0;
        rep(j,d){
            cin>>a[j];
            int x = a[j];
            if(siz(graf[x]) > 1)ilelisci++;
            if(x==1){
                dojeden++;
                continue;
            }
            if(siz(graf[x]) > 1)
            while(x>1){
                parzyste[x] = !parzyste[x];
                if(parzyste[x])ileparzystych++;
                else ileparzystych--;
                x = parent[x];
            }
        }
        if((ilelisci)&1)cout<<-1<<'\n';
        else cout<<n-1+d+ileparzystych<<'\n';
        rep(j,d){
            int x = a[j];
            if(siz(graf[x]) > 1)ilelisci--;
            if(x==1){
                dojeden--;
                continue;
            }
            if(siz(graf[x]) > 1)
            while(x>1){
                parzyste[x] = !parzyste[x];
                if(parzyste[x])ileparzystych++;
                else ileparzystych--;
                x = parent[x];
            }
        }
    }

}

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 19 ms 3964 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 745 ms 3932 KB Output is correct
2 Correct 744 ms 3932 KB Output is correct
3 Correct 389 ms 13648 KB Output is correct
4 Execution timed out 1063 ms 13404 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 1064 ms 4692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 6992 KB Output is correct
2 Incorrect 31 ms 8020 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 8520 KB Output is correct
2 Execution timed out 1048 ms 10944 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 2652 KB Output is correct
2 Incorrect 19 ms 3964 KB Output isn't correct
3 Halted 0 ms 0 KB -