Hugging Face's logo

JustinTX
/
shinka-backup

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

const int T = 15;

struct PairXY {
    short x = 0, y = 0;
};

unsigned char bitPos[1005][T];

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;
    }

    int pow3[T + 1];
    pow3[0] = 1;
    for (int i = 1; i <= T; ++i) pow3[i] = pow3[i - 1] * 3;
    int arr_size = pow3[T];

    vector<PairXY> arr(arr_size);

    mt19937 rng((unsigned)chrono::steady_clock::now().time_since_epoch().count());

    // Generate codes for positions with unique difference vectors
    for (int i = 1; i <= n; ++i) {
        while (true) {
            for (int k = 0; k < T; ++k) {
                bitPos[i][k] = (unsigned char)(rng() & 1);
            }
            bool ok = true;
            for (int j = 1; j < i && ok; ++j) {
                int idx1 = 0, idx2 = 0;
                for (int k = 0; k < T; ++k) {
                    int d1 = (int)bitPos[j][k] - (int)bitPos[i][k]; // s[j] - s[i] => (x=i,y=j)
                    int d2 = -d1;                                   // s[i] - s[j] => (x=j,y=i)
                    idx1 = idx1 * 3 + (d1 + 1);
                    idx2 = idx2 * 3 + (d2 + 1);
                }
                if (arr[idx1].x != 0 || arr[idx2].x != 0) {
                    ok = false;
                    break;
                }
            }
            if (ok) {
                for (int j = 1; j < i; ++j) {
                    int idx1 = 0, idx2 = 0;
                    for (int k = 0; k < T; ++k) {
                        int d1 = (int)bitPos[j][k] - (int)bitPos[i][k];
                        int d2 = -d1;
                        idx1 = idx1 * 3 + (d1 + 1);
                        idx2 = idx2 * 3 + (d2 + 1);
                    }
                    arr[idx1].x = (short)i; arr[idx1].y = (short)j; // D = s[j]-s[i] => (x=i,y=j)
                    arr[idx2].x = (short)j; arr[idx2].y = (short)i; // D = s[i]-s[j] => (x=j,y=i)
                }
                break;
            }
        }
    }

    vector<int> posVal(n + 1, -1);

    // Process values in pairs (a,b)
    for (int val = 1; val + 1 <= n; val += 2) {
        int a = val;
        int b = val + 1;
        int D[T];

        for (int k = 0; k < T; ++k) {
            cout << 0;
            for (int i = 1; i <= n; ++i) {
                int v = (bitPos[i][k] ? b : a);
                cout << ' ' << v;
            }
            cout << '\n';
            cout.flush();

            int score;
            if (!(cin >> score)) return 0;
            D[k] = score - 1; // D_k = s_k(pos[b]) - s_k(pos[a])
        }

        int key = 0;
        for (int k = 0; k < T; ++k) {
            key = key * 3 + (D[k] + 1);
        }
        PairXY pr = arr[key];
        int x = pr.x;
        int y = pr.y;
        posVal[a] = x;
        posVal[b] = y;
    }

    if (n % 2 == 1) {
        int last = n;
        vector<char> used(n + 1, 0);
        for (int v = 1; v <= n - 1; ++v) {
            if (posVal[v] >= 1 && posVal[v] <= n)
                used[posVal[v]] = 1;
        }
        int lastpos = 1;
        while (lastpos <= n && used[lastpos]) ++lastpos;
        if (lastpos > n) lastpos = 1;
        posVal[last] = lastpos;
    }

    vector<int> perm(n + 1, 0);
    for (int v = 1; v <= n; ++v) {
        int pos = posVal[v];
        if (pos >= 1 && pos <= n) perm[pos] = v;
    }
    // Fallback (should not be needed)
    for (int i = 1; i <= n; ++i) if (perm[i] == 0) perm[i] = 1;

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

    return 0;
}