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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
#include "kollib.h"
#include "message.h"

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
// #include <unordered_set>
// #include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int M = 220;
const int MAX_LOS = 5000;
int n, m;
const int GR = 1000000;
int a[GR + 1], gd[GR + 1];
const int K = MAX_LOS + 2 * M;
int interestPoints;
int from[M], to[M];

void solveBrute() {
	if (MyNodeId() != 0) {
		return ;
	}
	a[0] = 1;
	gd[1] = 0;
	a[1] = FirstNeighbor(1);
	gd[a[1]] = 1;
	FOR(i, 2, n - 1) {
		int next = FirstNeighbor(a[i - 1]);
		if (next == a[i - 2]) {
			next = SecondNeighbor(a[i - 1]);
		}
		a[i] = next;
		gd[a[i]] = i;
	}
	m = NumberOfQueries();
	REP(i, m) {
		int x = QueryFrom(i + 1), y = QueryTo(i + 1);
		int p1 = gd[x], p2 = gd[y];
		if (p1 > p2) swap(p1, p2);
		printf("%d\n", min(p2 - p1, n + p1 - p2));
	}
}

set<int> zbior; // wybrane punkty
map<int, int> dict; // wybrany punkt -> pozycja
pii lew, praw;

pii comp(int pop, int curr) {
	int akt = 1;
	while (true) {
		if (zbior.find(curr) != zbior.end()) {
			return mp(curr, akt);
		}
		int nast = FirstNeighbor(curr);
		if (nast == pop) {
			nast = SecondNeighbor(curr);
		}
		pop = curr;
		curr = nast;
		++akt;
	}
}

void lec(int x) {
	int lewy = FirstNeighbor(x);
	int prawy = SecondNeighbor(x);
	lew = comp(x, lewy);
	praw = comp(x, prawy);
	return;
}

vector<pii> za[K];
int pos[K], naKt[K];
int odl[K];

void build(int position, int elem, int pop) {
	int wsk = 0;
	pos[position] = elem;
	naKt[elem] = position;
	int nast = za[elem][wsk].ST;
	if (nast == pop) {
		++wsk;
		nast = za[elem][wsk].ST;
	}
	if (position + 1 < interestPoints) {
		odl[position + 1] = odl[position] + za[elem][wsk].ND;
		build(position + 1, nast, elem);
	}
}

int main() {
	srand(0);
	n = NumberOfStudents();
	if (n <= GR) {
		solveBrute();
		return 0;
	}
	m = NumberOfQueries();
	REP(i, m) {
		from[i] = QueryFrom(i + 1);
		to[i] = QueryTo(i + 1);
		zbior.insert(from[i]);
		zbior.insert(to[i]);
	}
	REP(i, MAX_LOS) {
		int x;
		do {
			x = (rand() % n) + 1;
		} while (zbior.find(x) != zbior.end());
		zbior.insert(x);
	}
	interestPoints = SIZE(zbior);
	vi tab;
	FOREACH(p, zbior) tab.PB(*p);
	int I = NumberOfNodes();
	int ID = MyNodeId();
	int start = (ID * interestPoints) / I;
  	int end = ((ID + 1) * interestPoints) / I;
  	for (int i = start; i < end; ++i) {
  		lec(tab[i]);
  		PutInt(0, tab[i]);
  		PutInt(0, lew.ST); PutInt(0, lew.ND);
  		PutInt(0, praw.ST); PutInt(0, praw.ND);
  	}
  	Send(0);
  	if (ID != 0) return 0;
  	REP(i, interestPoints) {
  		dict[tab[i]] = i;
  	}
  	REP(i, I) {
  		int kt = Receive(-1);
  		int pocz = (kt * interestPoints) / I, end = ((kt + 1) * interestPoints) / I;
  		for (int j = pocz; j < end; ++j) {
  			int currVal = tab[j];
  			int curr = GetInt(kt);
  			pii lew, praw;
  			lew.ST = GetInt(kt); lew.ND = GetInt(kt);
  			praw.ST = GetInt(kt); praw.ND = GetInt(kt);
  			int lInd = dict[lew.ST];
  			int rInd = dict[praw.ST];
  			za[j].PB(mp(lInd, lew.ND));
  			za[j].PB(mp(rInd, praw.ND));
  		}
  	}
  	build(0, 0, -1);
  	REP(i, m) {
  		int p1 = odl[naKt[dict[from[i]]]], p2 = odl[naKt[dict[to[i]]]];
  		if (p1 > p2) swap(p1, p2);
		printf("%d\n", min(p2 - p1, n + p1 - p2));
  	}
	return 0;
}