oj.uz

Submission #667627

# Submission time Handle Problem Language Result Execution time Memory
667627 2022-12-01T20:10:51 Z mychecksedad Star Trek (CEOI20_startrek) C++17
15 / 100
 1000 ms 23968 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 n, d, dp[N], portal;
bool X = 0;
vector<int> g[N];


void dfss(int v, int p){
    dp[v] = 0;
    for(int u: g[v]){
        if(u != p){
            dfss(u, v);
            dp[v] |= !dp[u];
        }
    }
}

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);
        g[v + n].pb(u + n);
        g[u + n].pb(v + n);
    }
    if(n == 2){
        cout << po(4, d); return;
    }
    ll ans = 0;

    for(int i = 1; i <= n; ++i){
        for(int j = 1; j <= n; ++j){
            g[i].pb(j + n);

            dfss(1, 0);

            if(dp[1]) ans++;

            g[i].pop_back();
        }
    }

    // for(int i = 1; i <= n; ++i){
    //     pre(i, 0, i, 0);
    //     X += dp[i][0];
    // }
    // for(int i = 1; i <= n; ++i){
    //     portal = i;
    //     dfs(1, 0, 0);    
    //     for(int j = 1; j <= n; ++j) cout << dp[j][0] << ' ' << dp[j][1] << '.';
    //     cout << '\n';
    //     (ans += dp[1][0]) %= 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 'int main()':
startrek.cpp:87:16: warning: unused variable 'aa' [-Wunused-variable]
   87 |     int T = 1, aa;
      |                ^~

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Execution timed out 1089 ms 23892 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 13 ms 23752 KB Output is correct
4 Correct 14 ms 23720 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 29 ms 23764 KB Output is correct
3 Correct 31 ms 23764 KB Output is correct
4 Correct 29 ms 23820 KB Output is correct
5 Correct 29 ms 23728 KB Output is correct
6 Correct 28 ms 23764 KB Output is correct

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 29 ms 23764 KB Output is correct
3 Correct 31 ms 23764 KB Output is correct
4 Correct 29 ms 23820 KB Output is correct
5 Correct 29 ms 23728 KB Output is correct
6 Correct 28 ms 23764 KB Output is correct
7 Execution timed out 1079 ms 23968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 29 ms 23764 KB Output is correct
3 Correct 31 ms 23764 KB Output is correct
4 Correct 29 ms 23820 KB Output is correct
5 Correct 29 ms 23728 KB Output is correct
6 Correct 28 ms 23764 KB Output is correct
7 Execution timed out 1079 ms 23968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 29 ms 23764 KB Output is correct
3 Correct 31 ms 23764 KB Output is correct
4 Correct 29 ms 23820 KB Output is correct
5 Correct 29 ms 23728 KB Output is correct
6 Correct 28 ms 23764 KB Output is correct
7 Execution timed out 1079 ms 23968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 29 ms 23764 KB Output is correct
3 Correct 31 ms 23764 KB Output is correct
4 Correct 29 ms 23820 KB Output is correct
5 Correct 29 ms 23728 KB Output is correct
6 Correct 28 ms 23764 KB Output is correct
7 Execution timed out 1079 ms 23968 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Execution timed out 1089 ms 23892 KB Time limit exceeded
3 Halted 0 ms 0 KB -