F. Forever Winter (拓扑排序)

Problem - F - Codeforces

给定n个点，m条边，读入m条边，求出如图的根结点直接连接的子节点的结点数，和子节点连接的结点数

3
21 20
21 20
5 20
13 20
1 3
11 3
10 3
4 8
19 8
14 8
9 7
12 7
17 7
18 6
16 6
2 6
6 15
7 15
8 15
20 15
3 15
7 6
1 2
1 3
2 4
2 5
3 6
3 7
9 8
9 3
3 6
6 2
2 1
5 2
2 7
4 3
3 8

 

5 3
2 2
2 3

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 2e3 +  10 ,M =100,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;


int d[N],rd[N];
int q[N];
VI g[N];


void solve()
{
	int n,m;cin >> n >> m ;
	ms(d,0);
	ms(rd,0);
	fu(i,1,n) g[i].clear();
		
	fu(i,1,m)
	{
		int a,b;cin >> a >> b;
		d[a] ++ ;d[b] ++ ;
		rd[a] ++ , rd[b] ++ ;
		g[a].push_back(b);
		g[b].push_back(a);
		
	}
	
	
	int hh =0,tt= - 1;
	
	fu(i,1,n)
	if(d[i] == 1 ) q[++ tt ] = i ;
	
	while(hh <= tt)
	{
		auto t = q[hh ++ ];
		for(auto v : g[t])
		if(-- d[v] == 1 ) q[++ tt ] = v;
	}
		
	int root = q[tt ];		
	cout << rd[root ] << " " << (n-1 - rd[root]) / rd[root] << endl;
	// 输出 根结点 连接的点数量 ，
	// n个点减去根结点 和 根结点连接的结点 ， 再除以  根结点连接的结点 得到 根结点连接的结点的 连接的子节点数 
	
}



signed main()
{
//  freopen("1.txt","r",stdin);
//  #define int long long 
//  init(N-1);
    ios
//  cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//     cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//     cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 1e6 +  10 ,M =100,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;





void solve()
{
	int n,m;cin >> n >> m ;
	
	int xy =0 ; 
	
	VI deg(n);
	
	fu(i,1,m)
	{
		int a,b;cin >> a >> b;
		a --,b-- ;
		deg[a] ++;
		deg[b] ++ ;
	}
	xy =count(deg.begin(),deg.end(),1);
	
	int x = n - 1- xy;
	int y = xy / x;
	
	cout << x << " " << y << endl;
		
}



signed main()
{
//  freopen("1.txt","r",stdin);
//  #define int long long 
//  init(N-1);
    ios
//  cout << fixed<<setprecision(2);
    int t=1;
    cin>>t;
    int now = 1;
    while(t -- )
    {
//     cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//     cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}