CSES - Datatähti Open 2017 - Results
Submission details
Task:Tunnels
Sender:Majakas
Submission time:2017-01-20 19:49:46 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#20.04 s1details
#30.04 s1details
#40.04 s1details
#50.07 s1details
#60.03 s2details
#70.05 s2details
#80.03 s2details
#90.04 s2details
#100.04 s2details
#110.24 s3details
#120.15 s3details
#130.11 s3details
#140.14 s3details
#150.08 s3details

Code

#include <bits/stdc++.h>
#define llong long long
#define f first
#define s second
#define mp make_pair
//#define cin fin

using namespace::std;

ifstream fin("input.txt");

int MAXS = 1e5 + 5;
int answ = 0;

vector<bool> visited(MAXS);
vector<vector<int> > adj(MAXS, vector<int>(0));
vector<pair<int, int> > inout(MAXS);

void dfs(int st)
{
    queue<int> Q;
    Q.push(st);
    visited[st] = 1;
    int cur, val = 0;

    while (!Q.empty()) {
        cur = Q.front(); Q.pop();
        val += abs(inout[cur].f - inout[cur].s);

        for (auto i : adj[cur]) {
            if (visited[i] == 0) {
                visited[i] = 1;
                Q.push(i);
            }
        }
    }
    val = max(val / 2, 1);
    answ += val;
}


int main()
{
    int n, m, t1, t2;
    cin >> n >> m;
    for (int i = 0; i < m; i++) {
        cin >> t1 >> t2;
        adj[t1].push_back(t2);
        adj[t2].push_back(t1);
        inout[t1].f++;
        inout[t2].s++;
    }

    for (int i = 1; i <= n; i++) {
        if (visited[i] == 0) {
            //cout << i << "\n";
            dfs(i);
        }
    }
    cout << answ << "\n";

    //system("pause");
}

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:

input
10 10
7 3
5 2
9 7
1 5
...

correct output
5

user output
6

Test 3

Group: 1

Verdict:

input
10 5
5 7
3 8
5 8
3 7
...

correct output
4

user output
9

Test 4

Group: 1

Verdict:

input
10 4
9 1
6 8
7 1
5 7

correct output
3

user output
7

Test 5

Group: 1

Verdict:

input
10 2
10 6
2 1

correct output
2

user output
8

Test 6

Group: 2

Verdict:

input
100 200
24 40
25 6
36 93
92 90
...

correct output
97

user output
102

Test 7

Group: 2

Verdict:

input
100 100
98 37
91 37
60 92
46 27
...

correct output
60

user output
73

Test 8

Group: 2

Verdict:

input
100 50
74 95
53 72
69 85
14 13
...

correct output
34

user output
76

Test 9

Group: 2

Verdict:

input
100 40
28 76
10 81
13 52
46 83
...

correct output
29

user output
79

Test 10

Group: 2

Verdict:

input
100 20
27 35
72 92
56 4
64 80
...

correct output
18

user output
81

Test 11

Group: 3

Verdict:

input
100000 200000
89244 59358
22943 56710
63331 89437
56581 38400
...

correct output
102510

user output
107130

Test 12

Group: 3

Verdict:

input
100000 100000
21701 85599
61542 21474
38081 29362
46316 64038
...

correct output
60593

user output
79082

Test 13

Group: 3

Verdict:

input
100000 50000
86469 4833
16351 35505
59315 33011
95464 16985
...

correct output
35933

user output
76382

Test 14

Group: 3

Verdict:

input
100000 40000
5392 23534
63204 45619
74330 25925
59678 88427
...

correct output
30074

user output
77922

Test 15

Group: 3

Verdict:

input
100000 20000
80156 16531
71753 77661
7028 33389
17168 646
...

correct output
16882

user output
85037