Submission #946819

#	Time	Username	Problem	Language	Result	Execution time	Memory
946819		GrindMachine	Star Trek (CEOI20_startrek)	C++17	0 / 100	8 ms	5980 KiB

startrek

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<ll> dp1(N), dp2(N), dp3(N);

void dfs1(ll u, ll p){
    dp1[u] = 0;
    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        dp1[u] |= dp1[v]^1;
    }
}

void dfs3(ll u, ll p, ll depth){
    if(!dp1[u] and !(depth&1)){
        dp3[u] = 1;
    }

    vector<ll> win,lose;
    trav(v,adj[u]){
        if(v == p) conts;
        if(dp1[v]) win.pb(v);
        else lose.pb(v);
    }

    if(sz(lose) == 0){
        trav(v,win){
            dfs3(v,u,depth+1);
        }
    }
    else if(sz(lose) == 1){
        dfs3(lose[0],u,depth+1);
    }
}

void solve(int test_case)
{
    ll n,d; cin >> n >> d;
    rep1(i,n-1){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    rep1(i,n){
        dfs1(i,-1);
        dp2[i] = dp1[i];
    }

    dfs1(1,-1);
    auto odp1 = dp1;

    rep1(i,n){
        dp3[i] = dp2[1];
    }
    dfs3(1,-1,0);

    ll lose_cnt = 0;
    rep1(i,n) lose_cnt += dp2[i]^1;

    ll ans = 0;

    rep1(u,n){
        ll ways = 0;
        if(odp1[u]){
            if(dp2[1]){
                ways = n;
            }
        }
        else{
            if(dp2[1]){
                ways = n-lose_cnt;
            }
            if(dp3[u]){
                ways += lose_cnt;
            }
        }

        ans += ways;
    }

    ans %= MOD;
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

• Subtask 1: 0 / 0
• Subtask 2: 0 / 7
• Subtask 3: 0 / 8
• Subtask 4: 0 / 15
• Subtask 5: 0 / 15
• Subtask 6: 0 / 20
• Subtask 7: 0 / 20
• Subtask 8: 0 / 15