Submission #1235275

#	Time	Username	Problem	Language	Result	Execution time	Memory
1235275		dssfsuper2	Spring cleaning (CEOI20_cleaning)	C++20	9 / 100	1096 ms	6408 KiB

cleaning

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> adj;
signed main(){
    int n, q;cin>>n>>q;
    bool isss1=true;
    adj.resize(n+1);
    for(int i = 0;i<n-1;i++){
        int a,b;cin>>a>>b;
        adj[a].push_back(b);
        adj[b].push_back(a);
        if(a!=1 && b!=1)isss1=false;
    }
    vector<int> values;
    if(isss1){
        vector<int> values;
        for(int i = 0;i<q;i++){
            int di;cin>>di;
            values.assign(n, 0);
            for(int i = 0;i<di;i++){
                int a;cin>>a;
                values[a]++;
            }
            int total=n-1;
            int ie=0;
            for(int i = 0;i<n;i++){
                if(values[i]>=2)ie++;
                total+=values[i]-(values[i]&1);
                values[i]=values[i]&1;
                if(values[i])total++;
            }
            if(n&1){
                cout << total << '\n';
            }
            else{
                if(ie){
                    cout << total+1 << '\n';
                }
                else{
                    cout << -1 << '\n';
                }
            }
        }
        return 0;
    }
    for(int i = 0;i<q;i++){
        values.assign(n, 0);
        int di;cin>>di;
        for(int i = 0;i<di;i++){
            int x;cin>>x;values[x-1]++;
        }
        int total=n-1;
        vector<int> ones;
        for(int i = 0;i<n;i++){
            total+=values[i]-(values[i]&1);
            values[i]=values[i]&1;
            if(values[i]&1)ones.push_back(i);
        }
        if((int)ones.size()%2==1){
            cout << -1 << '\n';
            continue;
        }
        for(int i =0;i<ones.size();i+=2){
            total+=ones[i+1]-ones[i]+2;
        }
        cout << total << '\n';
    }
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 9
• Subtask 3: 9 / 9
• Subtask 4: 0 / 16
• Subtask 5: 0 / 19
• Subtask 6: 0 / 17
• Subtask 7: 0 / 30