제출 #1032142

#제출 시각아이디문제언어결과실행 시간메모리
1032142amine_aroua비교 (balkan11_cmp)C++17
0 / 100
590 ms90228 KiB
#include "cmp.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> delta = {1 , 10 , 50 , 250 , 400 , 600};
int pow4(int n , int i )
{
    return (n >> (2 * i));
}
void remember(int n) {
    for(int i = 0 ; i < 6 ; i++)
    {
        bit_set(pow4(n , i)+delta[i]);
    }
}
 
int compare(int b) 
{
    int lo = 0 , hi = 7;
    while(lo + 1 < hi)
    {
        int mid = (lo + hi)/2;
        if(bit_get(delta[mid - 1] + pow4(b , mid - 1)))
            hi = mid;
        else
            lo = mid;
    }
    hi--;
    if(hi == 0)
    {
        return 0;
    }
    int nb = 4 * pow4(b , hi);
    int bit = pow4(b , hi - 1) - nb;
    for(int i = 0 ; i < 4 ; i++)
    {
        if(i == bit)
            continue;
        if(1 + bit_get(delta[hi - 1] + nb + i))
        {
            if(i < bit)
            {
                return 1;
            }
            else
                return -1;
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

cmp.cpp: In function 'int compare(int)':
cmp.cpp:48:1: warning: control reaches end of non-void function [-Wreturn-type]
   48 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...