Submission #122180

#TimeUsernameProblemLanguageResultExecution timeMemory
122180dualityMinerals (JOI19_minerals)C++14
75 / 100
27 ms2168 KiB
#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 test(int x) {
    int q = Query(x);
    if (p != q) {
        p = q;
        return 1;
    }
    else return 0;
}
int ans[43000];
void Solve(int N) {
    int i,j;
    vi a,b;
    for (i = 1; i <= 2*N; i++) {
        if (test(i)) a.pb(i);
        else b.pb(i);
    }
    for (i = 0; (1 << i) < N; i++) {
        for (j = 0; j < b.size(); j++) {
            if ((i == 0) && !(j & (1 << i))) test(b[j]);
            else if ((i > 0) && (((j & (1 << i)) > 0) != ((j & (1 << (i-1))) > 0))) test(b[j]);
        }
        for (j = 0; j < a.size(); j++) {
            if ((1 << (i+1)) >= N) {
                if (ans[j] < (N-(1 << i))) {
                    if (!test(a[j])) ans[j] |= (1 << i);
                }
            }
            else if (!test(a[j])) ans[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:77:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < b.size(); j++) {
                     ~~^~~~~~~~~~
minerals.cpp:81:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         for (j = 0; j < a.size(); j++) {
                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...