Submission #932230
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAX_N = 130; // Change as necessary const ll MODD = 1000000007; // typedef int Edge; struct Graph { vector<vector<Edge> > nbr; int num_nodes; Graph(int n) : nbr(n), num_nodes(n) { } void add_edge_undirected(int u, int v) { nbr[u].push_back(v); nbr[v].push_back(u); } }; int dfn, dfs[MAX_N], back[MAX_N]; bool root_art(const Graph& G,int v,int k,int child){ if(child > 1) return true; for(int i=k+1;i<G.nbr[v].size();i++) if(!dfs[G.nbr[v][i]]) return true; return false; } vector<vector<pair<int,int> > > comps; void do_dfs(const Graph& G, int v, int pred, stack<pair<int,int> > &e_stack){ int child = 0; dfs[v] = back[v] = ++dfn; for (int i = 0; i < G.nbr[v].size(); i++) { int w = G.nbr[v][i]; if (dfs[w] < dfs[v] && w != pred) e_stack.push(make_pair(v,w)); if (!dfs[w]) { do_dfs(G, w, v, e_stack); child++; if (back[w] >= dfs[v]) { // new biconnected component pair<int,int> e,E = make_pair(v,w); vector<pair<int,int> > comp; do{ e = e_stack.top(); e_stack.pop(); // e belongs to this component comp.push_back(e); } while(e != E); comps.push_back(comp); if(pred != -1 || root_art(G,v,i,child)){ } // v is articulation point } else back[v] = min(back[v],back[w]); } else back[v] = min(back[v],dfs[w]); } } void bicomp(const Graph& G) { stack<pair<int,int> > e_stack; dfn = 0; fill_n(dfs,G.num_nodes,0); for (int i=0;i<G.num_nodes;i++) // get rid of loop to process only one component if (dfs[i] == 0) do_dfs(G, i, -1, e_stack); } int N; vector<int> pr; int mu(int n){ int ctr = 1; for(auto x : pr){ if(n % x == 0){ if(n % (x*x) == 0) return 0; ctr *= -1; } } if(ctr < 0) ctr = MODD-1; return ctr; } ll two[MAX_N]; int inv(int N){ ll res = 1, base = N; int m = MODD-2; while(m){ if(m % 2) res = res*base % MODD; base = base*base % MODD; m /= 2; } return res; } int g(int N){ ll ans = 0; for(int d=1;d<=N;d++){ if(N % d == 0){ ans += mu(d) * two[N/d]; ans %= MODD; } } ans = (ans * inv(N)) % MODD; return ans; } int f(int N){ ll ans = 0; for(int i=1;i<=N;i++) if(N % i == 0) ans = (ans+g(i)) % MODD; return ans; } ll ch[3*MAX_N][3*MAX_N]; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); ch[0][0] = 1; for(int i=1;i<3*MAX_N;i++){ ch[i][0] = ch[i][i] = 1; for(int j=1;j<i;j++) ch[i][j] = (ch[i-1][j] + ch[i-1][j-1]) % MODD; } pr.push_back(2); vector<int> is(MAX_N,true); for(int i=3;i<MAX_N;i+=2) if(is[i]){ pr.push_back(i); for(int j=i*i;j<MAX_N;j+=i) is[j] = false; } int n,m,k; cin >> n >> m >> k; two[0] = 1; for(int i=1;i<MAX_N;i++) two[i] = (k*two[i-1]) % MODD; Graph G(n); for(int i=0;i<m;i++){ int u,v; cin >> u >> v; u--; v--; G.add_edge_undirected(u,v); } bicomp(G); ll ans = 1; for(auto& v : comps){ set<int> nodes; for(auto x : v){ nodes.insert(x.first); nodes.insert(x.second); } if(nodes.size() == 1) continue; if(nodes.size() == v.size()){ ans = (ans * f(nodes.size())) % MODD; } else if(nodes.size() == v.size()+1){ ans = (ans * k) % MODD; } else { ans = (ans * ch[v.size()+k-1][k-1]) % MODD; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Painting Graphs with AtCoDeer |
User | MathCrusader |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 3702 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1300 / 1300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_000.txt, 0_001.txt, 0_002.txt |
All | 0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt, 1_043.txt, 1_044.txt, 1_045.txt, 1_046.txt, 1_047.txt, 1_048.txt, 1_049.txt, 1_050.txt, 1_051.txt, 1_052.txt, 1_053.txt, 1_054.txt, 1_055.txt, 1_056.txt, 1_057.txt, 1_058.txt, 1_059.txt, 1_060.txt, 1_061.txt, 1_062.txt, 1_063.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_000.txt | AC | 4 ms | 1408 KB |
0_001.txt | AC | 4 ms | 1408 KB |
0_002.txt | AC | 4 ms | 1408 KB |
1_003.txt | AC | 4 ms | 1408 KB |
1_004.txt | AC | 4 ms | 1408 KB |
1_005.txt | AC | 4 ms | 1408 KB |
1_006.txt | AC | 4 ms | 1408 KB |
1_007.txt | AC | 4 ms | 1408 KB |
1_008.txt | AC | 4 ms | 1408 KB |
1_009.txt | AC | 4 ms | 1408 KB |
1_010.txt | AC | 4 ms | 1408 KB |
1_011.txt | AC | 4 ms | 1408 KB |
1_012.txt | AC | 4 ms | 1536 KB |
1_013.txt | AC | 4 ms | 1408 KB |
1_014.txt | AC | 4 ms | 1408 KB |
1_015.txt | AC | 4 ms | 1408 KB |
1_016.txt | AC | 4 ms | 1408 KB |
1_017.txt | AC | 4 ms | 1536 KB |
1_018.txt | AC | 4 ms | 1408 KB |
1_019.txt | AC | 4 ms | 1408 KB |
1_020.txt | AC | 4 ms | 1408 KB |
1_021.txt | AC | 4 ms | 1408 KB |
1_022.txt | AC | 4 ms | 1408 KB |
1_023.txt | AC | 4 ms | 1408 KB |
1_024.txt | AC | 4 ms | 1408 KB |
1_025.txt | AC | 4 ms | 1408 KB |
1_026.txt | AC | 4 ms | 1408 KB |
1_027.txt | AC | 4 ms | 1408 KB |
1_028.txt | AC | 4 ms | 1408 KB |
1_029.txt | AC | 4 ms | 1408 KB |
1_030.txt | AC | 4 ms | 1408 KB |
1_031.txt | AC | 4 ms | 1408 KB |
1_032.txt | AC | 4 ms | 1408 KB |
1_033.txt | AC | 4 ms | 1408 KB |
1_034.txt | AC | 4 ms | 1408 KB |
1_035.txt | AC | 4 ms | 1408 KB |
1_036.txt | AC | 4 ms | 1408 KB |
1_037.txt | AC | 4 ms | 1408 KB |
1_038.txt | AC | 4 ms | 1408 KB |
1_039.txt | AC | 4 ms | 1408 KB |
1_040.txt | AC | 4 ms | 1408 KB |
1_041.txt | AC | 4 ms | 1408 KB |
1_042.txt | AC | 4 ms | 1408 KB |
1_043.txt | AC | 4 ms | 1408 KB |
1_044.txt | AC | 4 ms | 1408 KB |
1_045.txt | AC | 4 ms | 1408 KB |
1_046.txt | AC | 4 ms | 1408 KB |
1_047.txt | AC | 4 ms | 1408 KB |
1_048.txt | AC | 4 ms | 1408 KB |
1_049.txt | AC | 4 ms | 1408 KB |
1_050.txt | AC | 4 ms | 1408 KB |
1_051.txt | AC | 4 ms | 1408 KB |
1_052.txt | AC | 4 ms | 1408 KB |
1_053.txt | AC | 4 ms | 1408 KB |
1_054.txt | AC | 4 ms | 1408 KB |
1_055.txt | AC | 4 ms | 1408 KB |
1_056.txt | AC | 4 ms | 1408 KB |
1_057.txt | AC | 4 ms | 1408 KB |
1_058.txt | AC | 4 ms | 1408 KB |
1_059.txt | AC | 4 ms | 1408 KB |
1_060.txt | AC | 4 ms | 1408 KB |
1_061.txt | AC | 4 ms | 1408 KB |
1_062.txt | AC | 4 ms | 1408 KB |
1_063.txt | AC | 4 ms | 1408 KB |