Temp-Paper/shiftstrategy.cpp at master · MokriyYuriy/Temp-Paper · GitHub

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
#include "strategy.h"
//#include "simpletools.h"

static std::vector <int> FindAllCows(Player *player, std::size_t n, std::size_t m) {
    std::vector <int> first_set, second_set;
    bool is_first_answer;
    if (n == m) {
        std::vector <int> answer(n);
        for (std::size_t i = 0; i < n; i++) {
            answer[i] = i;
        }
        return answer;
    }
    first_set.push_back(0);
    for (std::size_t i = 1; i < m; i++) {
        Response zero_query, i_query;
        std::size_t p = 0;
        std::vector <int> query_string(n);
        for (std::size_t j = 1; p != n - 1; j++) {
            if (j == i) continue;
            query_string[p++] = j;
        }
        query_string.back() = 0;
        zero_query = player->query(query_string);
        query_string.back() = i;
        i_query = player->query(query_string);
        if (zero_query.get_cows_and_bulls() == i_query.get_cows_and_bulls()) {
            first_set.push_back(i);
        } else {
            second_set.push_back(i);
            if (zero_query.get_cows_and_bulls() > i_query.get_cows_and_bulls()) {
                is_first_answer = true;
            } else {
                is_first_answer = false;
            }
        }
    }
    if (is_first_answer) return first_set;
    return second_set;
}

static std::vector <int> FindPermutation(Player *player, std::vector <int> string, std::size_t n, std::size_t m) {
    std::vector <int> answer(n);
    if (n == 1) return string;
    for (std::size_t i = 0; i < n; i++, std::rotate(string.begin(), string.begin() + 1, string.end())) {
        bool is_first_answer = true;
        std::vector <int> first_set, second_set, bulls;
        Response zero_query = player->query(string);
        if (zero_query.get_bulls() == 0) continue;
        if (zero_query.get_bulls() == (int)n) return string;
        first_set.push_back(0);
        for (std::size_t j = 1; j < n; j++) {
            std::swap(string[0], string[j]);
            Response j_query = player->query(string);
            std::swap(string[0], string[j]);
            if (j_query.get_bulls() >= zero_query.get_bulls()) {
                is_first_answer = false;
                first_set.push_back(j);
            } else if (j_query.get_bulls() + 1 == zero_query.get_bulls()) {
                second_set.push_back(j);
            } else {
                is_first_answer = true;
                first_set.push_back(j);
            }
        }
        bulls = (is_first_answer ? first_set : second_set);
        for (std::size_t j = 0; j < bulls.size(); j++) {
            answer[bulls[j]] = string[bulls[j]];
        }
    }
    return answer;
}

static int BinSearchQuery(Player *player, const std::vector <int> &string, int left,
                          int right, std::size_t n, std::size_t m) {
    std::vector <bool> used(std::min(n * 2, m), false);
    std::vector <int> query_string(n);
    std::size_t p = 0;
    for (std::size_t i = 0; i < n; i++) {
        if (string[i] < (int)used.size()) used[string[i]] = true;
    }
    for (int i = 0; i < (int)n; i++) {
        if (i >= left && i < right) {
            query_string[i] = string[i];
        } else {
            while (used[p]) p++;
            query_string[i] = p++;
        }
    }
    return (player->query(query_string)).get_bulls();
}

static std::size_t BinSearch(Player *player, const std::vector <int> &string, int left,
                             int right, std::size_t n, std::size_t m, int cnt_bulls) {
    while (left + 1 < right) {
        int middle = (left + right) / 2;
        if (BinSearchQuery(player, string, 0, middle + 1, n, m) - cnt_bulls > 0) {
            right = middle;
        } else {
            left = middle;
        }
    }
    return right;
}

static std::vector <int> BinSearchFindPermutation(Player *player, std::vector <int> string, std::size_t n, std::size_t m) {
    if (n == 1) return string;
    std::vector <int> answer(n);
    for (std::size_t i = 0; i < n; i++, std::rotate(string.begin(), string.begin() + 1, string.end())) {
        Response query = player->query(string);
        if (query.get_bulls() == (int)n) return string;
        int previous_bull = -1;
        for (int j = 0; j < query.get_bulls(); j++) {
            previous_bull = BinSearch(player, string, previous_bull, (int)n - 1, n, m, j);
            answer[previous_bull] = string[previous_bull];
        }
    }
    return answer;
}

int SimpleShiftStrategy(Player *player, std::size_t n, std::size_t m) {
    std::vector <int> string = FindAllCows(player, n, m);
    string = FindPermutation(player, string, n, m);
    player->query(string);
    return player->get_score();
}

int AdvancedShiftStrategy(Player *player, std::size_t n, std::size_t m) {
    std::vector <int> string = FindAllCows(player, n, m);
    if (n * 2 <= m) {
        string = BinSearchFindPermutation(player, string, n, m);
    } else {
        string = FindPermutation(player, string, n, m);
    }
    player->query(string);
    return player->get_score();
}