-
Notifications
You must be signed in to change notification settings - Fork 0
/
C.cpp
145 lines (136 loc) · 4.02 KB
/
C.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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
#include <bits/stdc++.h>
using namespace std;
//----------------------------------- DEBUG -----------------------------------
#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
// debug & operator << (debug & dd, P p) { dd << "(" << p.x << ", " << p.y << ")"; return dd; }
//----------------------------------- END DEBUG --------------------------------
int main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t;
cin >> t;
while(t--) {
int n,m;
cin >> n >> m;
int ans = m;
vector<pair<int,int>> pos;
vector<int> row(n + 1, 0), col(n + 1, 0), cnt(n + 1, 0);
for(int i=0;i<m;i++) {
int x,y;
cin >> x >> y;
pos.emplace_back(x,y);
row[x]++;
col[y]++;
cnt[x]++, cnt[y]++;
}
// debug() << imie(ans);
// bool special = false;
// debug() << imie(cnt);
// for(auto u: pos) {
// int x = u.first, y = u.second;
// if(x == y) {
// ans--;
// }
// // else if(row[x] == 2 and col[y] == 2) {
// // bool special = true;
// // }
// else if(cnt[x] == 2 and cnt[y] == 2) {
// special = true;
// }
// debug() << imie(x) imie(y) imie(cnt[x]) imie(cnt[y]);
// }
// debug() << imie(special);
// if(special) {
// ans++;
// }
vector<pair<int,int>> tmp;
int moved = true;
while(true) {
debug() << imie("inf");
moved = false;
for(auto u: pos) {
int x = u.first;
int y = u.second;
if(x == y) {
ans--;
}
else if(cnt[x] == 2 and cnt[y] != 2) {
cnt[x]--;
cnt[y]++;
moved = true;
}
else if(cnt[y] == 2 and cnt[x] != 2) {
cnt[y]--;
cnt[x]++;
moved = true;
}
else if(cnt[y] == 1 and cnt[x] == 1){
cnt[y]--;
cnt[x]++;
moved = true;
}
else {
tmp.push_back(u);
}
}
pos = tmp;
tmp.clear();
if(!moved) {
break;
}
}
if(pos.size() != 0) {
int l = pos.size();
vector<int> vis(n + 1, 0);
vector<int> perm(n + 1, 0);
for(auto u: pos) {
int x = u.first;
int y = u.second;
perm[x] = y;
}
for(auto u: pos) {
int x = u.first;
int y = u.second;
if(vis[x] != 2) {
ans++;
while(true) {
vis[x]++;
vis[y]++;
if(vis[x] == 2 and vis[y] == 2) {
break;
}
x = y;
y = perm[y];
}
}
}
}
cout << ans << '\n';
}
}