답안 #418637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
418637	2021-06-05T16:11:53 Z	parsabahrami	Subtree (INOI20_subtree)	C++17	50 / 100	2000 ms	33092 KB

Main

#include <bits/stdc++.h>
#pragma GCC optimize("O2", "fast-math") 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 1e5 + 10, MOD = 1e9 + 7;
int dp[N], M[N], dp2[N], up[N], P[N], H[N], rt[N], fr[N], to[N], n, m; vector<int> vec[N], adj[N];
int pd[N];

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

int Find(int v) { return !rt[v] ? v : rt[v] = Find(rt[v]); }

void Union(int u, int v) {
    u = Find(u), v = Find(v);
    if (u == v) return;
    vec[v].push_back(u);
    rt[u] = v;
}

void preDFS(int v, int p = -1) {
    M[v] = 1; P[v] = p;
    for (int id : adj[v]) {
        int u = fr[id] ^ to[id] ^ v;
        if (!M[u]) {
            H[u] = H[v] + 1; preDFS(u, v);
        } else if (u != p && H[u] < H[v]) {
            int w = v;
            while (w != u) 
                Union(P[w], w), w = P[w];
        }
    }
}

void DFS(int v, int p = -1) {
    vector<int> tmp;
    for (int &u : vec[v]) 
        for (int &w : adj[u])  
            if (w != p) 
                DFS(w, v);
            else up[v] = u;
}

inline int calc_dp2(vector<int> &A) {
    int ret = 0, S = 0;
    for (int i = 0; i < SZ(A); i++) {
        S = A[i] * 1ll * (S + 1) % MOD;
        add(ret, S);
    }
    return ret;
}

inline int calc_dp1(vector<int> &A) {
    int ret = calc_dp2(A), S = 1;
    fill(pd, pd + SZ(A) + 1, 0);
    for (int i = 0; i < SZ(A); i++) {
        S = 1ll * S * A[i] % MOD;
        pd[i] = S;
        if (i > 0) add(pd[i], pd[i - 1]);
    }
    S = 1;
    for (int i = SZ(A) - 1; i > 1; i--) {
        S = 1ll * S * A[i] % MOD;
        add(ret, 1ll * S * pd[i - 2] % MOD);
    }
    return ret;
}

void dpDFS(int v, int p = -1) {
    vector<int> A;
    if (~p) {
        vector<int> tmp;
        while (vec[v].back() != up[v]) 
            tmp.push_back(vec[v].back()), vec[v].pop_back();
        vec[v].swap(tmp);
        for (int &x : tmp) 
            vec[v].push_back(x);
    }
    for (int &u : vec[v]) {
        A.push_back(1);
        for (int &w : adj[u]) 
            if (w != p) dpDFS(w, v), A.back() = A.back() * 1ll * (dp2[w] + 1) % MOD;
    }
    dp[v] = calc_dp1(A);
    if (SZ(vec[v]) > 1) {
        int S = 1;
        for (int &x : A) 
            S = 1ll * S * x % MOD;
        add(dp[v], -S);
    }
    if (~p) {
        A.pop_back(); 
        add(dp2[v], dp[v] - calc_dp2(A));
    }
}

int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) 
        vec[i] = {i};
    for (int i = 1; i <= m; i++) {
        int u, v; scanf("%d%d", &u, &v);
        adj[fr[i] = u].push_back(i);
        adj[to[i] = v].push_back(i);
    }
    preDFS(1); 
    for (int i = 1; i <= n; i++) 
        Find(i);
    for (int i = 1; i <= n; i++) 
        if (!rt[i]) rt[i] = i;
    for (int i = 1; i <= n; i++) {
        vector<int> tm;
        for (int id : adj[i]) { 
            int u = fr[id] ^ to[id] ^ i;
            if (rt[i] != rt[u]) tm.push_back(rt[u]);
        }
        adj[i].swap(tm);
    }
    DFS(rt[1]);
    dpDFS(rt[1]);
    int ret = 0;
    for (int i = 1; i <= n; i++) 
        if (rt[i] == i) add(ret, dp[i]);
    printf("%d\n", ret);
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:108:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  108 |     scanf("%d%d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp:112:24: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  112 |         int u, v; scanf("%d%d", &u, &v);
      |                   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	4940 KB	Output is correct
3	Correct	3 ms	4940 KB	Output is correct
4	Correct	3 ms	4940 KB	Output is correct
5	Correct	3 ms	4940 KB	Output is correct
6	Correct	3 ms	5004 KB	Output is correct
7	Correct	3 ms	4940 KB	Output is correct
8	Correct	3 ms	5000 KB	Output is correct
9	Correct	3 ms	5004 KB	Output is correct
10	Correct	3 ms	4940 KB	Output is correct
11	Correct	3 ms	4940 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	3 ms	4940 KB	Output is correct
14	Correct	3 ms	4940 KB	Output is correct
15	Correct	3 ms	5008 KB	Output is correct
16	Correct	3 ms	4940 KB	Output is correct
17	Correct	3 ms	4940 KB	Output is correct
18	Correct	3 ms	5004 KB	Output is correct
19	Correct	3 ms	4940 KB	Output is correct
20	Correct	3 ms	4940 KB	Output is correct
21	Correct	3 ms	4940 KB	Output is correct
22	Correct	4 ms	4940 KB	Output is correct
23	Correct	3 ms	4940 KB	Output is correct
24	Correct	3 ms	4940 KB	Output is correct
25	Correct	3 ms	5004 KB	Output is correct
26	Correct	3 ms	4940 KB	Output is correct
27	Correct	3 ms	4940 KB	Output is correct
28	Correct	3 ms	4940 KB	Output is correct
29	Correct	3 ms	4940 KB	Output is correct
30	Correct	3 ms	4940 KB	Output is correct
31	Correct	3 ms	4940 KB	Output is correct
32	Correct	3 ms	4940 KB	Output is correct
33	Correct	3 ms	4940 KB	Output is correct
34	Correct	3 ms	4940 KB	Output is correct
35	Correct	3 ms	4940 KB	Output is correct
36	Correct	3 ms	4940 KB	Output is correct
37	Correct	3 ms	5000 KB	Output is correct
38	Correct	3 ms	4940 KB	Output is correct
39	Correct	3 ms	5004 KB	Output is correct
40	Correct	3 ms	5052 KB	Output is correct
41	Correct	3 ms	5008 KB	Output is correct
42	Correct	3 ms	5004 KB	Output is correct
43	Correct	3 ms	4940 KB	Output is correct
44	Correct	3 ms	4940 KB	Output is correct
45	Correct	3 ms	4940 KB	Output is correct
46	Correct	3 ms	5008 KB	Output is correct
47	Correct	3 ms	5016 KB	Output is correct
48	Correct	3 ms	4940 KB	Output is correct
49	Correct	3 ms	5004 KB	Output is correct
50	Correct	4 ms	4940 KB	Output is correct
51	Correct	4 ms	4940 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	4940 KB	Output is correct
2	Correct	11 ms	6164 KB	Output is correct
3	Correct	159 ms	15624 KB	Output is correct
4	Correct	150 ms	15556 KB	Output is correct
5	Correct	153 ms	15584 KB	Output is correct
6	Correct	166 ms	15812 KB	Output is correct
7	Correct	207 ms	29124 KB	Output is correct
8	Correct	192 ms	24004 KB	Output is correct
9	Correct	180 ms	24004 KB	Output is correct
10	Correct	130 ms	16172 KB	Output is correct
11	Correct	171 ms	16008 KB	Output is correct
12	Correct	164 ms	15556 KB	Output is correct
13	Correct	176 ms	15672 KB	Output is correct
14	Correct	165 ms	21444 KB	Output is correct
15	Correct	204 ms	31084 KB	Output is correct
16	Correct	210 ms	33092 KB	Output is correct
17	Correct	169 ms	15652 KB	Output is correct
18	Correct	180 ms	15616 KB	Output is correct
19	Correct	164 ms	15684 KB	Output is correct
20	Correct	130 ms	16296 KB	Output is correct
21	Correct	131 ms	16144 KB	Output is correct
22	Correct	128 ms	15940 KB	Output is correct

Subtask #3
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	4940 KB	Output is correct
3	Correct	3 ms	4940 KB	Output is correct
4	Correct	3 ms	4940 KB	Output is correct
5	Correct	3 ms	4940 KB	Output is correct
6	Correct	3 ms	5004 KB	Output is correct
7	Correct	3 ms	4940 KB	Output is correct
8	Correct	3 ms	5000 KB	Output is correct
9	Correct	3 ms	5004 KB	Output is correct
10	Correct	3 ms	4940 KB	Output is correct
11	Correct	3 ms	4940 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	3 ms	4940 KB	Output is correct
14	Correct	3 ms	4940 KB	Output is correct
15	Correct	3 ms	5008 KB	Output is correct
16	Correct	3 ms	4940 KB	Output is correct
17	Correct	3 ms	4940 KB	Output is correct
18	Correct	3 ms	5004 KB	Output is correct
19	Correct	3 ms	4940 KB	Output is correct
20	Correct	3 ms	4940 KB	Output is correct
21	Correct	3 ms	4940 KB	Output is correct
22	Correct	4 ms	4940 KB	Output is correct
23	Correct	3 ms	4940 KB	Output is correct
24	Correct	3 ms	4940 KB	Output is correct
25	Correct	3 ms	5004 KB	Output is correct
26	Correct	3 ms	4940 KB	Output is correct
27	Correct	3 ms	4940 KB	Output is correct
28	Correct	3 ms	4940 KB	Output is correct
29	Correct	3 ms	4940 KB	Output is correct
30	Correct	3 ms	4940 KB	Output is correct
31	Correct	3 ms	4940 KB	Output is correct
32	Correct	3 ms	4940 KB	Output is correct
33	Correct	3 ms	4940 KB	Output is correct
34	Correct	3 ms	4940 KB	Output is correct
35	Correct	3 ms	4940 KB	Output is correct
36	Correct	3 ms	4940 KB	Output is correct
37	Correct	3 ms	5000 KB	Output is correct
38	Correct	3 ms	4940 KB	Output is correct
39	Correct	3 ms	5004 KB	Output is correct
40	Correct	3 ms	5052 KB	Output is correct
41	Correct	3 ms	5008 KB	Output is correct
42	Correct	3 ms	5004 KB	Output is correct
43	Correct	3 ms	4940 KB	Output is correct
44	Correct	3 ms	4940 KB	Output is correct
45	Correct	3 ms	4940 KB	Output is correct
46	Correct	3 ms	5008 KB	Output is correct
47	Correct	3 ms	5016 KB	Output is correct
48	Correct	3 ms	4940 KB	Output is correct
49	Correct	3 ms	5004 KB	Output is correct
50	Correct	4 ms	4940 KB	Output is correct
51	Correct	4 ms	4940 KB	Output is correct
52	Correct	7 ms	5528 KB	Output is correct
53	Correct	7 ms	5580 KB	Output is correct
54	Correct	8 ms	5532 KB	Output is correct
55	Correct	7 ms	5580 KB	Output is correct
56	Correct	8 ms	6040 KB	Output is correct
57	Correct	7 ms	5612 KB	Output is correct
58	Correct	6 ms	5648 KB	Output is correct
59	Correct	7 ms	5780 KB	Output is correct
60	Correct	6 ms	5580 KB	Output is correct
61	Correct	7 ms	5600 KB	Output is correct
62	Correct	8 ms	5548 KB	Output is correct
63	Correct	6 ms	5580 KB	Output is correct
64	Correct	6 ms	5528 KB	Output is correct
65	Correct	7 ms	5580 KB	Output is correct
66	Correct	7 ms	5580 KB	Output is correct
67	Correct	6 ms	5596 KB	Output is correct
68	Correct	8 ms	5836 KB	Output is correct
69	Correct	7 ms	5580 KB	Output is correct
70	Correct	6 ms	5524 KB	Output is correct
71	Correct	7 ms	5580 KB	Output is correct
72	Correct	7 ms	5528 KB	Output is correct
73	Correct	7 ms	5648 KB	Output is correct
74	Correct	7 ms	5580 KB	Output is correct
75	Correct	7 ms	5836 KB	Output is correct
76	Correct	7 ms	5580 KB	Output is correct
77	Correct	7 ms	5964 KB	Output is correct
78	Correct	6 ms	5580 KB	Output is correct
79	Correct	7 ms	5912 KB	Output is correct
80	Correct	6 ms	5580 KB	Output is correct
81	Correct	6 ms	5652 KB	Output is correct
82	Correct	7 ms	5580 KB	Output is correct
83	Correct	6 ms	5580 KB	Output is correct

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	4940 KB	Output is correct
2	Correct	3 ms	4940 KB	Output is correct
3	Correct	3 ms	4940 KB	Output is correct
4	Correct	3 ms	4940 KB	Output is correct
5	Correct	3 ms	4940 KB	Output is correct
6	Correct	3 ms	5004 KB	Output is correct
7	Correct	3 ms	4940 KB	Output is correct
8	Correct	3 ms	5000 KB	Output is correct
9	Correct	3 ms	5004 KB	Output is correct
10	Correct	3 ms	4940 KB	Output is correct
11	Correct	3 ms	4940 KB	Output is correct
12	Correct	3 ms	4940 KB	Output is correct
13	Correct	3 ms	4940 KB	Output is correct
14	Correct	3 ms	4940 KB	Output is correct
15	Correct	3 ms	5008 KB	Output is correct
16	Correct	3 ms	4940 KB	Output is correct
17	Correct	3 ms	4940 KB	Output is correct
18	Correct	3 ms	5004 KB	Output is correct
19	Correct	3 ms	4940 KB	Output is correct
20	Correct	3 ms	4940 KB	Output is correct
21	Correct	3 ms	4940 KB	Output is correct
22	Correct	4 ms	4940 KB	Output is correct
23	Correct	3 ms	4940 KB	Output is correct
24	Correct	3 ms	4940 KB	Output is correct
25	Correct	3 ms	5004 KB	Output is correct
26	Correct	3 ms	4940 KB	Output is correct
27	Correct	3 ms	4940 KB	Output is correct
28	Correct	3 ms	4940 KB	Output is correct
29	Correct	3 ms	4940 KB	Output is correct
30	Correct	3 ms	4940 KB	Output is correct
31	Correct	3 ms	4940 KB	Output is correct
32	Correct	3 ms	4940 KB	Output is correct
33	Correct	3 ms	4940 KB	Output is correct
34	Correct	3 ms	4940 KB	Output is correct
35	Correct	3 ms	4940 KB	Output is correct
36	Correct	3 ms	4940 KB	Output is correct
37	Correct	3 ms	5000 KB	Output is correct
38	Correct	3 ms	4940 KB	Output is correct
39	Correct	3 ms	5004 KB	Output is correct
40	Correct	3 ms	5052 KB	Output is correct
41	Correct	3 ms	5008 KB	Output is correct
42	Correct	3 ms	5004 KB	Output is correct
43	Correct	3 ms	4940 KB	Output is correct
44	Correct	3 ms	4940 KB	Output is correct
45	Correct	3 ms	4940 KB	Output is correct
46	Correct	3 ms	5008 KB	Output is correct
47	Correct	3 ms	5016 KB	Output is correct
48	Correct	3 ms	4940 KB	Output is correct
49	Correct	3 ms	5004 KB	Output is correct
50	Correct	4 ms	4940 KB	Output is correct
51	Correct	4 ms	4940 KB	Output is correct
52	Correct	4 ms	4940 KB	Output is correct
53	Correct	11 ms	6164 KB	Output is correct
54	Correct	159 ms	15624 KB	Output is correct
55	Correct	150 ms	15556 KB	Output is correct
56	Correct	153 ms	15584 KB	Output is correct
57	Correct	166 ms	15812 KB	Output is correct
58	Correct	207 ms	29124 KB	Output is correct
59	Correct	192 ms	24004 KB	Output is correct
60	Correct	180 ms	24004 KB	Output is correct
61	Correct	130 ms	16172 KB	Output is correct
62	Correct	171 ms	16008 KB	Output is correct
63	Correct	164 ms	15556 KB	Output is correct
64	Correct	176 ms	15672 KB	Output is correct
65	Correct	165 ms	21444 KB	Output is correct
66	Correct	204 ms	31084 KB	Output is correct
67	Correct	210 ms	33092 KB	Output is correct
68	Correct	169 ms	15652 KB	Output is correct
69	Correct	180 ms	15616 KB	Output is correct
70	Correct	164 ms	15684 KB	Output is correct
71	Correct	130 ms	16296 KB	Output is correct
72	Correct	131 ms	16144 KB	Output is correct
73	Correct	128 ms	15940 KB	Output is correct
74	Correct	7 ms	5528 KB	Output is correct
75	Correct	7 ms	5580 KB	Output is correct
76	Correct	8 ms	5532 KB	Output is correct
77	Correct	7 ms	5580 KB	Output is correct
78	Correct	8 ms	6040 KB	Output is correct
79	Correct	7 ms	5612 KB	Output is correct
80	Correct	6 ms	5648 KB	Output is correct
81	Correct	7 ms	5780 KB	Output is correct
82	Correct	6 ms	5580 KB	Output is correct
83	Correct	7 ms	5600 KB	Output is correct
84	Correct	8 ms	5548 KB	Output is correct
85	Correct	6 ms	5580 KB	Output is correct
86	Correct	6 ms	5528 KB	Output is correct
87	Correct	7 ms	5580 KB	Output is correct
88	Correct	7 ms	5580 KB	Output is correct
89	Correct	6 ms	5596 KB	Output is correct
90	Correct	8 ms	5836 KB	Output is correct
91	Correct	7 ms	5580 KB	Output is correct
92	Correct	6 ms	5524 KB	Output is correct
93	Correct	7 ms	5580 KB	Output is correct
94	Correct	7 ms	5528 KB	Output is correct
95	Correct	7 ms	5648 KB	Output is correct
96	Correct	7 ms	5580 KB	Output is correct
97	Correct	7 ms	5836 KB	Output is correct
98	Correct	7 ms	5580 KB	Output is correct
99	Correct	7 ms	5964 KB	Output is correct
100	Correct	6 ms	5580 KB	Output is correct
101	Correct	7 ms	5912 KB	Output is correct
102	Correct	6 ms	5580 KB	Output is correct
103	Correct	6 ms	5652 KB	Output is correct
104	Correct	7 ms	5580 KB	Output is correct
105	Correct	6 ms	5580 KB	Output is correct
106	Execution timed out	2064 ms	14916 KB	Time limit exceeded
107	Halted	0 ms	0 KB	-

답안 #418637

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 12.0 / 12.0

Subtask #3 30.0 / 30.0

Subtask #4 0 / 50.0

Subtask #1
8.0 / 8.0

Subtask #2
12.0 / 12.0

Subtask #3
30.0 / 30.0

Subtask #4
0 / 50.0