Submission #871966

#	Time	Username	Problem	Language	Result	Execution time	Memory
871966		browntoad	Minerals (JOI19_minerals)	C++14	40 / 100	16 ms	2480 KiB

minerals

#include <bits/stdc++.h>
#include <minerals.h>
using namespace std;
#define ll long long
// #define int ll
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, n+1)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define RREP1(i, n) for (int i = (n); i >= 1; i--)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)((x).size())
#define pb push_back
#define pii pair<int, int>
#define f first
#define s second

const ll maxn = 5e5+5;
const ll inf = (1ll<<60);
const ll mod = 1000992299;

void run(vector<int> &L, vector<int> &R){
    if (SZ(L) == 1 && SZ(R) == 1){
        Answer(L[0], R[0]);
        return;
    }
    int mid = SZ(L)/2, b = 0, ret;
    vector<int> lll, lr, rl, rr;
    REP(i, mid){
        Query(L[i]);
        lll.pb(L[i]);
        b++;
    }
    FOR(i, mid, SZ(L)){
        rl.pb(L[i]);
    }
    REP(i, SZ(R)){
        ret = Query(R[i]);
        if (ret == b){
            lr.pb(R[i]);
        }
        else rr.pb(R[i]);
        Query(R[i]);
    }
    REP(i, mid){
        Query(L[i]);
    }
    run(lll, lr);
    run(rl, rr);
}
void Solve(int N){
    vector<int> a, b;
    //REP1(i, N) a.pb(i);
    //FOR(i, N+1, 2*N+1) b.pb(i);
    int ret, prev = 0;
    REP1(i, 2*N){
        ret = Query(i);
        if (ret != prev) {
            a.pb(i);
            prev = ret;
        }
        else {
            b.pb(i);
            Query(i);
        }
    }
    REP(i, SZ(a)) Query(a[i]);
    run(a, b);
}

• Subtask 1: 6 / 6
• Subtask 2: 25 / 25
• Subtask 3: 9 / 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