Submission #976170

#	Time	Username	Problem	Language	Result	Execution time	Memory
976170		efedmrlr	Spring cleaning (CEOI20_cleaning)	C++17	0 / 100	31 ms	8024 KiB

cleaning

// #pragma GCC optimize("O3,Ofast,unroll-loops")
// #pragma GCC target("avx2,bmi,popcnt")
#include <bits/stdc++.h>

#define lli long long int
#define ld long double
#define REP(i, n) for(int i = 0; (i) < (n); (i)++)
#define all(x) x.begin(), x.end();
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define MP make_pair

using namespace std;

void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}

const int N = 1e5 + 5;
const int INF = 1e9 + 500;
const int MOD = 1e9 + 7;
int n, q;
vector<vector<int> > adj(N, vector<int>());
void solve() {
    cin >> n >> q;
    REP(i, n - 1) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }
    bool f = (adj[1].size() > 1);
    REP(i, q) {
        int d;
        cin >> d;
        if(f) {
            if((n - 1) & 1) {
                cout << "-1\n";
            }
            else {
                cout << n - 1 << "\n";
            }
        }
        else {
            cout << n - 1 << "\n";
        }
    }
}

signed main() {
    fastio();
    solve();
}

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