Submission #489315

#	Time	Username	Problem	Language	Result	Execution time	Memory
489315		balbit	Minerals (JOI19_minerals)	C++14	90 / 100	68 ms	3008 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define y1 zck_is_king
#define pii pair<int, int>
#define ull unsigned ll
#define f first
#define s second
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)x.size()
#define SQ(x) (x)*(x)
#define MN(a,b) a = min(a,(__typeof__(a))(b))
#define MX(a,b) a = max(a,(__typeof__(a))(b))
#define pb push_back
#define REP(i,n) for (int i = 0; i<n; ++i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define RREP(i,n) for (int i = n-1; i>=0; --i)
#define REP1(i,n) for (int i = 1; i<=n; ++i)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#ifdef BALBIT
#define IOS()
#define bug(...) fprintf(stderr,"#%d (%s) = ",__LINE__,#__VA_ARGS__),_do(__VA_ARGS__);
template<typename T> void _do(T &&x){cerr<<x<<endl;}
template<typename T, typename ...S> void _do(T &&x, S &&...y){cerr<<x<<", ";_do(y...);}
#else
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#define endl '\n'
#define bug(...)
#endif

const int iinf = 1e9+10;
const ll inf = 1ll<<60;
const ll mod = 1e9+7 ;


void GG(){cout<<"0\n"; exit(0);}

ll mpow(ll a, ll n, ll mo = mod){ // a^n % mod
    ll re=1;
    while (n>0){
        if (n&1) re = re*a %mo;
        a = a*a %mo;
        n>>=1;
    }
    return re;
}

ll inv (ll b, ll mo = mod){
    if (b==1) return b;
    return (mo-mo/b) * inv(mo%b,mo) % mo;
}

const int maxn = 1e5+5;
namespace {

vector<int> g1, g2; // group 1, group 2, each is a permutation
bool in[maxn]; // 0-based

int to[maxn]; // to[A] = B => g1[A] matches with g2[B]

int lst = 0;
int QU(int x) {
    in[x] ^= 1;
    return lst = Query(x+1);
}
};


void gogo(int l, int r, vector<int> a) {
    assert(r-l+1 == SZ(a));
    bug(l,r);
//    for (int x : a) cout<<x<<' ';
//    cout<<endl;
    if (l == r) {
        to[a[0]] = l;
        return;
    }
    int mid = (l+r)/2;
    // flip the range from mid+1 to r
    for (int i = mid+1; i<=r; ++i) {
        QU(g2[i]);
    }

    vector<int> tol, tor;
    random_shuffle(ALL(a));
    int i = 0;
    for (i = 0; i<SZ(a); ++i) {
        if (SZ(tor) == (r-mid) || SZ(tol) == (mid-l+1)) {
            if (SZ(tol) < (mid-l+1)) {
                tol.pb(a[i]);
            }
            else {
                tor.pb(a[i]);
            }
            continue;
        }
        int pv = lst;
        bool inset = QU(g1[a[i]]) != pv;
        bool setisleft = in[g2[l]];
        if (inset ^ setisleft ^ 1) {
            tor.pb(a[i]);
//            bug(a[i], "going right");
        }else{
            tol.pb(a[i]);
//            bug(a[i], "going left");
        }
    }
    gogo(l,mid,tol); gogo(mid+1,r,tor);
}

void Solve(int N) {
    int prv = 0;
    REP(i,N*2) {
        if (QU(i) != prv) {
            ++prv; g1.pb(i);
        }else{
            g2.pb(i);
        }
    }
    #ifdef BALBIT
    for (int x : g1) cout<<x<<' ';
    cout<<endl;
    for (int x : g2) cout<<x<<' ';
    cout<<endl;
    #endif // BALBIT

    // now, everything is inside the mineral machine

//    bool inside = 1;
//
//    RREP(bit, 16) {
//        // which bit do I care about?
//        int needmove = 0;
//        REP(i,N) {
//            if (((i>>bit)&1) ^ in[g2[i]]) {
//                ++needmove; // need to move if
//            }
//        }
//        bool flp = 0;
//        if (N-needmove < needmove) {
//            flp = 1;
//        }
//        REP(i,N) {
//            if (((i>>bit)&1) ^ flp ^ in[g2[i]]) {
//                QU(g2[i]);
//            }
//        }
//
//        REP(i,N) {
//            int tmp = lst;
//            if ((QU(g1[i]) != tmp) ^ flp ^ 1) {
//                // this is inside the set of g2
//                to[i] += (1<<bit);
//            } // remove it
//        }
//    }
    vector<int> st(N);
    REP(i,N) st[i] = i;
    gogo(0,N-1,st);

    REP(i,N) {
        bug(i, to[i]);
    }

    REP(i,N) {
        Answer(1+g1[i], 1+g2[to[i]]);
    }

}




/*
4
1 5
2 6
3 4
7 8
*/

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 9
• Subtask 4: 30 / 30
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 0 / 10