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
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
#include <vector>
#include <array>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> para;

#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
#define MP make_pair

#include "krazki.h"
#include "message.h"

int main() {
//Przywroc przed wyslaniem
  if (MyNodeId() != 0) return 0;

  int n=PipeHeight();
  int m=NumberOfDiscs();

  if (m>n) {cout<<"0\n"; return 0;}

  vector<LL> mm;
  mm.reserve(n+1);
  mm.PB(0);
  LL r=HoleDiameter(1);
  mm.PB(r);
  FOR(i,2,n)
    mm.PB(r=min(r, HoleDiameter(i)));

  int last=n+1;
  int a;

  FOR(j,1,m) {
    a=last-1;
    while (a>0 && mm[a]<DiscDiameter(j)) a--;
    last=a;
    if (last==0)
      {cout<<"0\n"; return 0;}
  }

  cout<<last<<endl;
  return 0;
}