Submission #52535

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
52535	2018-06-26T06:54:14 Z	someone_aa	cmp (balkan11_cmp)	C++17	0 / 100	1144 ms	104988 KB

cmp

#include "cmp.h"
#include <vector>
using namespace std;
void remember(int n) {
    int node = 1;
    for(int i=11;i>=0;i--) {
        bit_set(node);
        if(n&(1<<i)) node = 2 * node + 1;
        else node = 2 * node;
    }
    bit_set(node);
}

int compare(int b) {
    //edit this
    int node = 1;
    vector<int>nodes;
    for(int i=11;i>=0;i--) {
        nodes.push_back(node);
        if(b&(1<<i)) node = 2 * node + 1;
        else node = 2 * node;
    }
    nodes.push_back(node);

    int li = 0, ri = nodes.size()-1;
    while(li < ri) {
        int mid = (li+ri)/2;
        if(bit_get(mid)) ri = mid;
        else li = mid - 1;
    }

    if(li == nodes.size() -1) return 0;
    else {
        if(nodes[li] * 2 == nodes[li+1]) return -1;
        else return 1;
    }
}

Compilation message

cmp.cpp: In function 'int compare(int)':
cmp.cpp:32:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(li == nodes.size() -1) return 0;
        ~~~^~~~~~~~~~~~~~~~~~

Subtask #1

0.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1144 ms	104988 KB	ZERO POINTS: bit_get with address out of range