#include <stdio.h> #include <map> #include <chrono> using namespace std; int getGood(map<int,int> &m, int key, int default_value) { auto found = m.find(key); if(found == end(m)) { return default_value; } return found->second; } int getBad(map<int,int> &m, int key, int default_value) { if(m.find(key) == end(m)) { return default_value; } return m[key]; } int insertGood(map<int,int> &m, int key, int