結果

問題 No.3400 Nana's Plus Permutation Game (7 + 7) ÷ 7
コンテスト
ユーザー noya2
提出日時 2025-12-08 21:17:45
言語 C++23
(gcc 13.3.0 + boost 1.89.0)
結果
AC  
実行時間 1,254 ms / 2,777 ms
コード長 10,053 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 3,345 ms
コンパイル使用メモリ 302,972 KB
実行使用メモリ 410,612 KB
平均クエリ数 20274.96
最終ジャッジ日時 2025-12-08 21:19:20
合計ジャッジ時間 81,241 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 77
権限があれば一括ダウンロードができます

ソースコード

diff #
raw source code 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

// 18:53

// bool LOCAL = true;
bool LOCAL = false;
vector<int> jp;
mt19937 mt(-1);

void solve(){
    int n; in(n);
    if (LOCAL){
        jp.resize(n); iota(all(jp),1);
        shuffle(all(jp),mt);
        out("p:",jp); cout << flush;
    }
    vector memo(n,vector<int>(n,-2));
    int qlim = 3*n;
    int takecnt = 0, proccnt = 0, lastcnt = 0;
    auto jadd = [&](int type){
        if (type == -1) return ;
        if (type == 0){
            takecnt++;
        }
        else if (type == 1){
            proccnt++;
        }
        else if (type == 2){
            lastcnt++;
        }
        else {
            abort();
        }
    };
    auto ask = [&](int i, int j, int type = -1) -> int {
        if (i > j) swap(i,j);
        assert(0 <= i && i < j && j < n);
        if (memo[i][j] != -2){
            return memo[i][j];
        }
        jadd(type);
        // assert(qlim >= 1);
        qlim--;
        if (LOCAL){
            int sum = jp[i] + jp[j];
            rep(k,n){
                if (jp[k] == sum){
                    return memo[i][j] = k;
                }
            }
            return memo[i][j] = -1;
        }
        cout << "1 " << i+1 << ' ' << j+1 << endl;
        int ret; in(ret);
        if (ret != -1) ret--;
        return memo[i][j] = ret;
    };
    
    auto say = [&](vector<int> p){
        assert(ssize(p) == n);
        if (LOCAL){
            assert(p == jp);
            out("ok");
            out("qnum:",3*n-qlim);
            out(takecnt,proccnt,lastcnt);
            if (qlim < 0){
                out("over",-qlim);
            }
            cout << flush;
            return ;
        }
        cout << "2 " << p << endl;
    };
    random_device rd;
    // mt19937 gen(rd());
    mt19937 gen(-1);
    auto dfs = [&](auto sfs, vector<int> ids) -> vector<int> {
        // out("ids",ids); cout << flush;
        int sz = ids.size();
        assert(sz >= 1);
        if (sz <= 2){
            return ids;
        }
        uniform_int_distribution<int> dist(0,sz-1);
        auto take2 = [&]() -> pii {
            int i = dist(gen);
            while (true){
                int j = dist(gen);
                if (i != j){
                    return {ids[i],ids[j]};
                }
            }
            abort();
        };
        set<int> st(all(ids));
        auto takenotmax = [&](){
            // int many = 20;
            while (true){
            // while (many--){
                auto [i, j] = take2();
                int k = ask(i,j,0);
                if (st.contains(k)){
                    return i;
                }
            }
            abort();
        };
        int pivot = takenotmax();
        // out("pivot",pivot); cout << flush;
        vector<int> ks(sz,-2);
        set<int> kst;
        int ngcnt = 0;
        rep(i,sz){
            if (ids[i] == pivot) continue;
            ks[i] = ask(pivot,ids[i],1);
            if (!st.contains(ks[i])){
                ks[i] = -1;
            }
            if (ks[i] != -1){
                kst.insert(ks[i]);
            }
            else {
                ngcnt++;
            }
        }
        vector<int> nids;
        int okcnt = 0;
        rep(i,sz){
            if (ids[i] == pivot) continue;
            if (ks[i] != -1) okcnt++;
            if (ks[i] != -1 && !kst.contains(ids[i])){
                nids.emplace_back(ids[i]);
            }
        }
        int pval = ngcnt;
        if (pval == 1){
            nids.emplace_back(pivot);
        }
        if (pval*3 > sz || pval == 1){
            return sfs(sfs,nids);
        }
        int mi = iinf, del = -1;
        for (int i : nids){
            int cnt = 0;
            int pre = i;
            while (pre != -1){
                cnt++;
                pre = ask(pivot,pre,1);
                if (!st.contains(pre)){
                    pre = -1;
                }
            }
            if (chmin(mi,cnt)){
                del = i;
            }
        }
        vector<int> nnids;
        for (int i : nids){
            if (i == del) continue;
            nnids.emplace_back(i);
        }
        return sfs(sfs,nnids);
    };
    vector<int> ini(n); iota(all(ini),0);
    auto sml = dfs(dfs,ini);
    if (sml.size() == 1u){
        int i1 = sml[0];
        if (LOCAL){
            assert(jp[i1] == 1);
        }
        vector<int> ks(n);
        vector<bool> ex(n,false);
        rep(i,n){
            if (i == i1) continue;
            ks[i] = ask(i1,i,2);
            if (ks[i] != -1){
                ex[ks[i]] = true;
            }
        }
        int i2 = -1;
        rep(i,n){
            if (i == i1) continue;
            if (!ex[i]){
                assert(i2 == -1);
                i2 = i;
            }
        }
        assert(i2 != -1);
        vector<int> p(n);
        p[i1] = 1;
        p[i2] = 2;
        for (int x = 3, i = i2; x <= n; x++){
            int ni = ask(i1,i,2);
            assert(ni != -1);
            p[ni] = x;
            i = ni;
        }
        say(p);
        return ;
    }
    int i1 = sml[0], i2 = sml[1];
    vector<int> p(n);
    p[i1] = 1;
    p[i2] = 2;
    bool ok = true;
    vector<int> ids;
    for (int x = 3, i = i2; x <= n; x++){
        ids.emplace_back(i);
        int ni = ask(i1,i,2);
        if (ni == -1){
            ok = false;
            break;
        }
        p[ni] = x;
        i = ni;
    }
    if (ok){
        say(p);
        return ;
    }
    swap(i1,i2);
    int len = ids.size();
    assert(len == (n+1)/2);
    rep(i,len){
        p[ids[i]] = i*2+1;
    }
    p[i2] = 2;
    repp(i,1,len-1){
        int ni = ask(ids[i],i1,2);
        p[ni] = i*2+2;
    }
    say(p);
}

int main(){
    int t = 1; in(t);
    while (t--) { solve(); }
}
0