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
#include <iostream>
#include <algorithm>
#include <vector>
#include "sabotaz.h"
#include "message.h"


using namespace std;

long long int ile = 0;

typedef vector<int >   VI;
const int INF = 1000000000;

long long int n,m, cnt;
VI in, pi;
vector<VI> adj;
vector< pair <int,int> >mosty;

void init()
{
	in.clear (); in.resize (n,INF);
	pi.resize(n);
	cnt = 1;
}

int dfs(int u)
{
	int ans = u;
	in[u] = cnt++;
	for (int i=0; i<adj[u].size(); i++)
	{
		int v = adj[u][i];
		if (v==u) continue;
		if (v==pi[u]) continue;

		if (in[v]==INF)
		{
			pi[v] = u;
			v = dfs(v);
		}
		if (in[ans] > in[v]) ans=v;
	}
	if (ans==u && pi[u]!=u){
        mosty.push_back(pair <int,int> (u,pi[u]));
        ile++;
	}
	return ans;
}

int main()
{
	n = NumberOfIsles();
	m = NumberOfBridges();
    adj.clear(); adj.resize(n);
	for (long long int i=0; i<m; i++)
	{
		long long int a,b;
		a = BridgeEndA(i);
		b = BridgeEndB(i);
		if (a==b) continue;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}

	long long int M = MyNodeId();
    long long int N = NumberOfNodes();
	if (M == 0){
        init();
        for (int u=0; u<n; u++){
            if (in[u]==INF)
            {
                pi[u] = u; dfs(u);
            }
        }
        for (int i=1; i<N; i++){
            PutLL(i,ile);
            for (int j=0; j<ile; j++){
                PutInt(i,mosty[j].first);
                PutInt(i,mosty[j].second);
            }
            Send(i);
        }
	}
    else{
        Receive(0);
        ile = GetLL(0);
        for (long long i=0; i<ile; i++){
            int a,b;
            a = GetInt(0);
            b = GetInt(0);
            mosty.push_back(pair <int,int> (a,b));
        }
    }


    long long int pow = 0;
    int T[n];
    int byl[n];
    for (int i=0; i<n; i++) byl[i] = 0;

    for (long long int i=0; i<ile; i++){
        long long int pocz = mosty[i].first;
        long long int kon = mosty[i].second;
        if (M == (pocz*N)/n){
            if (byl[pocz] == 1){
                if (adj[pocz][kon] > 1) pow++;
            }
            else{
                for (int j=0; j<n; j++) T[j] = 0;
                for (int j=0; j<adj[pocz].size(); j++) T[adj[pocz][j]]++;
                adj[pocz].clear();
                for (int j=0; j<n; j++){
                    adj[pocz].push_back(T[j]);
                }
                if (adj[pocz][kon] > 1) pow++;
                byl[pocz] = 1;
            }
        }
    }

    if (M > 0){
        PutLL(0,pow);
        Send(0);
    }
    else{
        ile -= pow;
        for (int i=1; i<N; i++){
            Receive(i);
            pow = GetLL(i);
            ile -= pow;
        }
        cout << ile;
    }

	return 0;
}