/**
* Author: Simon Lindholm, chilli
* Date: 2018-07-23
* License: CC0
* Source: http://codeforces.com/blog/entry/60737
* Description: Hash map with mostly the same API as unordered\_map, but \tilde
* 3x faster. Uses 1.5x memory.
* Initial capacity must be a power of 2 (if provided).
*/#pragma once
#include<bits/extc++.h> /** keep-include */// To use most bits rather than just the lowest ones:structchash{// large odd number for Cconstuint64_tC=ll(4e18*acos(0))|71;lloperator()(llx)const{return__builtin_bswap64(x*C);}};__gnu_pbds::gp_hash_table<ll,int,chash>h({},{},{},{},{1<<16});/** For CodeForces, or other places where hacking might be a problem:
const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count();
struct chash { // To use most bits rather than just the lowest ones:
const uint64_t C = ll(4e18 * acos(0)) | 71; // large odd number
ll operator()(ll x) const { return __builtin_bswap64((x^RANDOM)*C); }
};
__gnu_pbds::gp_hash_table<ll, int, chash> h({},{},{},{}, {1 << 16});
*/
Traceback(mostrecentcalllast):File"/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/documentation/build.py",line71,in_render_source_code_statbundled_code=language.bundle(stat.path,basedir=basedir,options={'include_paths':[basedir]}).decode()~~~~~~~~~~~~~~~^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^File"/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus.py",line187,inbundlebundler.update(path)~~~~~~~~~~~~~~^^^^^^File"/opt/hostedtoolcache/Python/3.14.0/x64/lib/python3.14/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py",line312,inupdateraiseBundleErrorAt(path,i+1,"#pragma once found in a non-first line")onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt:src/data-structures/HashMap.h:line10:#pragmaoncefoundinanon-firstline