Submission #390074

# Submission time Handle Problem Language Result Execution time Memory
390074 2021-04-15T09:45:58 Z talant117408 Star Trek (CEOI20_startrek) C++17
7 / 100
2 ms 2636 KB
/*
    Code written by Talant I.D.
*/
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
 
const int mod = 1e9+7;
 
ll mode(ll a) {
    a %= mod;
    if (a < 0) a += mod;
    return a;
}
 
ll subt(ll a, ll b) {
    return mode(mode(a)-mode(b));
}
 
ll add(ll a, ll b) {
    return mode(mode(a)+mode(b));
}
 
ll mult(ll a, ll b) {
    return mode(mode(a)*mode(b));
}
 
ll binpow(ll a, ll b) {
    ll res = 1;
    while (b) {
        if (b&1) res = mult(res, a);
        a = mult(a, a);
        b >>= 1;
    }
    return res;
}

const int N = 1e5+7;
bool state[N];
int losing_children[N], critical;
vector <int> graph[N];

bool dfs(int v, int p) {
	int cnt = 0, children = 0;
	for (auto to : graph[v]) {
		if (to == p) continue;
		children++;
		dfs(to, v);
		cnt += (state[to] ? 1 : 0);
		if (state[to]) losing_children[v]++;
	}
	if (children == 0) state[v] = 1;
	else if (cnt) state[v] = 0;
	else state[v] = 1;
	return state[v];
}

void dfs2(int v, int p) {
	if (state[v] == 0) {
		if (losing_children[v] > 1) return;
		critical++;
		for (auto to : graph[v]) {
			if (to == p) continue;
			if (state[to]) dfs2(to, v);
		}
	}
	else if (v == 1 && state[v] == 1) {
		critical++;
		for (auto to : graph[v]) {
			dfs2(to, v);
		}
	}
}

int main() {
	do_not_disturb
	
	int n;
	ll d;
	cin >> n >> d;
	for (int i = 0; i < n-1; i++) {
		int x, y;
		cin >> x >> y;
		graph[x].pb(y);
		graph[y].pb(x);
	}
	
	if (n == 2) {
		cout << binpow(2, d*2);
	}
	else if (d == 1) {
		dfs(1, 1);
		dfs2(1, 1);
		ll l = 0, w = 0;
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= n; j++) losing_children[j] = 0;
			dfs(i, i);
			if (state[i]) l++;
			else w++;
		}
		dfs(1, 1);
		if (state[1]) cout << critical*l;
		else cout << n*w+(n-critical)*l;
	}
	
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Incorrect 2 ms 2636 KB Output isn't correct