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
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
//: Piotr Skotnicki
// Potyczki Algorytmiczne 2014
// KOL
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <vector>
#include <utility>
#include <map>
#include <list>

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

using namespace std;

typedef pair<int, int> PI;

const int MAX_NODES = 100;
const int MAX_N = 1000000000;
const int CHECKPOINT_INTERVAL = 10000;
const int MAX_CHECKPOINTS = MAX_N / CHECKPOINT_INTERVAL;
const int MAX_CHECKPOINTS_PER_THREAD = MAX_CHECKPOINTS / CHECKPOINT_INTERVAL;

struct checkpoint
{
    int left_side;
    int left_checkpoint;
    int left_dist;

    int right_side;
    int right_checkpoint;
    int right_dist;

    checkpoint()
        : left_checkpoint(-1)
        , right_checkpoint(-1)
    {}
};

struct meeting
{
    int from_checkpoint;
    int from_checkpoint_side;
    int to_checkpoint;
    int dist;

    meeting(int from_chkpt, int from_chkpt_side, int to_chkpt, int d)
        : from_checkpoint(from_chkpt)
        , from_checkpoint_side(from_chkpt_side)
        , to_checkpoint(to_chkpt)
        , dist(d)
    {}
};

struct discovery
{
    int elem;
    int dist_to_checkpoint;
    int from_checkpoint;
    int checkpoint_side;

    discovery(int el, int dist_to_chkpt, int from_chkpt, int chkpt_side)
        : elem(el)
        , dist_to_checkpoint(dist_to_chkpt)
        , from_checkpoint(from_chkpt)
        , checkpoint_side(chkpt_side)
    {}
};

int NODES, ME, N, QUERIES, STEP;

checkpoint info[MAX_CHECKPOINTS];

PI Neighbors(int n)
{
    return make_pair(FirstNeighbor(n), SecondNeighbor(n));
}

int OtherNeighbor(int n, int not_that_one)
{
    PI neighbors = Neighbors(n);
    return neighbors.first != not_that_one ? neighbors.first : neighbors.second;
}

bool IsMyCheckpoint(int n)
{
    return ((n / CHECKPOINT_INTERVAL) % NODES) == ME;
}

bool IsCheckpoint(int n)
{
    return (n % CHECKPOINT_INTERVAL) == 0;
}

int CheckpointToIndex(int n)
{
    return n / CHECKPOINT_INTERVAL;
}

int CheckpointFromIndex(int index)
{
    return index * CHECKPOINT_INTERVAL;
}

int CheckpointIndexWithinNode(int n)
{
    return n / (NODES * CHECKPOINT_INTERVAL);
}

int main()
{
    NODES = NumberOfNodes();
    ME = MyNodeId();
    N = NumberOfStudents();
    QUERIES = NumberOfQueries();
    STEP = CHECKPOINT_INTERVAL * NODES;

    if (N <= CHECKPOINT_INTERVAL)
    {
        if (ME == 0)
        {
            vector<int> t(N), m(N + 1);

            t[0] = 1;
            t[1] = FirstNeighbor(t[0]);

            for (int i = 2; i < N; ++i)
            {
                t[i] = OtherNeighbor(t[i - 1], t[i - 2]);
                m[t[i]] = i;
            }

            m[t[0]] = 0;
            m[t[1]] = 1;

            for (int i = 1; i <= QUERIES; ++i)
            {
                int from = QueryFrom(i);
                int to = QueryTo(i);

                int frompos = m[from];
                int topos = m[to];

                PI p = minmax(frompos, topos);

                int dist = p.second - p.first;

                printf("%d\n", min(dist, N - dist));
            }
        }

        return 0;
    }

    vector<int> queries;
    queries.reserve(2 * QUERIES);
    list<meeting> meetings;
    map<int, list<discovery> > discoveries;

    for (int query = 1; query <= QUERIES; ++query)
    {
        queries.push_back(QueryFrom(query) - 1);
        queries.push_back(QueryTo(query) - 1);
    }

    sort(queries.begin(), queries.end());
    
    for (int i = ME * CHECKPOINT_INTERVAL; i < N; i += STEP)
    {
        PI s = Neighbors(i + 1);

        int left = OtherNeighbor(i + 1, s.first) - 1;
        int right = OtherNeighbor(i + 1, s.second) - 1;

        if (binary_search(queries.begin(), queries.end(), i))
        {
            discoveries[i].emplace_back(i, 0, i, -1);
        }

        int dist = 1;

        int r = right;
        int prev_r = i;
        const int right_checkpoint_side = r;
        int l = left;
        int prev_l = i;
        const int left_checkpoint_side = l;

        bool go_left = true;
        bool go_right = true;

        while (go_left || go_right)
        {            
            if (go_left)
            {
                if (IsCheckpoint(l))
                {
                    meetings.emplace_back(i, left_checkpoint_side, l, dist);
                    go_left = false;
                }
                else
                {
                    if (binary_search(queries.begin(), queries.end(), l))
                    {
                        discoveries[l].emplace_back(l, dist, i, left_checkpoint_side);
                    }

                    int next_l = OtherNeighbor(l + 1, prev_l + 1) - 1;
                    prev_l = l;
                    l = next_l;
                }
            }

            if (go_right)
            {
                if (IsCheckpoint(r))
                {
                    meetings.emplace_back(i, right_checkpoint_side, r, dist);
                    go_right = false;
                }
                else
                {
                    if (binary_search(queries.begin(), queries.end(), r))
                    {
                        discoveries[r].emplace_back(r, dist, i, right_checkpoint_side);
                    }

                    int next_r = OtherNeighbor(r + 1, prev_r + 1) - 1;
                    prev_r = r;
                    r = next_r;
                }
            }

            ++dist;
        }
    }

    if (ME == 0)
    {
        list<meeting>::const_iterator mit = meetings.begin(), mitend = meetings.end();
        for (; mit != mitend; ++mit)
        {
            const meeting& meet = *mit;
            const int id = CheckpointToIndex(meet.from_checkpoint);
            checkpoint& c = info[id];
            if (c.left_checkpoint == -1)
            {
                c.left_checkpoint = meet.to_checkpoint;
                c.left_side = meet.from_checkpoint_side;
                c.left_dist = meet.dist;
            }
            else if (c.right_checkpoint == -1)
            {
                c.right_checkpoint = meet.to_checkpoint;
                c.right_side = meet.from_checkpoint_side;
                c.right_dist = meet.dist;
            }
        }

        for (int i = 1; i < NODES; ++i)
        {
            const int node = Receive(-1);
            const int ile = GetInt(node);

            for (int j = 0; j < ile; ++j)
            {
                int from_checkpoint = GetInt(node);
                int from_checkpoint_side = GetInt(node);
                int to_checkpoint = GetInt(node);
                int dist = GetInt(node);
                
                const int id = CheckpointToIndex(from_checkpoint);
                checkpoint& c = info[id];
                if (c.left_checkpoint == -1)
                {
                    c.left_checkpoint = to_checkpoint;
                    c.left_side = from_checkpoint_side;
                    c.left_dist = dist;
                }
                else if (c.right_checkpoint == -1)
                {
                    c.right_checkpoint = to_checkpoint;
                    c.right_side = from_checkpoint_side;
                    c.right_dist = dist;
                }
            }
        }

        for (int i = 1; i < NODES; ++i)
        {
            PutChar(i, 'C');
            Send(i);
        }

        for (int i = 1; i < NODES; ++i)
        {
            const int node = Receive(-1);
            const int ile = GetInt(node);

            for (int j = 0; j < ile; ++j)
            {
                int elem = GetInt(node);
                int dist_to_checkpoint = GetInt(node);
                int from_checkpoint = GetInt(node);
                int checkpoint_side = GetInt(node);
                discoveries[elem].emplace_back(elem, dist_to_checkpoint, from_checkpoint, checkpoint_side);
            }
        }

        for (int query = 1; query <= QUERIES; ++query)
        {
            int ans = 0;
            int from = QueryFrom(query) - 1;
            int to = QueryTo(query) - 1;

            if (from == to)
            {
                printf("0\n");
                continue;
            }

            discovery& disc = discoveries[from].front();
            
            bool found = false;
            int current_checkpoint = disc.from_checkpoint;
            int dist = disc.dist_to_checkpoint;
            int side = disc.checkpoint_side;

            while (!found)
            {
                list<discovery>::const_iterator dit = discoveries[to].begin(), ditend = discoveries[to].end();
                for (; dit != ditend; ++dit)
                {
                    const discovery& target_disc = *dit;
                    if (target_disc.from_checkpoint == current_checkpoint)
                    {
                        if (target_disc.checkpoint_side != side)
                        {
                            ans = dist + target_disc.dist_to_checkpoint;
                            found = true;
                            break;
                        }
                    }
                }

                if (found)
                {
                    ans %= N;
                    if (ans > N/2)
                    {
                        ans = N - ans;
                    }
                    printf("%d\n", ans);
                    break;
                }

                checkpoint& c = info[CheckpointToIndex(current_checkpoint)];

                int next_checkpoint = -1;
                if (c.left_side == side)
                {
                    next_checkpoint = c.right_checkpoint;
                    dist += c.right_dist;
                }
                else
                {
                    next_checkpoint = c.left_checkpoint;
                    dist += c.left_dist;
                }

                checkpoint& nc = info[CheckpointToIndex(next_checkpoint)];
                if (nc.left_checkpoint == current_checkpoint)
                {
                    side = nc.left_side;
                }
                else
                {
                    side = nc.right_side;
                }

                current_checkpoint = next_checkpoint;
            }
        }
    }
    else
    {
        int mile = meetings.size();
        PutInt(0, mile);
        list<meeting>::const_iterator mit = meetings.begin(), mitend = meetings.end();
        for (; mit != mitend; ++mit)
        {
            const meeting& meet = *mit;
            PutInt(0, meet.from_checkpoint);
            PutInt(0, meet.from_checkpoint_side);
            PutInt(0, meet.to_checkpoint);
            PutInt(0, meet.dist);
        }
        Send(0);

        Receive(0);
        char dummy = GetChar(0);

        int dile = 0;
        map<int, list<discovery> >::const_iterator dmit = discoveries.begin(), dmitend = discoveries.end();
        for (; dmit != dmitend; ++dmit)
        {
            const list<discovery>& disclist = dmit->second;
            dile += disclist.size();
        }

        PutInt(0, dile);
        dmit = discoveries.begin(), dmitend = discoveries.end();
        for (; dmit != dmitend; ++dmit)
        {
            const list<discovery>& disclist = dmit->second;
            
            list<discovery>::const_iterator dit = disclist.begin(), ditend = disclist.end();
            for (; dit != ditend; ++dit)
            {
                const discovery& disc = *dit;
                PutInt(0, disc.elem);
                PutInt(0, disc.dist_to_checkpoint);
                PutInt(0, disc.from_checkpoint);
                PutInt(0, disc.checkpoint_side);
            }
        }
        Send(0);
    }

    return 0;
}