#include<bits/stdc++.h>
using namespace std;
const int N = 100010, M = 500010;
vector<int> pre[N], v[N];
int n, m, in[N], w[N], sum[N], f[N], tp[N], cntq;
int h[N], e[M], ne[M], idx;
int belong[N], bent, stk[N], top, dfn[N], low[N], instk[N], timestamp;
void add(int a, int b){
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void tarjan(int u){
dfn[u] = low[u] = ++ timestamp;
stk[++ top] = u, instk[u] = true;
for (int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if (!dfn[j]){
tarjan(j);
low[u] = min(low[u], low[j]);
}else if(instk[j]) low[u] = min(low[u], dfn[j]);
}
if (dfn[u] == low[u]){
int v;
++ bent;
do{
v = stk[top --];
instk[v] = false;
belong[v] = bent;
sum[bent] += w[v];
} while(v != u);
}
}
void topsort(){
queue<int> q;
for (int i = 1; i <= bent; i ++ )
if (!in[i])
q.push(i);
while (!q.empty()){
int t = q.front();
q.pop();
tp[++ cntq] = t;
for (int i = 0; i < v[t].size(); i ++ ){
int j = v[t][i];
in[j] -- ;
if (!in[j]) q.push(j);
}
}
}
int main(){
memset(h, -1, sizeof h);
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
for (int i = 1; i <= m; i ++ ){
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
}
for (int i = 1; i <= n; i ++ )
if (!dfn[i])
tarjan(i);
for (int i = 1; i <= n; i ++ )
for (int j = h[i]; ~j; j = ne[j]){
int k = e[j];
if (belong[i] != belong[k]){
int x = belong[i], y = belong[k];
in[y] ++ ;
v[x].push_back(y);
pre[y].push_back(x);
}
}
topsort();
for (int i = 1; i <= cntq; i ++ ){
int u = tp[i];
f[u] = sum[u];
for (int j = 0; j < pre[u].size(); j ++ )
f[u] = max(f[u], f[pre[u][j]] + sum[u]);
}
int res = 0;
for (int i = 1; i <= bent; i ++ )
res = max(res, f[i]);
printf("%d\n", res);
return 0;
}
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#define lowbit(x) -x&x
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 10010, M = N * N;
int n, m, in[N], out[N];
int h[N], e[M], ne[M], idx;
int belong[N], bent, stk[N], top, dfn[N], low[N], instk[N], timestamp;
void add(int a, int b){
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void tarjan(int u){
dfn[u] = low[u] = ++ timestamp;
stk[++ top] = u, instk[u] = true;
for (int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if (!dfn[j]){
tarjan(j);
low[u] = min(low[u], low[j]);
}else if(instk[j]) low[u] = min(low[u], dfn[j]);
}
if (dfn[u] == low[u]){
int v;
++ bent;
do{
v = stk[top --];
instk[v] = false;
belong[v] = bent;
} while(v != u);
}
}
int main(){
memset(h, -1, sizeof h);
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i ++ ){
int x, y;
scanf("%d%d", &x, &y);
add(x, y);
}
for (int i = 1; i <= n; i ++ )
if (!dfn[i])
tarjan(i);
for (int i = 1; i <= n; i ++ )
for (int j = h[i]; ~j; j = ne[j]){
int k = e[j];
if (belong[i] != belong[k])
out[belong[i]] ++;
}
int ans, cnt = 0;
for (int i = 1; i <= bent; i ++ )
if (!out[i])
cnt ++ , ans = i;
if (cnt == 1){
int res = 0;
for (int i = 1; i <= n; i ++ )
if (belong[i] == ans)
res ++ ;
printf("%d\n", res);
}else printf("0\n");
return 0;
}
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#define lowbit(x) -x&x
#define LL long long
#define INF 0x3f3f3f3f
using namespace std;
const int N = 110, M = N * N;
int n, m, in[N], out[N];
int h[N], e[M], ne[M], idx;
int belong[N], bent, stk[N], top, dfn[N], low[N], instk[N], timestamp;
void add(int a, int b){
e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void tarjan(int u){
dfn[u] = low[u] = ++ timestamp;
stk[++ top] = u, instk[u] = true;
for (int i = h[u]; ~i; i = ne[i]){
int j = e[i];
if (!dfn[j]){
tarjan(j);
low[u] = min(low[u], low[j]);
}else if(instk[j]) low[u] = min(low[u], dfn[j]);
}
if (dfn[u] == low[u]){
int v;
++ bent;
do{
v = stk[top --];
instk[v] = false;
belong[v] = bent;
} while(v != u);
}
}
int main(){
memset(h, -1, sizeof h);
scanf("%d", &n);
for (int i = 1; i <= n; i ++ )
while (~scanf("%d", &m) && m)
add(i, m);
for (int i = 1; i <= n; i ++ )
if (!dfn[i])
tarjan(i);
for (int i = 1; i <= n; i ++ )
for (int j = h[i]; ~j; j = ne[j]){
int k = e[j];
if (belong[i] != belong[k]){
out[belong[i]] ++;
in[belong[k]] ++ ;
}
}
int ans1 = 0, ans2 = 0;
for (int i = 1; i <= bent; i ++ ){
if (!in[i])
ans1 ++ ;
if (!out[i])
ans2 ++ ;
}
if (bent == 1)
printf("1\n0\n");
else printf("%d\n%d\n", ans1, max(ans1, ans2));
return 0;
}