oj.uz

Submission #946806

# Submission time Handle Problem Language Result Execution time Memory
946806 2024-03-15T05:21:24 Z GrindMachine Star Trek (CEOI20_startrek) C++17
23 / 100
 1000 ms 13168 KB 
#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 dfs2(ll u, ll p){
    if(dp1[u]) return;
    dp1[u] = 0;
    trav(v,adj[u]){
        if(v == p) conts;
        dfs2(v,u);
        dp1[u] |= dp1[v]^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){
        if(odp1[i]){
            dp3[i] = dp2[1];
            conts;
        }

        rep1(j,n) dp1[j] = 0;
        dp1[i] = 1;
        dfs2(1,-1);
        dp3[i] = dp1[1];
    }

    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 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Incorrect 12 ms 5976 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 5720 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 16 ms 5992 KB Output is correct
8 Correct 16 ms 5976 KB Output is correct
9 Correct 10 ms 6004 KB Output is correct
10 Correct 15 ms 5980 KB Output is correct
11 Correct 13 ms 5980 KB Output is correct

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 16 ms 5992 KB Output is correct
8 Correct 16 ms 5976 KB Output is correct
9 Correct 10 ms 6004 KB Output is correct
10 Correct 15 ms 5980 KB Output is correct
11 Correct 13 ms 5980 KB Output is correct
12 Execution timed out 1059 ms 13168 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 16 ms 5992 KB Output is correct
8 Correct 16 ms 5976 KB Output is correct
9 Correct 10 ms 6004 KB Output is correct
10 Correct 15 ms 5980 KB Output is correct
11 Correct 13 ms 5980 KB Output is correct
12 Correct 2 ms 5724 KB Output is correct
13 Incorrect 12 ms 5988 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #7
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5724 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Correct 3 ms 5724 KB Output is correct
4 Correct 2 ms 5724 KB Output is correct
5 Correct 2 ms 5724 KB Output is correct
6 Correct 3 ms 5724 KB Output is correct
7 Correct 16 ms 5992 KB Output is correct
8 Correct 16 ms 5976 KB Output is correct
9 Correct 10 ms 6004 KB Output is correct
10 Correct 15 ms 5980 KB Output is correct
11 Correct 13 ms 5980 KB Output is correct
12 Execution timed out 1059 ms 13168 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5720 KB Output is correct
2 Incorrect 12 ms 5976 KB Output isn't correct
3 Halted 0 ms 0 KB -