| Task: | Tunnels |
| Sender: | Deemo1 |
| Submission time: | 2017-01-22 01:29:03 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 16 |
| #2 | ACCEPTED | 31 |
| #3 | ACCEPTED | 53 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.04 s | 1 | details |
| #2 | ACCEPTED | 0.04 s | 1 | details |
| #3 | ACCEPTED | 0.05 s | 1 | details |
| #4 | ACCEPTED | 0.03 s | 1 | details |
| #5 | ACCEPTED | 0.04 s | 1 | details |
| #6 | ACCEPTED | 0.04 s | 2 | details |
| #7 | ACCEPTED | 0.03 s | 2 | details |
| #8 | ACCEPTED | 0.04 s | 2 | details |
| #9 | ACCEPTED | 0.05 s | 2 | details |
| #10 | ACCEPTED | 0.05 s | 2 | details |
| #11 | ACCEPTED | 0.12 s | 3 | details |
| #12 | ACCEPTED | 0.08 s | 3 | details |
| #13 | ACCEPTED | 0.08 s | 3 | details |
| #14 | ACCEPTED | 0.06 s | 3 | details |
| #15 | ACCEPTED | 0.04 s | 3 | details |
Code
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int n, c1[MAXN], c2[MAXN];
vector<int> adj[MAXN];
bool vis[MAXN];
int cc;
void dfs(int v){
vis[v] = 1;
cc+=abs(c1[v] - c2[v]);
for (int u:adj[v])
if (!vis[u])
dfs(u);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
int m; cin >> n >> m;
while (m--){
int a, b; cin >> a >> b, a--, b--;
c1[a]++, c2[b]++;
adj[a].push_back(b);
adj[b].push_back(a);
}
int ans = 0;
for (int u = 0; u < n; u++)
if (!vis[u] && adj[u].size()){
cc = 0;
dfs(u);
ans += max(1, cc/2);
}
cout << ans << "\n";
return 0;
}
Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 20 4 5 6 4 5 1 5 9 ... |
| correct output |
|---|
| 11 |
| user output |
|---|
| 11 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 10 7 3 5 2 9 7 1 5 ... |
| correct output |
|---|
| 5 |
| user output |
|---|
| 5 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 5 5 7 3 8 5 8 3 7 ... |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 4 9 1 6 8 7 1 5 7 |
| correct output |
|---|
| 3 |
| user output |
|---|
| 3 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 10 2 10 6 2 1 |
| correct output |
|---|
| 2 |
| user output |
|---|
| 2 |
Test 6
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 200 24 40 25 6 36 93 92 90 ... |
| correct output |
|---|
| 97 |
| user output |
|---|
| 97 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 100 98 37 91 37 60 92 46 27 ... |
| correct output |
|---|
| 60 |
| user output |
|---|
| 60 |
Test 8
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 50 74 95 53 72 69 85 14 13 ... |
| correct output |
|---|
| 34 |
| user output |
|---|
| 34 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 40 28 76 10 81 13 52 46 83 ... |
| correct output |
|---|
| 29 |
| user output |
|---|
| 29 |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100 20 27 35 72 92 56 4 64 80 ... |
| correct output |
|---|
| 18 |
| user output |
|---|
| 18 |
Test 11
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 200000 89244 59358 22943 56710 63331 89437 56581 38400 ... |
| correct output |
|---|
| 102510 |
| user output |
|---|
| 102510 |
Test 12
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 100000 21701 85599 61542 21474 38081 29362 46316 64038 ... |
| correct output |
|---|
| 60593 |
| user output |
|---|
| 60593 |
Test 13
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 50000 86469 4833 16351 35505 59315 33011 95464 16985 ... |
| correct output |
|---|
| 35933 |
| user output |
|---|
| 35933 |
Test 14
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 40000 5392 23534 63204 45619 74330 25925 59678 88427 ... |
| correct output |
|---|
| 30074 |
| user output |
|---|
| 30074 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 100000 20000 80156 16531 71753 77661 7028 33389 17168 646 ... |
| correct output |
|---|
| 16882 |
| user output |
|---|
| 16882 |