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
#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <cassert>
#include <random>

using namespace std;

typedef long long LL;

#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(val) ((val) < 0 ? -(val) : (val))

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b, e) for(int x = b; 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
const LL INF = 1000000000000000010LL;

#include <cstdlib>
#include "krazki.h"
#include "message.h"

/* PA-2016 R4 rozproszona */

LL pipe [21000000];

int main() {

	int id = MyNodeId();
	int nodes = NumberOfNodes();
	int pipeH = PipeHeight();
	int discH = NumberOfDiscs();

	if(id == 0)
	{
				FOR(i, 1, pipeH)
				{
					LL p = HoleDiameter((LL)i);
					pipe[i] = p;	
				}
				LL mini = INF;
				FOR(i, 1, pipeH)
				{
					mini = MIN(pipe[i], mini);	
					pipe[i] = mini;	
				}

				int p = pipeH + 1;
				FOR(i, 1, discH)
				{
					LL d = DiscDiameter((LL)i);

					p--;
					while(p >= 1 && pipe[p] < d)
					{
						p--;
					}

					if (p == 0)
					{
						break;
					}
				}

				printf("%d\n", p);

		}

		return EXIT_SUCCESS;		
}