oj.uz

답안 #667685

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
667685 2022-12-01T21:22:42 Z mychecksedad Star Trek (CEOI20_startrek) C++17
7 / 100
 13 ms 23776 KB 
/* Author : Mychecksdead */
#include<bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " is " << x << '\n';
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;

ll po(ll a, ll b){
    ll res = 1;
    while(b){
        if(b&1) (res *= a) %= MOD;
        (a *= a) %= MOD;
        b >>= 1;
    }
    return res;
}

ll d, dp[N]; // subtree and parent
vector<int> g[N];
int n, X = 0, par[N], sz[N], is[N], dep[N], mx[N];

void pre(int v, int p){
    dp[v] = 0;
    par[v] = p;
    dep[v] = dep[p] + 1;
    for(int u: g[v]){
        if(u != p){
            pre(u, v);
            dp[v] |= !dp[u];
        }
    }
}
void ppre(int v, int p){
    is[v] = dp[v];
    if(p != 0){
        is[v] |= !is[p];
    }
    for(int u: g[v]){
        if(u != p){
            ppre(u, v);
        }
    }
}
void dfs(int v, int p){
    if(dep[v] % 2)
        mx[v] = max(mx[p], n - is[v]*n);
    else
        mx[v] = max(mx[p], is[v]*n);
    for(int u: g[v]){
        if(u != p){
            dfs(u, v);
        }
    }
}

void solve(){
    cin >> n >> d;
    for(int i = 0 ; i < n - 1; ++i){
        int u, v; cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }
    if(n == 2){
        cout << po(4, d); return;
    }
    par[0] = 0;
    dp[0] = is[0] = 0;
    dep[0] = -1;
    pre(1, 0);
    ppre(1, 0);
    dfs(1, 0);

    for(int i = 1; i <= n; ++i) X += 1 - is[i];

    // dfs(1, 0);

    ll ans = max(X, mx[1]);

    for(int i = 2; i <= n; ++i){
        int m = mx[i], v = i;

        if(!(dep[i] % 2 && is[i]))
            if(is[i])
                m = max(X, m);
            else{
                m = max(n - X, m);
            }
        // cout << m << ' ';
        (ans += m) %= MOD; 
    }

    cout << ans;
}




int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    int T = 1, aa;
    // cin >> T;aa=T;
    while(T--){
        // cout << "Case #" << aa-T << ": ";
        solve();
        cout << '\n';
    }
    return 0;
 
}

Compilation message

startrek.cpp: In function 'void solve()':
startrek.cpp:91:11: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   91 |         if(!(dep[i] % 2 && is[i]))
      |           ^
startrek.cpp:89:24: warning: unused variable 'v' [-Wunused-variable]
   89 |         int m = mx[i], v = i;
      |                        ^
startrek.cpp: In function 'int main()':
startrek.cpp:109:16: warning: unused variable 'aa' [-Wunused-variable]
  109 |     int T = 1, aa;
      |                ^~

Subtask #1
0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23764 KB Output is correct
3 Correct 13 ms 23764 KB Output is correct
4 Correct 12 ms 23776 KB Output is correct
5 Correct 11 ms 23764 KB Output is correct

Subtask #3
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23752 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -