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
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
#include <complex>
#include <sstream>
using namespace std;

#include "cielib.h"
 
typedef long long LL;
typedef unsigned long long ULL;
typedef long double LD;
typedef vector<int> VI;
typedef pair<int,int> PII;
 
#define REP(i,n) for(int i=0;i<(n);++i)
#define SIZE(c) ((int)((c).size()))
#define FOR(i,a,b) for (int i=(a); i<(b); ++i)
#define FOREACH(i,x) for (__typeof((x).begin()) i=(x).begin(); i!=(x).end(); ++i)
#define FORD(i,a,b) for (int i=(a)-1; i>=(b); --i)
#define ALL(v) (v).begin(), (v).end()
 
#define pb push_back
#define mp make_pair
#define st first
#define nd second

vector<PII> ranges(200), new_ranges(200);
int query[200];
bool compare(int d, int a, int b) { // true if [...a...] < [...b...]
    int tmp = query[d];
    query[d] = b;
    czyCieplo(query);
    query[d] = a;
    bool result = czyCieplo(query);
    query[d] = tmp;
    return result;
}

int main() {
    ios_base::sync_with_stdio(0);

    int D = podajD(), R = podajR();
    REP(i,D) ranges[i] = PII(0, R);
    
    int curR = R;
    while (curR > 1) {
        int half = (curR + 1) / 2;
        REP(i,D) query[i] = ranges[i].st + half;
        REP(i,D) {
            if (compare(i, ranges[i].st, ranges[i].nd)) {
                new_ranges[i] = PII(ranges[i].st, ranges[i].st + half);
            } else {
                new_ranges[i] = PII(ranges[i].nd - half, ranges[i].nd);
            }
        }
        
        curR = half;
        ranges = new_ranges;
    }
 
    REP(i,D) query[i] = ranges[i].st;

    REP(i,D) {
        if (compare(i, ranges[i].nd, ranges[i].st)) {
            query[i] = ranges[0].nd;
            znalazlem(query);
            return 0;
        } else if (compare(i, ranges[i].st, ranges[i].nd)) {
            znalazlem(query);
            return 0;
        }
    
        if (ranges[i].nd < R) {
            query[i] = compare(i, ranges[i].nd, ranges[i].nd+1) ? ranges[i].st : ranges[i].nd;
        } else {
            query[i] = compare(i, ranges[i].st, ranges[i].st-1) ? ranges[i].nd : ranges[i].st;
        }
    }
    
    // Should never get here
    znalazlem(query);
}