misc/custom_hash.hpp

• View this file on GitHub
• Last update: 2023-03-29 06:40:08+09:00
• Include: #include "misc/custom_hash.hpp"
• Link: http://xorshift.di.unimi.it/splitmix64.c
• Link: https://codeforces.com/blog/entry/62393

Code

#pragma once

// https://codeforces.com/blog/entry/62393
struct CustomHash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    uint64_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
} ch;
// unordered_map<int, int, CustomHash> mp;

#line 2 "misc/custom_hash.hpp"

// https://codeforces.com/blog/entry/62393
struct CustomHash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    uint64_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
} ch;
// unordered_map<int, int, CustomHash> mp;

Back to top page