# Submit Info #65540

Problem Lang User Status Time Memory
Associative Array cpp blackyuki AC 1405 ms 42.98 MiB

ケース詳細
Name Status Time Memory
2_powers_00 AC 1198 ms 42.98 MiB
example_00 AC 1 ms 0.41 MiB
many_0set_00 AC 1322 ms 21.53 MiB
many_0set_sparse_00 AC 385 ms 2.32 MiB
max_random_00 AC 1355 ms 22.98 MiB
max_random_01 AC 1373 ms 22.43 MiB
max_random_02 AC 1405 ms 23.93 MiB
random_00 AC 520 ms 11.79 MiB
random_01 AC 633 ms 12.88 MiB
random_02 AC 828 ms 20.11 MiB
sparse_keys_00 AC 423 ms 3.88 MiB
sparse_keys_01 AC 500 ms 4.52 MiB
unordered_map_killer_00 AC 1095 ms 42.88 MiB
unordered_map_killer_01 AC 1091 ms 42.98 MiB
unordered_map_killer_02 AC 1081 ms 42.92 MiB

#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(long long i=0;i<(long long)(n);i++) #define REP(i,k,n) for(long long i=k;i<(long long)(n);i++) #define pb emplace_back #define lb(v,k) (lower_bound(all(v),(k))-v.begin()) #define ub(v,k) (upper_bound(all(v),(k))-v.begin()) #define fi first #define se second #define pi M_PI #define PQ(T) priority_queue<T> #define SPQ(T) priority_queue<T,vi,greater<T>> #define dame(a) {out(a);return 0;} #define decimal cout<<fixed<<setprecision(15); #define all(a) a.begin(),a.end() #define rsort(a) {sort(all(a));reverse(all(a));} #define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());} #define popcnt __builtin_popcountll typedef long long ll; typedef pair<ll,ll> P; typedef tuple<ll,ll,ll> PP; typedef tuple<ll,ll,ll,ll> PPP; using vi=vector<ll>; using vvi=vector<vi>; using vvvi=vector<vvi>; using vvvvi=vector<vvvi>; using vp=vector<P>; using vvp=vector<vp>; using vb=vector<bool>; using vvb=vector<vb>; const ll inf=1001001001001001001; const ll INF=1001001001; const ll mod=998244353; const double eps=1e-10; template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;} template<class T> void out(T a){cout<<a<<'\n';} template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';} template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';} template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);} template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';} template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);} template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);} template<class T> void yesno(T b){if(b)out("yes");else out("no");} template<class T> void YesNo(T b){if(b)out("Yes");else out("No");} template<class T> void YESNO(T b){if(b)out("YES");else out("NO");} template<class T> void outset(T s){auto itr=s.begin();while(itr!=s.end()){if(itr!=s.begin())cout<<' ';cout<<*itr;itr++;}cout<<'\n';} void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);} ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);} ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;} int main(){ ll q;cin>>q; unordered_map<ll,ll> mp; rep(i,q){ ll t;cin>>t; if(t==0){ ll a,b;cin>>a>>b; mp[a]=b; } else{ ll a;cin>>a; out(mp[a]); } } }