-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathconvenientairports.cpp
87 lines (82 loc) · 1.48 KB
/
convenientairports.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define fastio ios_base::sync_with_stdio(false); cout.tie(NULL);
using namespace std;
vector<lli> ar[200001];
lli vis[100001],degree[100001];
vector<pair<lli,lli>>pairs;
vector<lli> v;
vector<vector<lli>> con_comps;
void DFS(lli src)
{
v.pb(src);
vis[src]=1;
for(auto child : ar[src])
if(vis[child]==0)
DFS(child);
}
int main()
{
fastio;
int t;
cin>>t;
while(t--)
{
lli n,m,a,b,i,cc=0;
lli ans1=0;
cin>>n>>m;
for(i=1;i<=n;i++)
{
degree[i]=0;
vis[i]=0;
ar[i].clear();
}
pairs.clear();
con_comps.clear();
for(i=0;i<m;i++)
{
cin>>a>>b;
degree[a]++;
degree[b]++;
pairs.pb(mk(a,b));
ar[a].pb(b);
ar[b].pb(a);
}
for(i=1;i<=n;i++)
{
if(vis[i]==0)
{
DFS(i);
cc++;
con_comps.pb(v);
v.clear();
}
}
if(cc>1)
for(i=1;i<cc;i++)
pairs.pb(mk(con_comps[i-1][con_comps[i-1].size()-1],con_comps[i][con_comps[i].size()-1]));
for(i=1;i<=n;i++)
ans1+=degree[i];
if(cc==1)
{
cout<<0<<" "<<m<<"\n";
for(auto pair : pairs)
cout<<pair.first<<" "<<pair.second<<"\n";
}
else if(ans1<=(pairs.size()-m)*2)
cout<<ans1<<" "<<0<<"\n";
else if(ans1>(pairs.size()-m)*2)
{
cout<<(pairs.size()-m)*2<<" "<<pairs.size()<<"\n";
for(auto pair : pairs)
cout<<pair.first<<" "<<pair.second<<"\n";
}
// cout<<ans1<<" "<<(cc-1)*2<<"\n";
}
return 0;
}