Submission #501686

#	Time	Username	Problem	Language	Result	Execution time	Memory
501686		qwerasdfzxcl	Minerals (JOI19_minerals)	C++14	75 / 100	24 ms	2112 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void Solve(int N) {
    vector<int> A, B, ans(N);

    int cur = 0;
    bool flag = 0;
    for (int i=1;i<=N*2;i++){
        int tmp = Query(i);
        if (tmp!=cur) A.push_back(i);
        else B.push_back(i);

        if (flag && tmp!=cur) ans[(int)A.size()-1] |= 1<<15;

        if (tmp==cur && B.size()==32768){
            for (int j=0;j<(int)A.size();j++){
                int tmp2 = Query(A[j]);
                if (tmp!=tmp2){
                    ans[j] |= 1<<15;
                    Query(A[j]);
                }
            }
            flag = 1;
        }

        cur = tmp;
    }

    for (int i=0;i<N;i++) if (!(i&1)){
        cur = Query(B[i]);
    }

    //printf("YES\n");

    for (int j=0;j<15;j++){
        for (int i=0;i<N;i++){
            if ((ans[i]|(1<<j)) >= N) continue;
            int tmp = Query(A[i]);
            if (tmp==cur) ans[i] |= 1<<j;
            cur = tmp;
        }

        if (j==14) break;
        for (int i=0;i<N;i++) if (((i>>j)&1) ^ ((i>>(j+1))&1)){
            cur = Query(B[i]);
        }
    }

    //for (int i=0;i<N;i++) printf("%d ", ans[i]);

    for (int i=0;i<N;i++) Answer(A[i], B[ans[i]]);
}

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