Submission #980736

#	Time	Username	Problem	Language	Result	Execution time	Memory
980736		Jarif_Rahman	Minerals (JOI19_minerals)	C++17	40 / 100	26 ms	2524 KiB

minerals

#include "minerals.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

int cnt = 0;
vector<int> ex;

void pbs(int l, int r, bool right, bool reset, vector<int> X){
    if(l == r){
        for(int i: X) Answer(i, ex[l]);
        return;
    }

    int md = (l+r)/2;
    if(right) for(int i = l; i <= md; i++) cnt = Query(ex[i]);
    else for(int i = r; i > md; i--) cnt = Query(ex[i]);
    vector<int> A, B;
    for(int i: X){
        if(A.size() == md-l+1){
            B.push_back(i);
            continue;
        }
        if(B.size() == r-md){
            A.push_back(i);
            continue;
        }
        int cnt_ = Query(i);
        if(cnt_ == cnt) A.push_back(i);
        else B.push_back(i);
        cnt = cnt_;
    }

    pbs(l, md, 0, 1, A);
    pbs(md+1, r, 1, reset, B);
    if(reset){
        if(right) for(int i = l; i <= md; i++) cnt = Query(ex[i]);
        else for(int i = r; i > md; i--) cnt = Query(ex[i]);
    }
}

void Solve(int n){
    vector<int> X;
    for(int i = 1; i <= 2*n; i++){
        int cnt_ = Query(i);
        if(cnt_ == cnt) ex.push_back(i);
        else X.push_back(i);
        cnt = cnt_;
    }
    for(int i: X) Query(i);
    pbs(0, n-1, 0, 0, X);
}

Compilation message (stderr)

minerals.cpp: In function 'void pbs(int, int, bool, bool, std::vector<int>)':
minerals.cpp:24:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |         if(A.size() == md-l+1){
      |            ~~~~~~~~~^~~~~~~~~
minerals.cpp:28:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   28 |         if(B.size() == r-md){
      |            ~~~~~~~~~^~~~~~~

• 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