結果
問題 | No.8016 unordered_mapなるたけ落とすマン |
ユーザー | tonegawa |
提出日時 | 2020-11-24 18:32:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,675 bytes |
コンパイル時間 | 1,222 ms |
コンパイル使用メモリ | 115,856 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-23 18:44:16 |
合計ジャッジ時間 | 4,840 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
ソースコード
#include <iostream> #include <string> #include <vector> #include <array> #include <stack> #include <queue> #include <deque> #include <algorithm> #include <set> #include <map> #include <bitset> #include <cmath> #include <functional> #include <cassert> #include <iomanip> #include <numeric> #define vll vector<ll> #define vvvl vector<vvl> #define vvl vector<vector<ll>> #define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c)) #define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d))); #define re(c, b) for(ll c=0;c<b;c++) #define all(obj) (obj).begin(), (obj).end() typedef long long int ll; typedef long double ld; using namespace std; template<typename Key> struct hashset{ float load_factor = 0.8; int table_size = 16; int mod = 15; Key null_key; vector<Key> table; vector<Key> data; function<uint32_t(Key)> f = std::hash<uint32_t>(); hashset(): null_key(std::numeric_limits<Key>::max()), table(table_size, null_key){} int size(){ return data.size(); } void expand_table(){ table_size *= 2; mod = table_size - 1; table.resize(table_size); fill(table.begin(), table.end(), null_key); for(auto v:data) insert(v, false); } void insert(Key k, bool g=true){ assert(k!=null_key); uint32_t h = f(k) & mod; while(true){ if(table[h]!=null_key){ if(table[h]==k) return; h = (h + 1) & mod; }else{ if(g) data.push_back(k); table[h] = k; if(float(data.size())>load_factor*float(table_size)){ expand_table(); } return; } } } bool contain(Key k){ unsigned h = f(k) & mod; while(true){ if(table[h]==null_key) return false; if(table[h]==k) return true; h = (h + 1) & mod; } } }; template<typename Key, typename Val> struct hashmap{ float load_factor = 0.8; int table_size = 16; int mod = 15; Key null_key; vector<Key> key_table; vector<Val> val_table; vector<pair<Key, Val>> data; function<uint32_t(Key)> f = std::hash<uint32_t>(); hashmap(): null_key(std::numeric_limits<Key>::max()), key_table(table_size, null_key), val_table(table_size){} int size(){ return data.size(); } void expand_table(){ table_size *= 2; mod = table_size - 1; key_table.resize(table_size); val_table.resize(table_size); fill(key_table.begin(), key_table.end(), null_key); for(auto d:data) emplace(d.first, d.second, false); } void emplace(Key k, Val v, bool g=true){ assert(k!=null_key); uint32_t h = f(k) & mod; while(true){ if(key_table[h]!=null_key){ if(key_table[h]==k) return; h = (h + 1) & mod; }else{ if(g) data.push_back({k, v}); key_table[h] = k; val_table[h] = v; if(float(data.size())>load_factor*float(table_size)){ expand_table(); } return; } } } bool contain(Key k){ assert(k!=null_key); unsigned h = f(k) & mod; while(true){ if(key_table[h]==null_key) return false; if(key_table[h]==k) return true; h = (h + 1) & mod; } } Val at(Key k){ assert(k!=null_key); unsigned h = f(k) & mod; while(true){ assert(key_table[h]!=null_key); if(key_table[h]==k) return val_table[h]; h = (h + 1) & mod; } } Val &at_ref(Key k){ assert(k!=null_key); unsigned h = f(k) & mod; while(true){ assert(key_table[h]!=null_key); if(key_table[h]==k) return val_table[h]; h = (h + 1) & mod; } } }; template<typename Key> struct hashmultiset{ private: float load_factor = 0.8; int table_size = 16; int mod = 15; Key null_key; vector<Key> key_table; vector<int> idx_table; vector<pair<Key, int>> data; function<uint32_t(Key)> f = std::hash<uint32_t>(); void expand_table(){ table_size *= 2; mod = table_size - 1; key_table.resize(table_size); idx_table.resize(table_size); fill(key_table.begin(), key_table.end(), null_key); for(int i=0;i<data.size();i++) insert(data[i].first, i); } void insert(Key k, int idx){ assert(k!=null_key); uint32_t h = f(k) & mod; while(true){ if(key_table[h]!=null_key){ if(key_table[h]==k) return; h = (h + 1) & mod; }else{ key_table[h] = k; idx_table[h]= idx; if(float(data.size())>load_factor*float(table_size)){ expand_table(); } return; } } } public: hashmultiset(): null_key(std::numeric_limits<Key>::max()), key_table(table_size, null_key), idx_table(table_size){} int size(){ return data.size(); } void insert(Key k){ assert(k!=null_key); uint32_t h = f(k) & mod; while(true){ if(key_table[h]!=null_key){ if(key_table[h]==k){ data[idx_table[h]].second++; return; } h = (h + 1) & mod; }else{ int idx = data.size(); data.push_back({k, 1}); key_table[h] = k; idx_table[h] = idx; if(float(data.size())>load_factor*float(table_size)){ expand_table(); } return; } } } int count(Key k){ assert(k!=null_key); unsigned h = f(k) & mod; while(true){ if(key_table[h]==null_key) return 0; if(key_table[h]==k) return data[idx_table[h]].second; h = (h + 1) & mod; } } }; int main(){ ll n, m;scanf("%lld %lld", &n, &m); //hashmultiset<ll> st; //map<ll, int> mp; for(int i=0;i<n;i++){ ll a;scanf("%lld", &a); //mp[a]++; } for(int i=0;i<m;i++){ ll a;scanf("%lld", &a); if(i==m-1) printf("%d\n", 0); else printf("%d ", 0); } }