Submission #122198

#	Time	Username	Problem	Language	Result	Execution time	Memory
122198		duality	Minerals (JOI19_minerals)	C++14	0 / 100	2 ms	384 KiB

minerals

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "minerals.h"

int p = 0;
int in[86001];
int test(int x) {
    in[x] ^= 1;
    int q = Query(x);
    if (p != q) {
        p = q;
        return 1;
    }
    else return 0;
}
int order[86000],ans[43000],num[1 << 15];
void Solve(int N) {
    int i,j;
    for (i = 0; i < 2*N; i++) order[i] = i+1;
    srand(1234);
    random_shuffle(order,order+2*N);
    vi a,b;
    for (i = 0; i < 2*N; i++) {
        if ((p < N) && test(order[i])) a.pb(order[i]);
        else b.pb(order[i]);
    }
    int l = 0;
    for (i = 0; (1 << i) < N; i++) l = i;
    for (i = 0; (1 << i) < N; i++) {
        for (j = 0; j < b.size(); j++) {
            if ((1 << (i+1)) >= N) {
                if (j < (N-(1 << i))) {
                    if (((j & (1 << i)) > 0) != in[b[j]]) test(b[j]);
                }
            }
            else if (((j & (1 << i)) > 0) == in[b[j]]) test(b[j]);
        }
        fill(num,num+(1 << i),0);
        for (j = 0; j < N; j++) {
            if (j & (1 << i)) num[j & ((1 << i)-1)]++;
            order[j] = j;
        }
        random_shuffle(order,order+N);
        for (j = 0; j < a.size(); j++) {
            if (num[ans[order[j]]] == 0) continue;
            if ((1 << (i+1)) >= N) {
                if (ans[order[j]] < (N-(1 << i))) {
                    if (!test(a[order[j]])) num[ans[order[j]]]--,ans[order[j]] |= (1 << i);
                }
            }
            else if (test(a[order[j]])) num[ans[order[j]]]--,ans[order[j]] |= (1 << i);
        }
    }
    for (i = 0; i < N; i++) Answer(a[i],b[ans[i]]);
}

Compilation message (stderr)

minerals.cpp: In function 'void Solve(int)':
minerals.cpp:84:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < b.size(); j++) {
                     ~~^~~~~~~~~~
minerals.cpp:98:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < a.size(); j++) {
                     ~~^~~~~~~~~~
minerals.cpp:81:9: warning: variable 'l' set but not used [-Wunused-but-set-variable]
     int l = 0;
         ^

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