Misc/Compress.h

• View this file on GitHub
• Last update: 2025-06-11 15:37:14+07:00

Depends on

• template.h

Code

#include "../template.h"

template <typename T>
struct Compress {
    int cnt = 1;
    map<T, int> compressed;
    vector<T> decompress;

    Compress(const vector<T> &a) {
        decompress.push_back(T(0));
        vector<T> b = a;
        sort(all(b));
        unique(b);
        for (T x : b) {
            compressed[x] = cnt++;
            decompress.push_back(x);
        }
    }
};

#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 2 "Misc/Compress.h"

template <typename T>
struct Compress {
    int cnt = 1;
    map<T, int> compressed;
    vector<T> decompress;

    Compress(const vector<T> &a) {
        decompress.push_back(T(0));
        vector<T> b = a;
        sort(all(b));
        unique(b);
        for (T x : b) {
            compressed[x] = cnt++;
            decompress.push_back(x);
        }
    }
};

Back to top page