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
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
using namespace std;
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
#define REP(i,n) FOR(i,1,(n)+1)
typedef vector<int> vi;
#define pb push_back
typedef pair<int,int> pii;
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
#define INF 1000000001
#define sz size()
#define VAR(n,v) typeof(v) n=(v)
#define ALL(t) t.begin(),t.end()
#define SC(a) scanf("%d", &a)
#define GET(a) int a; SC(a)
#define ISDEBUG 0
#define dprintf(...) if(ISDEBUG) \
{printf("\033[31m"); printf(__VA_ARGS__); printf("\033[0m");}
template <class It> void dptab(It b, It e, const char* f="%d ") {
	if(ISDEBUG) {
		for(It it=b; it!=e; ++it) dprintf(f, *it); dprintf("\n");
}}

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

struct query {
	int index;
	int from, to;
	int result;
};

struct student {
	int left;
	int right;
	int index;
	student(): index(-1) {}
};

int n;
map<int, student> students;

int dist(student &a, student &b) {
	int d = abs(a.index - b.index);
	return min(d, n-d);
}

int main() {
	n = NumberOfStudents();
	int m = NumberOfQueries();

	//int world_size = NumberOfNodes();
	//int rank = MyNodeId();

	FOR(i,1,n+1) {
		student s;
		s.left = FirstNeighbor(i);
		s.right = SecondNeighbor(i);
		students.insert(mp(i, s));
	}

	int act = 1;
	FOR(i,1,n+1) {
		students[act].index = i;
		if(students[students[act].left].index == -1)
			act = students[act].left;
		else
			act = students[act].right;
	}

	if(0==MyNodeId()) {
		FOR(i,1,m+1) {
			int a = QueryFrom(i);
			int b = QueryTo(i);
			printf("%d\n", dist(students[a], students[b]));
		}
	}
	return 0;
}