#line 1 "data_structure/test/LC_hash_map.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/associative_array"
#line 2 "util/template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
using namespace std;
struct __INIT__{__INIT__(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}}__INIT__;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define EPS (1e-10)
#define endl ('\n')
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>using V=vector<T>;
template<typename T>using VV=V<V<T>>;
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void debug(T t){bool f=0;for(auto i:t){cerr<<(f?" ":"")<<i;f=1;}cerr<<endl;}
template<typename T>inline void debug2(T t){for(auto i:t)output(i);}
#define loop(n) for(long long _=0;_<(long long)(n);++_)
#define _overload4(_1,_2,_3,_4,name,...) name
#define __rep(i,a) repi(i,0,a,1)
#define _rep(i,a,b) repi(i,a,b,1)
#define repi(i,a,b,c) for(long long i=(long long)(a);i<(long long)(b);i+=c)
#define rep(...) _overload4(__VA_ARGS__,repi,_rep,__rep)(__VA_ARGS__)
#define _overload3_rev(_1,_2,_3,name,...) name
#define _rep_rev(i,a) repi_rev(i,0,a)
#define repi_rev(i,a,b) for(long long i=(long long)(b)-1;i>=(long long)(a);--i)
#define rrep(...) _overload3_rev(__VA_ARGS__,repi_rev,_rep_rev)(__VA_ARGS__)
// #define rep(i,...) for(auto i:range(__VA_ARGS__))
// #define rrep(i,...) for(auto i:reversed(range(__VA_ARGS__)))
// #define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
// #define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
// #define irep(i) for(lint i=0;;++i)
// inline vector<long long> range(long long n){if(n<=0)return vector<long long>();vector<long long>v(n);iota(v.begin(),v.end(),0LL);return v;}
// inline vector<long long> range(long long a,long long b){if(b<=a)return vector<long long>();vector<long long>v(b-a);iota(v.begin(),v.end(),a);return v;}
// inline vector<long long> range(long long a,long long b,long long c){if((b-a+c-1)/c<=0)return vector<long long>();vector<long long>v((b-a+c-1)/c);for(int i=0;i<(int)v.size();++i)v[i]=i?v[i-1]+c:a;return v;}
// template<typename T>inline T reversed(T v){reverse(v.begin(),v.end());return v;}
#define all(n) begin(n),end(n)
template<typename T,typename E>bool chmin(T& s,const E& t){bool res=s>t;s=min<T>(s,t);return res;}
template<typename T,typename E>bool chmax(T& s,const E& t){bool res=s<t;s=max<T>(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return vector(arg,make_vector<T>(x,args...));}
#define extrep(v,...) for(auto v:__MAKE_MAT__({__VA_ARGS__}))
#define bit(n,a) ((n>>a)&1)
vector<vector<long long>> __MAKE_MAT__(vector<long long> v){if(v.empty())return vector<vector<long long>>(1,vector<long long>());long long n=v.back();v.pop_back();vector<vector<long long>> ret;vector<vector<long long>> tmp=__MAKE_MAT__(v);for(auto e:tmp)for(long long i=0;i<n;++i){ret.push_back(e);ret.back().push_back(i);}return ret;}
using graph=vector<vector<int>>;
template<typename T>using graph_w=vector<vector<pair<int,T>>>;
template<typename T,typename E>ostream& operator<<(ostream& out,pair<T,E>v){out<<"("<<v.first<<","<<v.second<<")";return out;}
constexpr inline long long powll(long long a,long long b){long long res=1;while(b--)res*=a;return res;}
#line 3 "data_structure/hash_map.hpp"
/**
* @brief HashMap
*/
template<typename T,typename E,typename F=std::hash<T>>
struct hash_map{
struct node{
T key;E val;
unsigned long b;
node():key(T()),val(E()),b(0){}
node(T key,E val):key(key),val(val),b(0){}
static node* alc;
static size_t cnt;
static size_t alc_sz;
void* operator new(size_t){
if(alc_sz==cnt){
alc_sz*=2;
alc=(node*)malloc(alc_sz*sizeof(node));
cnt=0;
}
return alc+cnt++;
}
};
size_t sz;
node* point;
constexpr static size_t mod_list[24]={37,67,131,257,521,1031,2053,4099,8209,16411,32771,65537,131101,262147,524309,1048583,2097169,4194319,8388617,16777259,33554467,67108879,134217757,268435459};
node** table;
F op;
hash_map(F op=F()):sz(15),op(op){
table=new node*[mod_list[sz]]();
}
node** _realloc(){
const size_t old_sz=sz;
while(1){
sz++;
bool fail=0;
node** tmp=new node*[mod_list[sz]]();
for(node** itr=table;itr<table+mod_list[old_sz];++itr){
if(*itr==0)continue;
const size_t ha=op((*itr)->key)%mod_list[sz];
(*itr)->b=0;
if(insert(tmp,*itr,ha).first==0){fail=1;break;}
}
if(fail){
delete[] tmp;
}
else {
delete[] table;
table=tmp;
break;
}
}
return table;
}
std::pair<bool,node*> insert(node** table,node* t,size_t tmp){
if(!table[tmp])return {true,table[tmp]=t};
size_t k=0;
unsigned long tt=~table[tmp]->b;
const size_t pre=tmp;
unsigned long x=1;
while(tt){
tmp+=(k=__builtin_ctzl(tt)+1);
x<<=k;
tt>>=k;
tmp%=mod_list[sz];
if(!table[tmp]){
table[tmp]=t;
table[pre]->b|=x>>1;
return {true,table[tmp]};
}
}
return {false,nullptr};
}
std::pair<bool,node*> search(T key,size_t tmp){
int k=0;
if(!table[tmp])return {false,nullptr};
if(table[tmp]->key==key)return {true,table[tmp]};
unsigned long t=table[tmp]->b;
while(t){
tmp+=(k=__builtin_ctzl(t)+1);
tmp%=mod_list[sz];
t>>=k;
if(table[tmp]->key==key)return {true,table[tmp]};
}
return {false,nullptr};
}
E& operator[](T key){
size_t ha=op(key)%mod_list[sz];
auto res=search(key,ha);
if(res.first)return res.second->val;
else {
while(1){
auto res=insert(table,new node(key,E()),ha);
if(res.first)return res.second->val;
_realloc();
ha=op(key)%mod_list[sz];
}
}
}
};
template<typename T,typename E,typename F=std::hash<T>>typename hash_map<T,E,F>::node* hash_map<T,E,F>::node::alc=(node*)malloc(sizeof(node));
template<typename T,typename E,typename F=std::hash<T>>size_t hash_map<T,E,F>::node::cnt=0;
template<typename T,typename E,typename F=std::hash<T>>size_t hash_map<T,E,F>::node::alc_sz=1;
#line 1 "util/fastIO.hpp"
/**
* @brief 高速入出力(WIP)
*/
struct fastI{
char in[1<<26];
char const*o;
fastI(){
o = in;
in[fread(in,1,sizeof(in)-4,stdin)]=0;
}
fastI& operator>>(char& c){
while(*o&&*o<=32)++o;
c=*o++;
return *this;
}
fastI& operator>>(int& u){
u=0;
unsigned s=0;
while(*o&&*o<=32)++o;
if (*o == '-')s = ~s, ++o; else if (*o == '+')++o;
while('0'<=*o && *o<='9')u = (u<<3) + (u << 1) + (*o++ - '0');
(u^=s)+=!!s;
return *this;
}
fastI& operator>>(long long& u){
u=0;
uint64_t s=0;
while(*o&&*o<=32)++o;
if (*o == '-')s = ~s, ++o; else if (*o == '+')++o;
while('0'<=*o && *o<='9')u = (u<<3) + (u << 1) + (*o++ - '0');
(u^=s)+=!!s;
return *this;
}
} fin;
struct fastO{
char out[1<<26];
char *o;
fastO(){
o=out;
}
~fastO(){
fwrite(out,1,o-out,stdout);
}
fastO& operator<<(const char& c){
*o++=c;
return *this;
}
fastO& operator<<(int u){
if(u){
auto be=o;
while(u)*o++=u%10+'0',u/=10;
auto en=o;
while(be<en)std::swap(*--en,*be++);
}else *o++='0';
return *this;
}
fastO& operator<<(long long u){
if(u){
auto be=o;
while(u)*o++=u%10+'0',u/=10;
auto en=o;
while(be<en)std::swap(*--en,*be++);
}else *o++='0';
return *this;
}
} fout;
#line 5 "data_structure/test/LC_hash_map.test.cpp"
int main(){
hash_map<lint,lint>m;
lint q;
fin>>q;
while(q--){
lint c;
fin>>c;
if(c==0){
lint k,v;
fin>>k>>v;
m[k]=v;
}else{
lint k;
fin>>k;
fout<<m[k]<<endl;
}
}
}
data_structure/test/LC_hash_map.test.cpp