leetcode weekly contest 121

class  {
private:
    map<string, map<int, string>> store;
public:
    
    TimeMap() {
        this -> store.clear();
    }
    
    void set(string key, string value, int timestamp) {
        this -> store[key][timestamp] = value;
    }
    
    string get(string key, int timestamp) {
        auto it = this -> store[key].upper_bound(timestamp);
        if (it != this -> store[key].begin() && --it != this -> store[key].end()) return it -> second;
        return "";
    }
};

/**
 * Your TimeMap object will be instantiated and called as such:
 * TimeMap* obj = new TimeMap();
 * obj->set(key,value,timestamp);
 * string param_2 = obj->get(key,timestamp);
 */

class Solution {
public:
    int countTriplets(vector<int>& a) {
        int n = a.size();
        unordered_map<int, int> m;
        
        for (int i = 0; i < n; ++i) 
            for (int j = 0; j < n; ++j) 
                m[a[i] & a[j]]++;
    
        int ret = 0;
        for (int i = 0; i < n; ++i)
            for (auto mm: m) {
                if (!(a[i] & (mm.first)))
                    ret += mm.second;
            }
        
        return ret;
    }
};

class Solution {
public:
    int mincostTickets(vector<int>& days, vector<int>& costs) {
        vector<int> f(366, 0);
        
        vector<bool> a(366, 0);
        for (int x : days) a[x] = true;
        
        if (a[1]) f[1] = costs[0];
        
        for (int i = 2; i <= 365; ++i) {
            if (a[i]) {
                if (i > 30) f[i] = min(f[i - 1] + costs[0], min(f[i - 7] + costs[1], f[i - 30] + costs[2]));
                else if (i > 7) f[i] = min(f[i - 1] + costs[0], min(f[i - 7] + costs[1], costs[2]));
                else f[i] = min(f[i - 1] + costs[0], min(costs[1], costs[2]));
            }
            else f[i] = f[i - 1];
        }
                
        return f[365];
    }
};

class Solution {
public:
    string strWithout3a3b(int a, int b) {
        string sa = "a", sb = "b";
        if (b > a) {
            int t = a;
            a = b;
            b = t;
            sa = "b";
            sb = "a";
        }
        string ret = "";
        while (a && b && a > b) {
            ret += sa + sa + sb;
            a -= 2;
            b--;
        }
        while (a && b) {
            ret += sa + sb;
            a--;
            b--;
        }
        while (a--) ret += sa;
        while (b--) ret += sb;
    
        return ret;
    }
};