Submission #1156576

#	Time	Username	Problem	Language	Result	Execution time	Memory
1156576		steveonalex	cmp (balkan11_cmp)	C++20	100 / 100	1455 ms	82636 KiB

cmp

/*

 ________  ___  ________  ________          ________   ___  ________  ________  ________     
    |\   ____\|\  \|\   ____\|\   __  \        |\   ___  \|\  \|\   ____\|\   ____\|\   __  \    
    \ \  \___|\ \  \ \  \___|\ \  \|\  \       \ \  \\ \  \ \  \ \  \___|\ \  \___|\ \  \|\  \   
     \ \  \  __\ \  \ \  \  __\ \   __  \       \ \  \\ \  \ \  \ \  \  __\ \  \  __\ \   __  \  
      \ \  \|\  \ \  \ \  \|\  \ \  \ \  \       \ \  \\ \  \ \  \ \  \|\  \ \  \|\  \ \  \ \  \ 
       \ \_______\ \__\ \_______\ \__\ \__\       \ \__\\ \__\ \__\ \_______\ \_______\ \__\ \__\
        \|_______|\|__|\|_______|\|__|\|__|        \|__| \|__|\|__|\|_______|\|_______|\|__|\|__|
                                                                                                 
                                                                                             
                                                                                             
     ________  ________  ________  ________  ___  ___  ________ _________  ___  ________  ________      
|\   __  \|\   __  \|\   __  \|\   ___ \|\  \|\  \|\   ____\\___   ___\\  \|\   __  \|\   ___  \    
\ \  \|\  \ \  \|\  \ \  \|\  \ \  \_|\ \ \  \\\  \ \  \___\|___ \  \_\ \  \ \  \|\  \ \  \\ \  \   
 \ \   ____\ \   _  _\ \  \\\  \ \  \ \\ \ \  \\\  \ \  \       \ \  \ \ \  \ \  \\\  \ \  \\ \  \  
  \ \  \___|\ \  \\  \\ \  \\\  \ \  \_\\ \ \  \\\  \ \  \____   \ \  \ \ \  \ \  \\\  \ \  \\ \  \ 
   \ \__\    \ \__\\ _\\ \_______\ \_______\ \_______\ \_______\  \ \__\ \ \__\ \_______\ \__\\ \__\
    \|__|     \|__|\|__|\|_______|\|_______|\|_______|\|_______|   \|__|  \|__|\|_______|\|__| \|__|
                                                                                                    
                                                                                                    
    Written by: giga nigga                                                                               

*/

// #include "largest.h"
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double wow = (double) ((ull) rng()) / ((ull)(0-1));
    return wow * (r - l) + l;
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

#include "cmp.h"


const int BASE[] = {10, 10, 8, 8, 8, 8, 8, 8};
int base[8], element[8];
void remember(int n) {
    memset(base, -1, sizeof base); memset(element, -1, sizeof element);
    int u = 4096, v = n, j = 0;
    while(u > 1){
        base[j] = min(u, BASE[j]);
        u = (u + base[j] - 1) / base[j];
        j++;
    }
    for(int i = j-1; i >= 0; --i){
        element[i] = v % base[i];
        v /= base[i];
    }
    int p = 1;
    for(int i = 0; i < j; ++i){
        bit_set(p + element[i]);
        p += base[i];
    }
}

int compare(int n) {
    memset(base, -1, sizeof base); memset(element, -1, sizeof element);
    int u = 4096, v = n, j = 0;
    while(u > 1){
        base[j] = min(u, BASE[j]);
        u = (u + base[j] - 1) / base[j];
        j++;
    }
    for(int i = j-1; i >= 0; --i){
        element[i] = v % base[i];
        v /= base[i];
    }
    int p = 1;
    for(int i = 0; i < j; ++i){
        int cur = element[i];
        if (bit_get(p + cur) == 0){
            if (cur < base[i] / 2){
                for(int j = 0; j < cur; ++j) 
                    if (bit_get(p + j)) 
                        return 1;
                return -1;
            }
            else{
                for(int j = cur+1; j < base[i]; ++j) 
                    if (bit_get(p + j)) 
                        return -1;
                return 1;
            }
        }
        p += base[i];
    }
    return 0;
}

• Subtask 1: 100 / 100