oj.uz

Submission #782924

# Submission time Handle Problem Language Result Execution time Memory
782924 2023-07-14T11:34:20 Z Sami_Massah Subtree (INOI20_subtree) C++17
38 / 100
 422 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;


const int maxn = 1e5 + 12, mod = 1e9 + 7;
long long n, m, pd[maxn], h[maxn], dp[maxn], sum[maxn];
vector <int> conn[maxn], nums;
bitset <maxn> marked, in_num;
void dfs(int u, int p = -1){

    marked[u] = 1;
    int me = -1;
    for(int v: conn[u])
        if(!marked[v]){
            pd[v] = u;
            h[v] = h[u] + 1;
            dfs(v, u);
        }
        else if(h[u] < h[v])
            me = v;
   // cout << u << ' ' << me << endl;
    if(me == -1){
        dp[u] = 1;
        for(int v: conn[u])
            if(h[u] < h[v]){
            //    cout << u << '-' << v << endl;
                dp[u] = (dp[u] * (dp[v] + 1)) % mod;
    }
        dp[u] %= mod;
        //cout << u << "->" << dp[u] << endl;
    }
    else{
        nums.clear();
        in_num = 0;
        while(h[u] <= h[me] && me){
            nums.push_back(me);
            in_num[me] = 1;
            me = pd[me];
        }
        for(int j = 0; j <= nums.size(); j++)
            sum[j] = 0;
        long long res = 1;
        for(int j = 0; j < nums.size(); j++){

            int nu = nums[j];
            for(int v: conn[nu])
                if(h[nu] < h[v] && !in_num[v]){
                    res = res * (dp[v] + 1) % mod;
                    res %= mod;
                }
            sum[j] = (j == 0? 1: sum[j - 1]);
            sum[j] += res;
            sum[j] %= mod;
          //  cout << nu << ' ' << sum[j] << endl;

        }
       // cout << dp[2] << endl;
        res = 1;
        for(int j = nums.size() - 1; j >= 1; j--){
            int nu = nums[j];
            for(int v: conn[nu])
                if(h[nu] < h[v] && !in_num[v]){
                    res = res * (dp[v] + 1) % mod;
                }
            res %= mod;
            if(j - 2 >= 0)
                dp[u] += res % mod * (sum[j - 2] % mod) % mod;
            dp[u] %= mod;
        }
        //cout << dp[2] << endl;
        dp[u] += res;
        dp[u] %= mod;

    }


}
int main(){
    cin >> n >> m;
    for(int i = 0; i < m; i++){
        int a, b;
        cin >> a >> b;
        conn[a].push_back(b);
        conn[b].push_back(a);
    }
   // cout << endl;
    dfs(1);
    long long ans = 0;
   // cout << endl;
    for(int i = 1; i <= n; i++){
        ans += dp[i];
        ans %= mod;
       // cout << i << ' ' << dp[i] << endl;
        }
    cout << ans << endl;









}

Compilation message

Main.cpp: In function 'void dfs(int, int)':
Main.cpp:40:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for(int j = 0; j <= nums.size(); j++)
      |                        ~~^~~~~~~~~~~~~~
Main.cpp:43:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j = 0; j < nums.size(); j++){
      |                        ~~^~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2772 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2772 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2772 KB Output is correct
19 Correct 1 ms 2772 KB Output is correct
20 Correct 1 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct
30 Correct 1 ms 2772 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2772 KB Output is correct
35 Correct 1 ms 2772 KB Output is correct
36 Correct 1 ms 2772 KB Output is correct
37 Correct 1 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2900 KB Output is correct
44 Correct 1 ms 2772 KB Output is correct
45 Correct 1 ms 2772 KB Output is correct
46 Correct 1 ms 2772 KB Output is correct
47 Correct 1 ms 2704 KB Output is correct
48 Correct 1 ms 2900 KB Output is correct
49 Correct 2 ms 2900 KB Output is correct
50 Correct 1 ms 2900 KB Output is correct
51 Correct 1 ms 2900 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2772 KB Output is correct
2 Correct 6 ms 3540 KB Output is correct
3 Correct 62 ms 8608 KB Output is correct
4 Correct 65 ms 8580 KB Output is correct
5 Correct 55 ms 8572 KB Output is correct
6 Correct 60 ms 8564 KB Output is correct
7 Correct 389 ms 901824 KB Output is correct
8 Correct 264 ms 572356 KB Output is correct
9 Correct 249 ms 569152 KB Output is correct
10 Correct 56 ms 9424 KB Output is correct
11 Correct 55 ms 8528 KB Output is correct
12 Correct 68 ms 8448 KB Output is correct
13 Correct 77 ms 13700 KB Output is correct
14 Correct 189 ms 379332 KB Output is correct
15 Correct 422 ms 1034984 KB Output is correct
16 Runtime error 375 ms 1048576 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2772 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2772 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2772 KB Output is correct
19 Correct 1 ms 2772 KB Output is correct
20 Correct 1 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct
30 Correct 1 ms 2772 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2772 KB Output is correct
35 Correct 1 ms 2772 KB Output is correct
36 Correct 1 ms 2772 KB Output is correct
37 Correct 1 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2900 KB Output is correct
44 Correct 1 ms 2772 KB Output is correct
45 Correct 1 ms 2772 KB Output is correct
46 Correct 1 ms 2772 KB Output is correct
47 Correct 1 ms 2704 KB Output is correct
48 Correct 1 ms 2900 KB Output is correct
49 Correct 2 ms 2900 KB Output is correct
50 Correct 1 ms 2900 KB Output is correct
51 Correct 1 ms 2900 KB Output is correct
52 Correct 4 ms 3284 KB Output is correct
53 Correct 4 ms 3284 KB Output is correct
54 Correct 4 ms 3284 KB Output is correct
55 Correct 5 ms 5612 KB Output is correct
56 Correct 26 ms 51388 KB Output is correct
57 Correct 4 ms 3028 KB Output is correct
58 Correct 5 ms 3028 KB Output is correct
59 Correct 12 ms 22140 KB Output is correct
60 Correct 4 ms 3412 KB Output is correct
61 Correct 5 ms 5072 KB Output is correct
62 Correct 7 ms 4948 KB Output is correct
63 Correct 6 ms 3028 KB Output is correct
64 Correct 4 ms 3028 KB Output is correct
65 Correct 4 ms 3284 KB Output is correct
66 Correct 5 ms 3412 KB Output is correct
67 Correct 5 ms 5332 KB Output is correct
68 Correct 20 ms 38872 KB Output is correct
69 Correct 4 ms 3412 KB Output is correct
70 Correct 4 ms 3412 KB Output is correct
71 Correct 5 ms 5076 KB Output is correct
72 Correct 6 ms 5204 KB Output is correct
73 Correct 4 ms 3028 KB Output is correct
74 Correct 5 ms 4180 KB Output is correct
75 Correct 17 ms 28088 KB Output is correct
76 Correct 7 ms 4692 KB Output is correct
77 Correct 23 ms 44884 KB Output is correct
78 Correct 9 ms 11732 KB Output is correct
79 Correct 20 ms 40720 KB Output is correct
80 Correct 8 ms 5844 KB Output is correct
81 Correct 6 ms 8404 KB Output is correct
82 Correct 6 ms 7856 KB Output is correct
83 Correct 5 ms 5972 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2772 KB Output is correct
4 Correct 1 ms 2644 KB Output is correct
5 Correct 1 ms 2644 KB Output is correct
6 Correct 1 ms 2644 KB Output is correct
7 Correct 1 ms 2772 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2772 KB Output is correct
10 Correct 1 ms 2772 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 2 ms 2772 KB Output is correct
13 Correct 1 ms 2772 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 1 ms 2772 KB Output is correct
16 Correct 1 ms 2772 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 1 ms 2772 KB Output is correct
19 Correct 1 ms 2772 KB Output is correct
20 Correct 1 ms 2772 KB Output is correct
21 Correct 2 ms 2772 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 1 ms 2644 KB Output is correct
27 Correct 1 ms 2772 KB Output is correct
28 Correct 1 ms 2772 KB Output is correct
29 Correct 1 ms 2772 KB Output is correct
30 Correct 1 ms 2772 KB Output is correct
31 Correct 1 ms 2772 KB Output is correct
32 Correct 1 ms 2772 KB Output is correct
33 Correct 1 ms 2644 KB Output is correct
34 Correct 1 ms 2772 KB Output is correct
35 Correct 1 ms 2772 KB Output is correct
36 Correct 1 ms 2772 KB Output is correct
37 Correct 1 ms 2772 KB Output is correct
38 Correct 2 ms 2772 KB Output is correct
39 Correct 2 ms 2900 KB Output is correct
40 Correct 2 ms 2900 KB Output is correct
41 Correct 2 ms 2900 KB Output is correct
42 Correct 1 ms 2644 KB Output is correct
43 Correct 1 ms 2900 KB Output is correct
44 Correct 1 ms 2772 KB Output is correct
45 Correct 1 ms 2772 KB Output is correct
46 Correct 1 ms 2772 KB Output is correct
47 Correct 1 ms 2704 KB Output is correct
48 Correct 1 ms 2900 KB Output is correct
49 Correct 2 ms 2900 KB Output is correct
50 Correct 1 ms 2900 KB Output is correct
51 Correct 1 ms 2900 KB Output is correct
52 Correct 1 ms 2772 KB Output is correct
53 Correct 6 ms 3540 KB Output is correct
54 Correct 62 ms 8608 KB Output is correct
55 Correct 65 ms 8580 KB Output is correct
56 Correct 55 ms 8572 KB Output is correct
57 Correct 60 ms 8564 KB Output is correct
58 Correct 389 ms 901824 KB Output is correct
59 Correct 264 ms 572356 KB Output is correct
60 Correct 249 ms 569152 KB Output is correct
61 Correct 56 ms 9424 KB Output is correct
62 Correct 55 ms 8528 KB Output is correct
63 Correct 68 ms 8448 KB Output is correct
64 Correct 77 ms 13700 KB Output is correct
65 Correct 189 ms 379332 KB Output is correct
66 Correct 422 ms 1034984 KB Output is correct
67 Runtime error 375 ms 1048576 KB Execution killed with signal 9
68 Halted 0 ms 0 KB -