DataStructure/Associative_array.test.cpp

• View this file on GitHub
• Last update: 2025-05-07 22:18:34+07:00
• Problem: https://judge.yosupo.jp/problem/associative_array

Depends on

• template.h

Code

#define PROBLEM "https://judge.yosupo.jp/problem/associative_array"

#include "../template.h"

void solve(){
    unordered_map<ll, ll> mp;
    int q; cin >> q;
    while (q--) {
        int tv; cin >> tv;
        if (tv == 0) {
            ll k, v; cin >> k >> v;
            mp[k] = v;
        }
        else {
            ll k; cin >> k;
            cout << mp[k] << '\n';
        }
    }
}

#line 1 "DataStructure/Associative_array.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/associative_array"

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 4 "DataStructure/Associative_array.test.cpp"

void solve(){
    unordered_map<ll, ll> mp;
    int q; cin >> q;
    while (q--) {
        int tv; cin >> tv;
        if (tv == 0) {
            ll k, v; cin >> k >> v;
            mp[k] = v;
        }
        else {
            ll k; cin >> k;
            cout << mp[k] << '\n';
        }
    }
}

Back to top page