Hugging Face's logo

JustinTX
/
shinka-backup

Model card Files
xet
 Community
shinka-backup
File size: 2,857 Bytes
14c9c2b
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
#include <bits/stdc++.h>
using namespace std;

static mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int ask(const vector<int>& q) {
    cout << 0;
    for (int x : q) {
        cout << ' ' << x;
    }
    cout << '\n';
    cout.flush();
    int x;
    if (!(cin >> x)) exit(0);
    if (x < 0) exit(0);
    return x;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n;
    if (!(cin >> n)) return 0;

    if (n == 1) {
        cout << "1 1\n";
        cout.flush();
        return 0;
    }

    uniform_int_distribution<int> dist(1, n);

    vector<int> base(n);
    int baseAns = -1;

    // Find a base query with zero matches
    while (true) {
        for (int i = 0; i < n; ++i) base[i] = dist(rng);
        baseAns = ask(base);
        if (baseAns == 0) break;
    }

    vector<int> remaining_positions(n);
    iota(remaining_positions.begin(), remaining_positions.end(), 0);
    vector<int> pos_of_value(n + 1, -1);

    vector<int> temp(n);

    for (int v = 1; v <= n; ++v) {
        if ((int)remaining_positions.size() == 1) {
            pos_of_value[v] = remaining_positions[0];
            remaining_positions.pop_back();
            break;
        }

        vector<int> candidates = remaining_positions;

        while ((int)candidates.size() > 1) {
            int m = (int)candidates.size();
            int half = m / 2;

            vector<int> left(candidates.begin(), candidates.begin() + half);
            vector<int> right(candidates.begin() + half, candidates.end());

            temp = base;
            for (int idx : left) temp[idx] = v;

            int res = ask(temp); // since base has 0 matches, res is 1 if pos(v) in left, else 0
            if (res == 1) {
                candidates.swap(left);
            } else {
                candidates.swap(right);
            }
        }

        int pos = candidates[0];
        pos_of_value[v] = pos;

        // remove pos from remaining_positions
        auto it = find(remaining_positions.begin(), remaining_positions.end(), pos);
        if (it != remaining_positions.end()) remaining_positions.erase(it);
    }

    // If some values remain (only possible when n>=2), assign last by leftover positions
    while (!remaining_positions.empty()) {
        int pos = remaining_positions.back();
        remaining_positions.pop_back();
        // find an unassigned value
        int v = -1;
        for (int val = 1; val <= n; ++val) {
            if (pos_of_value[val] == -1) { v = val; break; }
        }
        if (v != -1) pos_of_value[v] = pos;
    }

    vector<int> perm(n, 0);
    for (int v = 1; v <= n; ++v) {
        if (pos_of_value[v] != -1) perm[pos_of_value[v]] = v;
    }

    cout << 1;
    for (int i = 0; i < n; ++i) cout << ' ' << perm[i];
    cout << '\n';
    cout.flush();

    return 0;
}