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
#include "cielib.h"

#include <vector>
#include <cstdint>
#include <cstdlib>

int k = 0;
int r = 0;
int d = 0;
std::vector<int> best;

int czyCieplo(std::vector<int> pozycja)
{
    int* t = pozycja.data();
    //int t[pozycja.size()];
    //std::copy(pozycja.begin(), pozycja.end(), t);

    if (--k == 0) {
        t = best.data();
    	znalazlem(t);
        exit(0);
    }

    int ret = czyCieplo(t);
    if (ret) best = pozycja;
    return ret;
}

int finish(std::vector<int> solution) 
{
    int step = 1;
    while (true) {
        for (int q = 2; q > 1; --q) {
          bool improved = false;
          for (int i = 0; i < d; ++i)
            {
                std::vector<int> shot(solution.begin(), solution.end());

                bool changed = false;
                if (solution[i] + step <= r) {
                    shot[i] = solution[i] + step;

                    if (czyCieplo(shot)) {
                        solution = shot;
                        improved = true;
                    } else {
                        if(!czyCieplo(solution)) {
                            if (rand() % q) {
                                shot[i] = solution[i] + 1;
                                solution = shot;
                                //czyCieplo(solution);
                                changed = true;
                            }
                        }
                    }
                }

                if (solution[i] - step < 1)
                    continue;

                shot[i] = solution[i] - step;

                if (czyCieplo(shot)) {
                    solution = shot;
                    improved = true;
                } else {
                    if(!czyCieplo(solution)) {
                        if (!changed && rand() % 2) {
                            shot[i] = solution[i] - 1;
                            solution = shot;
                            // czyCieplo(solution);
                        }
                    }
                }
            }
        }
    } // while

}

int main() {
    std::srand(13);

	d = podajD();
    k = podajK();
    r = podajR();

    std::vector<int> solution(d, r/2);
    //for (int i = 0; i < d; ++i)
    //    solution.push_back(r/3 + rand() % (r/3));
    czyCieplo(solution);

    int step = r/2;
    while (step > 0) {
        bool improved = false;
        for (int q = 0; q < 1; ++q)
          for (int i = 0; i < d; ++i)
            {
                std::vector<int> shot(solution.begin(), solution.end());

                bool changed = false;
                if (solution[i] + step <= r) {
                    shot[i] = solution[i] + step;

                    if (czyCieplo(shot)) {
                        solution = shot;
                        improved = true;
                    } else {
                        if(!czyCieplo(solution)) {
                            if (rand() % 2) {
                                shot[i] = solution[i] + ((step+1)/2);
                                solution = shot;
                                // czyCieplo(solution);
                                changed = true;
                            }
                        }
                    }
                }

                if (solution[i] - step < 1)
                    continue;

                shot[i] = solution[i] - step;

                if (czyCieplo(shot)) {
                    solution = shot;
                    improved = true;
                } else {
                    if(!czyCieplo(solution)) {
                        if (!changed & rand() % 2) {
                            shot[i] = solution[i] - ((step+1)/2);
                            solution = shot;
                            // czyCieplo(solution);
                        }
                    }
                }
            }

            if (!improved) {
                step = std::max(int(float(step) * 0.5), 1);

                if (step == 1)
                    finish(solution);
            }
    }
}