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
import java.util.ArrayList;
import java.util.List;

public class cie {
    static class DimensionInfo {
        int min;
        int max;
        int pos;
        boolean directionUp;

        DimensionInfo(int r) {
            min = 0;
            max = r;
            pos = 0;
            directionUp = true;
        }
    }

    public static void main(String[] args) {
        int d = cielib.podajD();
        int r = cielib.podajR();
        DimensionInfo[] dims = new DimensionInfo[d];
        for (int i = 0; i < d; i++) {
            dims[i] = new DimensionInfo(r);
        }
        cielib.czyCieplo(new int[d]);

        boolean stop = false;
        while (true) {
            if (!stop && canBeImproved(dims)) {
                stop = improve(dims);
            } else {
                lastStep(dims);
                break;
            }
        }
    }

    private static boolean improve(DimensionInfo[] dims) {
        List<DimensionInfo> longest = findLongest(dims, 0, dims.length);
        optimizeLongest(longest);
        if (!longest.isEmpty()) {
            DimensionInfo di = longest.get(0);
            if (di.max - di.min == 1) {
                return true;
            }
        }
        for (DimensionInfo l : longest) {
            if (l.directionUp) {
                l.pos = l.max;
            } else {
                l.pos = l.min;
            }
        }
        if (cielib.czyCieplo(genQuery(dims)) == 1) {
            commitDims(longest);
        } else {
            moveDimsToHalfWayAndCommit(longest);
            cielib.czyCieplo(genQuery(dims));
        }

        return false;
    }

    private static void moveDimsToHalfWayAndCommit(List<DimensionInfo> longest) {
        for (DimensionInfo l : longest) {
            l.directionUp = !l.directionUp;
            int length = Math.max(1, (l.max - l.min) / 2);
            if (l.directionUp) {
                l.min = Math.min(l.max - 1, l.min + length);
                l.pos = l.min;
            } else {
                l.max = Math.max(l.max - length, l.min + 1);
                l.pos = l.max;
            }
        }
    }

    private static void commitDims(List<DimensionInfo> longest) {
        for (DimensionInfo l : longest) {
            l.directionUp = !l.directionUp;
            int length = Math.max(1, (l.max - l.min) / 2);
            if (l.directionUp) {
                l.max = l.min + length;
            } else {
                l.min = l.max - length;
            }
        }
    }

    private static void optimizeLongest(List<DimensionInfo> longest) {
        int minLength = -1;
        for (DimensionInfo l : longest) {
            int length = l.max - l.min;
            if (minLength == -1) {
                minLength = length;
            } else {
                minLength = Math.min(length, minLength);
            }
        }
        for (DimensionInfo l : longest) {
            if (l.directionUp) {
                l.max = l.min + minLength;
            } else {
                l.min = l.max - minLength;
            }
        }
    }

    static List<DimensionInfo> findLongest(DimensionInfo[] dims, int from, int to) {
        List<DimensionInfo> left = new ArrayList<>();

        if (to - from == 1) {
            boolean better = cielib.czyCieplo(genOneStepQueryExceptRange(dims, from, to)) == 1;
            cielib.czyCieplo(genQuery(dims));
            if (better) {
                return left;
            }
            left.add(dims[from]);
            return left;
        }

        boolean better = cielib.czyCieplo(genOneStepQueryExceptRange(dims, from, (from + to) / 2)) == 1;
        cielib.czyCieplo(genQuery(dims));
        if (better) {
            return findLongest(dims,(to + from) / 2, to);
        }
        better = cielib.czyCieplo(genOneStepQueryExceptRange(dims, (from + to) / 2, to)) == 1;
        cielib.czyCieplo(genQuery(dims));
        if (better) {
            return findLongest(dims, from, (to + from) / 2);
        }
        left = findLongest(dims, from, (from + to) / 2);
        List<DimensionInfo> right = findLongest(dims, (from + to) / 2, to);

        List<DimensionInfo> result = new ArrayList<>(left.size() + right.size());
        for (DimensionInfo d : left) {
            result.add(d);
        }
        for (DimensionInfo d : right) {
            result.add(d);
        }
        return result;
    }


    static boolean canBeImproved(DimensionInfo[] dims) {
        int[] step = genOneStepQuery(dims);
        int[] back = genQuery(dims);
        boolean improved = cielib.czyCieplo(step) == 1;
        cielib.czyCieplo(back);

        return improved;
    }

    static int[] genQuery(DimensionInfo[] dims) {
        int[] query = new int[dims.length];
        for (int i = 0; i < dims.length; i++) {
            query[i] = dims[i].pos;
        }
        return query;
    }

    private static int[] genOneStepQuery(DimensionInfo[] dims) {
        int[] query = new int[dims.length];
        for (int i = 0; i < dims.length; i++) {
            query[i] = dims[i].pos + (dims[i].directionUp ? 1 : -1);
        }
        return query;
    }

    private static int[] genOneStepQueryExceptRange(DimensionInfo[] dims, int from, int to) {
        int[] query = new int[dims.length];
        for (int i = 0; i < from; i++) {
            query[i] = dims[i].pos + (dims[i].directionUp ? 1 : -1);
        }
        for (int i = from; i < to; i++) {
            query[i] = dims[i].pos;
        }
        for (int i = to; i < dims.length; i++) {
            query[i] = dims[i].pos + (dims[i].directionUp ? 1 : -1);
        }
        return query;
    }

    static void lastStep(DimensionInfo[] dims) {
        for (int i = 0; i < dims.length; i++) {
            DimensionInfo d = dims[i];
            if (d.min == d.max) {
                continue;
            }
            if (isGood(i, d, dims)) {
                continue;
            }
            d.pos += d.directionUp ? 1 : -1;
        }

        cielib.znalazlem(genQuery(dims));
    }

    private static boolean isGood(int i, DimensionInfo d, DimensionInfo[] dims) {
        int[] query = genQuery(dims);
        query[i] += d.directionUp ? 2 : -2;
        cielib.czyCieplo(query);
        return cielib.czyCieplo(genQuery(dims)) == 1;
    }
}