oj.uz

Submission #630040

# Submission time Handle Problem Language Result Execution time Memory
630040 2022-08-15T14:52:39 Z Vladth11 Star Trek (CEOI20_startrek) C++14
85 / 100
 273 ms 44144 KB 
#include <bits/stdc++.h>
#define C 1
#define P 0
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "

using namespace std;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <long double, pii> muchie;

const ll NMAX = 100001;
const ll VMAX = 101;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 447;
const ll base = 117;
const ll nr_of_bits = 18;
const ll inv2 = 500000004;

vector <ll> v[NMAX];
ll col[NMAX];
ll children[NMAX][2];
ll maximal[NMAX];
ll rosii[NMAX];
ll criticals[NMAX];
ll adv[NMAX];
ll sumR[NMAX][2];

void DFS(ll node, ll p){
    col[node] = P;
    for(auto x : v[node]){
        if(x == p) continue;
        DFS(x, node);
        children[node][col[x]]++;
    }
    if(children[node][C] == (ll)v[node].size() - (p != 0)){
        col[node] = P;
    }else{
        col[node] = C;
    }
    if(col[node] == P)
        rosii[node] = 1;
    for(auto x : v[node]){
        if(x == p) continue;
        if(col[node] != col[x] && children[node][C] >= (ll)v[node].size() - (p != 0) - 1){
            rosii[node] += rosii[x];
        }
        sumR[node][col[x]] += rosii[x];
    }
}

ll perdanti = 0;

void bagaR(int node, int p){
    rosii[node] = (col[node] == P);
    if(children[node][C] >= (ll)v[node].size() - (p != 0) - 1) { /// mereu facem bagaR pentru root
        rosii[node] += sumR[node][P + C - col[node]];
    }
}

void Rerooting(ll node, ll p){
    adv[node] = col[node];
    criticals[node] = rosii[node];
    if(adv[node] == P)
        perdanti++;
    for(auto x : v[node]){
        if(x == p) continue;
        ll cx = col[x], cnode = col[node];
        children[node][col[x]]--;
        sumR[node][col[x]] -= rosii[x];
        if(children[node][C] == v[node].size() - 1){
            col[node] = P;
        }else{
            col[node] = C;
        }
        bagaR(node, x);
        children[x][col[node]]++;
        sumR[x][col[node]] += rosii[node];
        if(children[x][C] == v[x].size()){
            col[x] = P;
        }else{
            col[x] = C;
        }
        bagaR(x, 0);
        Rerooting(x, node);
        children[x][col[node]]--;
        sumR[x][col[node]] -= rosii[node];
        col[x] = cx;
        bagaR(x, node);
        col[node] = cnode;
        children[node][col[x]]++;
        sumR[node][col[x]] += rosii[x];
        bagaR(node, 0);
    }
}

ll lgput(ll n, ll p){
    ll r = 1;
    while(p){
        if(p % 2){
            r *= n;
            r %= MOD;
        }
        n *= n;
        n %= MOD;
        p /= 2;
    }
    return r;
}

void add(ll &x, ll val){
    x += val;
    if(x >= MOD)
        x -= MOD;
    if(x < 0)
        x += MOD;
}

ll L[NMAX];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ll n, d, i, criticalDif = 0;
    cin >> n >> d;
    if(n == 2){
        cout << lgput(4, d);
        return 0;
    }
    for(i = 1; i < n; i++){
        ll a, b;
        cin >> a >> b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    DFS(2, 0);
    Rerooting(2, 0);
    for(i = 1; i <= n; i++){
        if(adv[i] == P){
            add(criticalDif, -criticals[i]);
        }else{
            add(criticalDif, criticals[i]);
        }
    }
    ll B = criticalDif;
    ll A = (perdanti * n) % MOD * n % MOD;
    /// L0 = perdanti
    /// L1 = A + L0 * B
    /// Li = A + Li-1 * B
    L[0] = perdanti;
    for(i = 1; i <= d - 1; i++){
        L[i] = ((lgput(n, 2 * i) % MOD * perdanti) % MOD + (L[i - 1] * B) % MOD) % MOD;
    }
    ll schimba = (L[d - 1] * criticals[1]) % MOD;
    if(adv[1] == P){
        cout << schimba;
    }else{
        cout << (lgput(n, 2 * d) - schimba + MOD) % MOD;
    }
    return 0;
}

Compilation message

startrek.cpp: In function 'void Rerooting(ll, ll)':
startrek.cpp:72:30: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |         if(children[node][C] == v[node].size() - 1){
      |            ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~
startrek.cpp:80:27: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |         if(children[x][C] == v[x].size()){
      |            ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
startrek.cpp: In function 'int main()':
startrek.cpp:148:8: warning: unused variable 'A' [-Wunused-variable]
  148 |     ll A = (perdanti * n) % MOD * n % MOD;
      |        ^

Subtask #1
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2812 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2644 KB Output is correct
2 Correct 2 ms 2664 KB Output is correct
3 Correct 2 ms 2644 KB Output is correct
4 Correct 2 ms 2572 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct

Subtask #3
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2624 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2624 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2624 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 87 ms 22160 KB Output is correct
13 Correct 107 ms 20820 KB Output is correct
14 Correct 77 ms 12356 KB Output is correct
15 Correct 100 ms 12420 KB Output is correct
16 Correct 74 ms 12408 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2624 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 2 ms 2656 KB Output is correct
13 Correct 2 ms 2784 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 1 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2656 KB Output is correct
21 Correct 2 ms 2780 KB Output is correct
22 Correct 2 ms 2784 KB Output is correct
23 Correct 2 ms 2784 KB Output is correct
24 Correct 2 ms 2784 KB Output is correct
25 Correct 2 ms 2784 KB Output is correct
26 Correct 12 ms 3412 KB Output is correct
27 Correct 11 ms 3540 KB Output is correct
28 Correct 13 ms 3564 KB Output is correct
29 Correct 11 ms 3412 KB Output is correct
30 Correct 7 ms 3156 KB Output is correct

Subtask #7
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2624 KB Output is correct
3 Correct 2 ms 2664 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 3 ms 2772 KB Output is correct
8 Correct 2 ms 2772 KB Output is correct
9 Correct 2 ms 2772 KB Output is correct
10 Correct 2 ms 2772 KB Output is correct
11 Correct 2 ms 2816 KB Output is correct
12 Correct 87 ms 22160 KB Output is correct
13 Correct 107 ms 20820 KB Output is correct
14 Correct 77 ms 12356 KB Output is correct
15 Correct 100 ms 12420 KB Output is correct
16 Correct 74 ms 12408 KB Output is correct
17 Correct 2 ms 2656 KB Output is correct
18 Correct 2 ms 2784 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 1 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2656 KB Output is correct
26 Correct 2 ms 2780 KB Output is correct
27 Correct 2 ms 2784 KB Output is correct
28 Correct 2 ms 2784 KB Output is correct
29 Correct 2 ms 2784 KB Output is correct
30 Correct 2 ms 2784 KB Output is correct
31 Correct 12 ms 3412 KB Output is correct
32 Correct 11 ms 3540 KB Output is correct
33 Correct 13 ms 3564 KB Output is correct
34 Correct 11 ms 3412 KB Output is correct
35 Correct 7 ms 3156 KB Output is correct
36 Correct 98 ms 22196 KB Output is correct
37 Correct 109 ms 20856 KB Output is correct
38 Correct 75 ms 12408 KB Output is correct
39 Correct 92 ms 12292 KB Output is correct
40 Correct 84 ms 12564 KB Output is correct
41 Correct 107 ms 17536 KB Output is correct
42 Correct 86 ms 22652 KB Output is correct
43 Correct 59 ms 11944 KB Output is correct
44 Correct 73 ms 12636 KB Output is correct
45 Correct 84 ms 13040 KB Output is correct

Subtask #8
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 3 ms 2812 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 2 ms 2664 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2572 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2624 KB Output is correct
10 Correct 2 ms 2664 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 3 ms 2772 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 2 ms 2772 KB Output is correct
17 Correct 2 ms 2772 KB Output is correct
18 Correct 2 ms 2816 KB Output is correct
19 Correct 87 ms 22160 KB Output is correct
20 Correct 107 ms 20820 KB Output is correct
21 Correct 77 ms 12356 KB Output is correct
22 Correct 100 ms 12420 KB Output is correct
23 Correct 74 ms 12408 KB Output is correct
24 Correct 2 ms 2656 KB Output is correct
25 Correct 2 ms 2784 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 1 ms 2644 KB Output is correct
28 Correct 2 ms 2644 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2656 KB Output is correct
33 Correct 2 ms 2780 KB Output is correct
34 Correct 2 ms 2784 KB Output is correct
35 Correct 2 ms 2784 KB Output is correct
36 Correct 2 ms 2784 KB Output is correct
37 Correct 2 ms 2784 KB Output is correct
38 Correct 12 ms 3412 KB Output is correct
39 Correct 11 ms 3540 KB Output is correct
40 Correct 13 ms 3564 KB Output is correct
41 Correct 11 ms 3412 KB Output is correct
42 Correct 7 ms 3156 KB Output is correct
43 Correct 98 ms 22196 KB Output is correct
44 Correct 109 ms 20856 KB Output is correct
45 Correct 75 ms 12408 KB Output is correct
46 Correct 92 ms 12292 KB Output is correct
47 Correct 84 ms 12564 KB Output is correct
48 Correct 107 ms 17536 KB Output is correct
49 Correct 86 ms 22652 KB Output is correct
50 Correct 59 ms 11944 KB Output is correct
51 Correct 73 ms 12636 KB Output is correct
52 Correct 84 ms 13040 KB Output is correct
53 Runtime error 273 ms 44144 KB Execution killed with signal 11
54 Halted 0 ms 0 KB -