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
#define NDEBUG
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define TRACE(x) cerr<<"# "#x<<endl;
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<endl;
typedef unsigned long long ULL;
typedef long long LL;
const int INF = 0x7FFFFFFF;

#include "message.h"
#include "kollib.h"

int t_q[202];
int res[202];
vector<int> tasks;

inline void response() {
	int t = Receive(-1);
	tasks.emplace_back(t);
	res[ t_q[t] ] = GetInt(t);
#ifndef NDEBUG
	fprintf(stderr, "task %d   q %d     len %d\n", t, t_q[t], res[ t_q[t] ]);
#endif
}

int main() {
	int nodes = NumberOfNodes();
	int myNodeId = MyNodeId();
	int students = NumberOfStudents();
	int queries = NumberOfQueries();

	if(0 != myNodeId) {
		for(;;) {
			Receive(0);
			
			int q = GetInt(0);

			if(-1 == q) {
				return 0;
			}

			int len = 0;
			const int src = QueryFrom(q);
			const int dst = QueryTo(q);

			if(src != dst) {
				int f = FirstNeighbor(src);
				int s = SecondNeighbor(src);

				if((dst != f) && (dst != s)) {
					int prev = src;
					int next = s;

					len = 1;
					while( next != dst ) {
						++len;
						f = FirstNeighbor(next);
						if(f == prev) {
							prev = next;
							next = SecondNeighbor(next);
						} else {
							prev = next;
							next = f;
						}
					}
				} else {
					len = 1;
				}
			}

			if(len > (students >> 1)) {
				len = students - len;
			}
		
			PutInt(0,len);
			Send(0);
		}
	} else {
		int q_left = queries;

		tasks.reserve(nodes + 3);

		for(int t=nodes-1; t>0; --t) {
			tasks.emplace_back(t);
#ifndef NDEBUG
			fprintf(stderr, "create %d\n", t);
#endif
		}
		for(int q=1; q<=queries ;) {
			if(! tasks.empty()) {
				int t = tasks.back();
				tasks.pop_back();
				t_q[t] = q;
				PutInt(t, q);
				Send(t);
				++q;
#ifndef NDEBUG
			fprintf(stderr, "task %d    q %d\n", t, q);
#endif
			} else {
				response();
				--q_left;
			}
		}
#ifndef NDEBUG
		fprintf(stderr, "main - waiting for %d queries \n", q_left);
#endif

		for(; q_left > 0 ;--q_left) {
			response();
		}

		for(int i=1; i<=queries ;++i) {
			printf("%d\n", res[i]);
		}
		
		while( ! tasks.empty() ) {
			int t = tasks.back();
			tasks.pop_back();
			PutInt(t, -1);
			Send(t);
#ifndef NDEBUG
			fprintf(stderr, "kill %d\n", t);
#endif
		}
	}

	return 0;
}