Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- #include <string>
- #include <iomanip>
- #include <queue>
- #include <cmath>
- #include <algorithm>
- #include <tuple>
- #include <iomanip>
- #include <stdio.h>
- #include <numeric>
- #include <map>
- #include <bitset>
- #include <set>
- #include <stack>
- #include <queue>
- //#pragma GCC optimize("Ofast,no-stack-protector")
- //#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
- //#pragma GCC optimize("unroll-loops")
- //#pragma GCC optimize("fast-math")
- //#pragma GCC optimize("section-anchors")
- //#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
- //#pragma GCC optimize("vpt")
- //#pragma GCC optimize("rename-registers")
- //#pragma GCC optimize("move-loop-invariants")
- //#pragma GCC optimize("unswitch-loops")
- //#pragma GCC optimize("function-sections")
- //#pragma GCC optimize("data-sections")
- //#pragma GCC optimize("branch-target-load-optimize")
- //#pragma GCC optimize("branch-target-load-optimize2")
- //#pragma GCC optimize("btr-bb-exclusive")
- #define int long long
- #define ll long long
- #define ull unsigned long long
- #define all(a) a.begin(), a.end()
- #define pii pair<int, int>
- #define pb push_back
- #define ld long double
- using namespace std;
- const int INF = 1e13;
- //const int mod = 2600000069;
- //const int p = 179;
- int n, m;
- vector<vector<pii>> g;
- vector<vector<int>> ng;
- vector<bool> ban, used;
- vector<pii> br;
- vector<int> tin, dp;
- int timer = 0;
- vector<int> colors;
- void dfs(int v, int p = -1) {
- used[v] = 1;
- tin[v] = dp[v] = timer++;
- for (auto u: g[v]) {
- if (u.first == p) continue;
- if (used[u.first]) {
- dp[v] = min(dp[v], tin[u.first]);
- } else {
- dfs(u.first, v);
- dp[v] = min(dp[v], dp[u.first]);
- if (dp[u.first] > tin[v]) {
- br.pb({min(u.first, v), max(u.first, v)});
- ban[u.second] = 1;
- }
- }
- }
- }
- vector<int> comp_size;
- void mark(int v, int color) {
- used[v] = 1;
- colors[v] = color;
- for (auto u: g[v]) {
- if (ban[u.second] || used[u.first]) continue;
- mark(u.first, color);
- }
- }
- const int mod = 1000000007;
- signed main() {
- ios_base::sync_with_stdio(0);
- cin.tie(0);
- cout.tie(0);
- // freopen("input.in", "r", stdin);
- // freopen("output.out", "w", stdout);
- cin >> n >> m;
- g.resize(n);
- ban.assign(m, 0);
- tin.resize(n);
- dp.assign(n, INF);
- used.assign(n, 0);
- colors.resize(n);
- int a, b;
- for (int i = 0; i < m; i++) {
- cin >> a >> b;
- a--;b--;
- g[a].pb({b, i});
- g[b].pb({a, i});
- }
- for (int i = 0; i < n; i++) {
- if (!used[i]) dfs(i, -1);
- }
- used.assign(n, 0);
- int comp = 0;
- for (int i = 0; i < n; i++) {
- if (!used[i]) {
- mark(i, comp);
- comp++;
- }
- }
- comp_size.assign(comp, 0);
- for (auto k: colors) {
- comp_size[k]++;
- }
- ng.resize(comp);
- for (auto k: br) {
- if (colors[k.first] != colors[k.second]) {
- ng[k.first].pb(k.second);
- ng[k.second].pb(k.first);
- }
- }
- int ans2 = 1, ans1 = 0;
- for (int i = 0; i < comp; i++) {
- if (ng[i].size() == 1) {
- ans1++;
- ans2 *= comp_size[i];
- ans2 %= mod;
- } else if (ng[i].size() == 0) ans1++;
- }
- cout << ans1 << " " << ans2;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement