#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define N 100005
#define ll long long
//由于数据过大,超过ull,使用__int128
//注:__int128不属于c++标准库,只支持位运算和四则运算,且必须在G++64位下才能编译
#define lll __int128
//#define lll long double
#define ull unsigned long long
#define il inline
#define rg register
using namespace std;
//快写
class Qout
{
inline void write(int x)
{
static int sta[35];
rg int top(0);
do
{
sta[top++] = x % 10, x /= 10;
} while (x);
while (top)
putchar(sta[--top] + 48); // 48 是 '0'
}
public:
#define endl '\n'
//重载__int128输出模块
inline Qout &operator<<(__int128 x)
{
static int sta[35];
rg int top(0);
do
{
sta[top++] = x % 10, x /= 10;
} while (x);
while (top)
putchar(sta[--top] + 48); // 48 是 '0'
return *this;
}
inline Qout &operator<<(int x)
{
write(x);
return *this;
}
inline Qout &operator<<(char c)
{
putchar(c);
return *this;
}
inline Qout &operator<<(const string &str)
{
rg int len = str.length();
for (rg int i = 0; i < len; i++)
putchar(str[i]);
return *this;
}
inline Qout &operator<<(char *str)
{
rg int len = strlen(str);
for (rg int i = 0; i < len; i++)
putchar(str[i]);
return *this;
}
} qout;
int n, m;
//辗转相除法求最大公约数
lll gcd(lll x, lll y)
{
while (y ^= x ^= y ^= x %= y)
;
return x;
}
//最小公倍数
lll lcm(lll x, lll y)
{
return x / gcd(x, y) * y;
}
//节点信息结构体
struct node
{
int ru;//入度数量
int n;//相连节点数
int d[6];
} a[N];
//模拟分数
struct edge
{
lll fenmu;//分母
lll fenzi;//分子
edge()
{
fenmu = 1;
fenzi = 0;
}
edge(lll x) { fenzi = x, fenmu = 1; }
void yufen()//约分模块
{
lll g = gcd(fenmu, fenzi);
fenmu /= g, fenzi /= g;
}
};
//重载edge类型的‘+’运算符(分数加法)
il auto operator+(edge a, edge b)
{
//先通分
lll l = lcm(a.fenmu, b.fenmu);
lll fa = l / a.fenmu, fb = l / b.fenmu;
edge ans;
ans.fenmu = l;
ans.fenzi = fa * a.fenzi + fb * b.fenzi;
//再约分
ans.yufen();
return ans;
}
//记录每个节点的水量
edge water[N];
//x指当前节点编号,f指流入水量(分数表示)
void dfs(int x, edge f)
{
//当前节点总水量加上新流入水量
water[x] = water[x] + f;
water[x].yufen();
//如果相连节点数为零(最终排水口)
if (a[x].n == 0)
return;//返回
for (int i = 1; i <= a[x].n; i++)
{
//有n个相连节点,对于每一个相连的节点,流入新流入水的1/n
edge e;
e.fenzi = f.fenzi;
e.fenmu = f.fenmu * a[x].n;
//别忘约分
e.yufen();
//继续深搜
dfs(a[x].d[i], e);
}
}
int main()
{
cin.sync_with_stdio(false);
cin >> n >> m;
for (int i = 1; i <= n; i++)
{
int d, x;
cin >> d;
a[i].n = d;
for (int j = 1; j <= d; j++)
{
cin >> x;
a[i].d[j] = x;
a[x].ru++;
}
}
for (int i = 1; i <= n; i++)
if (!a[i].ru)//如果是输入节点
dfs(i, 1);//从这个节点开始深搜,初始水量为1
for (int i = 1; i <= n; i++)
if (!a[i].n)//如果是输出节点,输出水量
qout<< water[i].fenzi << " " << water[i].fenmu << endl;
system("pause");
return 0;
}
1146 排水系统
于 2024-03-09 16:16:33 首次发布