advent/util.cpp at main · akagi1/advent · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
#include <algorithm>
#include <cmath>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

typedef unsigned long long u64;

template <typename T>
bool eq(const vector<T>& a, const vector<T>& b) {
    if (a.size() != b.size()) return false;
    for (int i = 0;i < a.size();i++) {
        if (a[i] != b[i]) return false;
    }
    return true;
}

template <typename... Args>
void print(const Args&... args) {
    ((cout << args << " "), ...);
    cout << endl;
}

template <typename T>
void print(pair<T,T> p) {
    cout << p.first << ':' << p.second << endl;
}

template <typename K, typename V>
void print(const map<K, V>& map) {
    for (const auto& pair : map) {
        cout << pair.first << ':' << pair.second << ' ';
    }
    cout << endl;
}

template <typename K, typename V>
void print(const unordered_map<K, V>& map) {
    for (const auto& pair : map) {
        cout << pair.first << ':' << pair.second << ' ';
    }
    cout << endl;
}

template <typename T>
void print(const unordered_set<T>& set) {
    for (const auto& e : set) {
        cout << e << ' ';
    }
    cout << endl;
}

template <typename T>
struct is_pair : false_type {};

template <typename T1, typename T2>
struct is_pair<pair<T1, T2>> : true_type {};

template <typename T>
void print(const vector<T>& vec) {
    for (const auto& element : vec) {
        if constexpr (is_pair<T>::value) {
            cout << '(' << element.first << ", " << element.second << ") ";
        } else {
            cout << element << ' ';
        }
    }
    cout << endl;
}

template <typename T>
void print(const vector<vector<T>>& vec) {
    for (const auto& inner : vec) {
        print(inner);
    }
}

struct pair_hash {
    inline size_t operator()(const pair<int,int>& v) const {
        return v.first * 31 + v.second;
    }
};

struct vector_hash {
    template <typename T>
    inline size_t operator()(const vector<T>& v) const {
        size_t h = 0;
        hash<T> hasher;
        for (const T& e : v) {
            h ^= hasher(e) + 0x9e3779b9 + (h << 6) + (h >> 2);
        }
        return h;
    }
};