답안 #1003241

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1003241	2024-06-20T08:10:07 Z	vjudge1	Subtree (INOI20_subtree)	C++17	20 / 100	88 ms	30996 KB

Main

#include <bits/stdc++.h>
using namespace std;
const int N=1e5+10;
vector<int> g[N];
vector<int> bridges[N];
vector<int> notBridges[N];
int add[N], depth[N];
bool vis[N];
vector<vector<int>> cycles;
int getCycle[N];
void dfsAdd(int at, int p) {
  vis[at]=1;
  for(int to:g[at]) {
    if(to==p)continue;
    if(vis[to] == 1) 
    {
      if(depth[at] > depth[to]) {
        add[at]++;
        add[to]--;
        notBridges[to].push_back(at);
        notBridges[at].push_back(to);
      }
      continue;
    }
    depth[to]=depth[at]+1;
    dfsAdd(to, at);
  }
}
void dfsGetBridges(int at, int p) {
  vis[at]=1;
  for(int to:g[at]) {
    if(vis[to])continue;
    dfsGetBridges(to, at);
    add[at]+=add[to];
  }
  if(p==0)return;
  if(add[at] == 0) {
    bridges[at].push_back(p);
    bridges[p].push_back(at);
  }
  else {
    notBridges[at].push_back(p);
    notBridges[p].push_back(at);
  }
}
vector<int> tempcycle;
void dfsGetCycles(int at) {
  tempcycle.push_back(at);
  vis[at]=1;
  for(int to:notBridges[at]) {
    if(vis[to])continue;
    dfsGetCycles(to);
  }
}
long long dp[N], tmpdp[N];
const long long mod = 1e9+7;
long long ans=0;
void dfsCalc(int c) {
  vis[c]=1;
  for(int at:cycles[c]) {
    dp[at]=1;
    for(int to:g[at]) {
      if(!vis[getCycle[to]]) {
        dfsCalc(getCycle[to]);
        dp[at] = (dp[at]*(dp[to]+1))%mod;
      }
    }
  }
  if(cycles[c].size()==1){
    ans+=dp[cycles[c][0]];
    ans%=mod;
    return;
  }
  for(int i = 0;i<cycles[c].size();i++) {
    for(int j = 0;j<cycles[c].size();j++) {
      long long prod = dp[cycles[c][j]];
      int sz=1;
      for(int k = i;k!=j;k=(k+1)%cycles[c].size()){
        prod=(prod*dp[cycles[c][k]])%mod;
        sz++;
      }
      if(sz==cycles[c].size())continue;
      ans+=prod;
      for(int k = i;k!=j;k=(k+1)%cycles[c].size()) {
        tmpdp[cycles[c][k]]+=prod;
      }
      tmpdp[cycles[c][j]]+=prod;
    }
  }
  for(int i:cycles[c]) {
    dp[i]=tmpdp[i];
    ans%=mod;
  }
}
int main () {
  cin.tie(0)->sync_with_stdio(0);
  int n, m;
  cin >> n >> m;
  for(int i = 0;i<m;i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfsAdd(1, 0);
  memset(vis, 0, sizeof vis);
  dfsGetBridges(1, 0);
  memset(vis, 0, sizeof vis);
  for(int i = 1;i<=n;i++) {
    if(vis[i] == 0) {
      dfsGetCycles(i);
      for(int c:tempcycle) {
        getCycle[c] = cycles.size();
      }
      cycles.push_back(tempcycle);
      tempcycle.clear();
    }
  }
  memset(vis, 0, sizeof vis);
  dfsCalc(0);
  cout << ans << "\n";
}

Compilation message

Main.cpp: In function 'void dfsCalc(int)':
Main.cpp:74:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |   for(int i = 0;i<cycles[c].size();i++) {
      |                 ~^~~~~~~~~~~~~~~~~
Main.cpp:75:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |     for(int j = 0;j<cycles[c].size();j++) {
      |                   ~^~~~~~~~~~~~~~~~~
Main.cpp:82:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |       if(sz==cycles[c].size())continue;
      |          ~~^~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7516 KB	Output is correct
2	Correct	7 ms	9112 KB	Output is correct
3	Correct	65 ms	22532 KB	Output is correct
4	Correct	57 ms	22556 KB	Output is correct
5	Correct	55 ms	22528 KB	Output is correct
6	Correct	54 ms	22532 KB	Output is correct
7	Correct	68 ms	29072 KB	Output is correct
8	Correct	71 ms	26656 KB	Output is correct
9	Correct	60 ms	26808 KB	Output is correct
10	Correct	48 ms	23432 KB	Output is correct
11	Correct	45 ms	22852 KB	Output is correct
12	Correct	63 ms	22484 KB	Output is correct
13	Correct	63 ms	22452 KB	Output is correct
14	Correct	48 ms	25660 KB	Output is correct
15	Correct	79 ms	30404 KB	Output is correct
16	Correct	88 ms	30996 KB	Output is correct
17	Correct	62 ms	22420 KB	Output is correct
18	Correct	63 ms	22272 KB	Output is correct
19	Correct	60 ms	22460 KB	Output is correct
20	Correct	49 ms	22588 KB	Output is correct
21	Correct	47 ms	22784 KB	Output is correct
22	Correct	49 ms	22788 KB	Output is correct

Subtask #3
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7512 KB	Output is correct
2	Correct	3 ms	7516 KB	Output is correct
3	Correct	2 ms	7516 KB	Output is correct
4	Correct	3 ms	7516 KB	Output is correct
5	Correct	3 ms	7516 KB	Output is correct
6	Correct	4 ms	7436 KB	Output is correct
7	Correct	3 ms	7512 KB	Output is correct
8	Correct	3 ms	7516 KB	Output is correct
9	Correct	4 ms	7516 KB	Output is correct
10	Correct	4 ms	7516 KB	Output is correct
11	Correct	3 ms	7516 KB	Output is correct
12	Correct	2 ms	7516 KB	Output is correct
13	Correct	3 ms	7516 KB	Output is correct
14	Correct	3 ms	7768 KB	Output is correct
15	Correct	3 ms	7516 KB	Output is correct
16	Correct	2 ms	7420 KB	Output is correct
17	Correct	3 ms	7516 KB	Output is correct
18	Correct	3 ms	7516 KB	Output is correct
19	Correct	3 ms	7516 KB	Output is correct
20	Correct	3 ms	7516 KB	Output is correct
21	Correct	3 ms	7516 KB	Output is correct
22	Correct	3 ms	7516 KB	Output is correct
23	Correct	3 ms	7516 KB	Output is correct
24	Correct	3 ms	7516 KB	Output is correct
25	Correct	3 ms	7604 KB	Output is correct
26	Correct	3 ms	7516 KB	Output is correct
27	Correct	4 ms	7516 KB	Output is correct
28	Correct	3 ms	7524 KB	Output is correct
29	Correct	3 ms	7516 KB	Output is correct
30	Correct	3 ms	7516 KB	Output is correct
31	Correct	3 ms	7512 KB	Output is correct
32	Correct	4 ms	7516 KB	Output is correct
33	Correct	3 ms	7516 KB	Output is correct
34	Correct	3 ms	7516 KB	Output is correct
35	Correct	3 ms	7516 KB	Output is correct
36	Correct	3 ms	7516 KB	Output is correct
37	Correct	3 ms	7516 KB	Output is correct
38	Correct	3 ms	7516 KB	Output is correct
39	Correct	3 ms	7516 KB	Output is correct
40	Correct	4 ms	7512 KB	Output is correct
41	Correct	4 ms	7516 KB	Output is correct
42	Correct	3 ms	7640 KB	Output is correct
43	Correct	4 ms	7512 KB	Output is correct
44	Correct	4 ms	7516 KB	Output is correct
45	Correct	3 ms	7512 KB	Output is correct
46	Correct	3 ms	7516 KB	Output is correct
47	Correct	3 ms	7516 KB	Output is correct
48	Correct	3 ms	7516 KB	Output is correct
49	Correct	3 ms	7484 KB	Output is correct
50	Correct	3 ms	7516 KB	Output is correct
51	Correct	3 ms	7516 KB	Output is correct
52	Incorrect	5 ms	8284 KB	Output isn't correct
53	Halted	0 ms	0 KB	-

Subtask #4
0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	7512 KB	Output is correct
2	Correct	3 ms	7516 KB	Output is correct
3	Correct	2 ms	7516 KB	Output is correct
4	Correct	3 ms	7516 KB	Output is correct
5	Correct	3 ms	7516 KB	Output is correct
6	Correct	4 ms	7436 KB	Output is correct
7	Correct	3 ms	7512 KB	Output is correct
8	Correct	3 ms	7516 KB	Output is correct
9	Correct	4 ms	7516 KB	Output is correct
10	Correct	4 ms	7516 KB	Output is correct
11	Correct	3 ms	7516 KB	Output is correct
12	Correct	2 ms	7516 KB	Output is correct
13	Correct	3 ms	7516 KB	Output is correct
14	Correct	3 ms	7768 KB	Output is correct
15	Correct	3 ms	7516 KB	Output is correct
16	Correct	2 ms	7420 KB	Output is correct
17	Correct	3 ms	7516 KB	Output is correct
18	Correct	3 ms	7516 KB	Output is correct
19	Correct	3 ms	7516 KB	Output is correct
20	Correct	3 ms	7516 KB	Output is correct
21	Correct	3 ms	7516 KB	Output is correct
22	Correct	3 ms	7516 KB	Output is correct
23	Correct	3 ms	7516 KB	Output is correct
24	Correct	3 ms	7516 KB	Output is correct
25	Correct	3 ms	7604 KB	Output is correct
26	Correct	3 ms	7516 KB	Output is correct
27	Correct	4 ms	7516 KB	Output is correct
28	Correct	3 ms	7524 KB	Output is correct
29	Correct	3 ms	7516 KB	Output is correct
30	Correct	3 ms	7516 KB	Output is correct
31	Correct	3 ms	7512 KB	Output is correct
32	Correct	4 ms	7516 KB	Output is correct
33	Correct	3 ms	7516 KB	Output is correct
34	Correct	3 ms	7516 KB	Output is correct
35	Correct	3 ms	7516 KB	Output is correct
36	Correct	3 ms	7516 KB	Output is correct
37	Correct	3 ms	7516 KB	Output is correct
38	Correct	3 ms	7516 KB	Output is correct
39	Correct	3 ms	7516 KB	Output is correct
40	Correct	4 ms	7512 KB	Output is correct
41	Correct	4 ms	7516 KB	Output is correct
42	Correct	3 ms	7640 KB	Output is correct
43	Correct	4 ms	7512 KB	Output is correct
44	Correct	4 ms	7516 KB	Output is correct
45	Correct	3 ms	7512 KB	Output is correct
46	Correct	3 ms	7516 KB	Output is correct
47	Correct	3 ms	7516 KB	Output is correct
48	Correct	3 ms	7516 KB	Output is correct
49	Correct	3 ms	7484 KB	Output is correct
50	Correct	3 ms	7516 KB	Output is correct
51	Correct	3 ms	7516 KB	Output is correct
52	Correct	3 ms	7516 KB	Output is correct
53	Correct	7 ms	9112 KB	Output is correct
54	Correct	65 ms	22532 KB	Output is correct
55	Correct	57 ms	22556 KB	Output is correct
56	Correct	55 ms	22528 KB	Output is correct
57	Correct	54 ms	22532 KB	Output is correct
58	Correct	68 ms	29072 KB	Output is correct
59	Correct	71 ms	26656 KB	Output is correct
60	Correct	60 ms	26808 KB	Output is correct
61	Correct	48 ms	23432 KB	Output is correct
62	Correct	45 ms	22852 KB	Output is correct
63	Correct	63 ms	22484 KB	Output is correct
64	Correct	63 ms	22452 KB	Output is correct
65	Correct	48 ms	25660 KB	Output is correct
66	Correct	79 ms	30404 KB	Output is correct
67	Correct	88 ms	30996 KB	Output is correct
68	Correct	62 ms	22420 KB	Output is correct
69	Correct	63 ms	22272 KB	Output is correct
70	Correct	60 ms	22460 KB	Output is correct
71	Correct	49 ms	22588 KB	Output is correct
72	Correct	47 ms	22784 KB	Output is correct
73	Correct	49 ms	22788 KB	Output is correct
74	Incorrect	5 ms	8284 KB	Output isn't correct
75	Halted	0 ms	0 KB	-

답안 #1003241

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 30.0

Subtask #4 0 / 50.0

Subtask #1
8.0 / 8.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 30.0

Subtask #4
0 / 50.0