Submission #122234

#	Time	Username	Problem	Language	Result	Execution time	Memory
122234		duality	Minerals (JOI19_minerals)	C++14	100 / 100	105 ms	4180 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 test(int x) {
    int q = Query(x);
    if (p != q) {
        p = q;
        return 1;
    }
    else return 0;
}
int solve(vi a,vi b,int t) {
    if (a.size() == 1) {
        Answer(a[0],b[0]);
        return 0;
    }
    int i;
    int m = ceil(b.size()*0.4);
    vi a1,a2,b1,b2;
    random_shuffle(a.begin(),a.end());
    random_shuffle(b.begin(),b.end());
    for (i = 0; i < b.size(); i++) {
        if (i < m) test(b[i]),b1.pb(b[i]);
        else b2.pb(b[i]);
    }
    for (i = 0; i < a.size(); i++) {
        if (a1.size() == m) a2.pb(a[i]);
        else if (a2.size() == a.size()-m) a1.pb(a[i]);
        else if (test(a[i]) == t) a1.pb(a[i]);
        else a2.pb(a[i]);
    }
    solve(a1,b1,!t),solve(a2,b2,t);
    return 0;
}
void Solve(int N) {
    int i;
    srand(1234);
    vi a,b;
    for (i = 1; i <= 2*N; i++) {
        if (test(i)) a.pb(i);
        else b.pb(i);
    }
    solve(a,b,1);
}

Compilation message (stderr)

minerals.cpp: In function 'int solve(vi, vi, int)':
minerals.cpp:78:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < b.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp:82:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (i = 0; i < a.size(); i++) {
                 ~~^~~~~~~~~~
minerals.cpp:83:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if (a1.size() == m) a2.pb(a[i]);
             ~~~~~~~~~~^~~~

• 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: 10 / 10