Submission #1233074

#TimeUsernameProblemLanguageResultExecution timeMemory
1233074LaMatematica14Star Trek (CEOI20_startrek)C++20
7 / 100
0 ms328 KiB
#include <bits/stdc++.h>
using namespace std;

const long long mod = 1000000007;

long long fe(long long e) {
    long long att = 4, ris = 1;
    for (long long i = 1; i < e && i > 0; i<<=1) {
        if (i&e) ris *= att;
        ris %= mod;
        att *= att; att %= mod;
    }
    return ris;
}

int main() {
    long long N, D; cin >> N >> D;
    vector<vector<long long>> adj(N+1); // occhio 1-based
    for (long long  i = 0; i < N-1; i++) {
        long long u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    cout << fe(D) << "\n";
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...