Submission #378189

#	Time	Username	Problem	Language	Result	Execution time	Memory
378189		2qbingxuan	Minerals (JOI19_minerals)	C++14	100 / 100	61 ms	3564 KiB

minerals

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

const double e = exp(1);
 
int cur = 0;
void dq(vector<int> A, vector<int> B, bool flag) {
    assert(A.size() == B.size());
    if (A.empty()) return;
    if (A.size() == 1) {
        // cerr << "cand.size() = " << cand.size() << endl;
        Answer(A[0], B[0]);
        return;
    }
    int m = max<int>(1,  A.size() / e);
    for (int i = 0; i < m; i++)
        cur = Query(A[i]);
    vector<int> L, R;
    for (int x: B) {
        if (L.size() == m) {
            R.push_back(x);
            continue;
        }
        if (R.size() == A.size() - m) {
            L.push_back(x);
            continue;
        }
        int now = Query(x);
        if ((now == cur) ^ flag) {
            L.push_back(x);
        } else {
            R.push_back(x);
        }
        cur = now;
    }
    dq(vector<int>(A.begin(), A.begin() + m), L, !flag);
    dq(vector<int>(A.begin() + m, A.end()), R, flag);
}
void Solve(int N) {
    vector<int> A, B;
    int cur = 0;
    for (int i = 1; i <= N*2; i++) {
        int q = Query(i);
        if (q == cur) {
            A.push_back(i);
        } else {
            B.push_back(i);
        }
        cur = q;
    }
    dq(A, B, true);
    // for (int i = 1; i <= 50; i++) cerr << i << ' ' << f(i) << endl;
    /*
    for (int i = 1; i <= N*2; i++) {
        Query(i);
        for (int j = 1; j < i; j++) {
            if (Query(j) == 1)
                Answer(i, j);
            Query(j);
        }
        Query(i);
    }
    */
}

Compilation message (stderr)

minerals.cpp: In function 'void dq(std::vector<int>, std::vector<int>, bool)':
minerals.cpp:21:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   21 |         if (L.size() == m) {
      |             ~~~~~~~~~^~~~

• 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