other_algorithm/compress.cpp

• View this file on GitHub
• Last update: 2022-09-05 22:13:19+09:00

Verified with

• test/inversion_number.test.cpp

Code

#pragma once
#include <bits/stdc++.h>
using namespace std;

template <typename T>
struct Compress {
  private:
    int n;
    vector<T> A;
    map<T, int> val_to_id;

  public:
    Compress(const vector<T> &_A) : A(_A) {
        sort(A.begin(), A.end());
        A.erase(unique(A.begin(), A.end()), A.end());
        n = (int)A.size();
        for (int i = 0; i < n; i++)
            val_to_id[A[i]] = i;
    }

    int operator()(T val) {
        return val_to_id[val];
    }

    T operator[](int id) {
        return A[id];
    }

    int size() {
        return n;
    }
};

#line 2 "other_algorithm/compress.cpp"
#include <bits/stdc++.h>
using namespace std;

template <typename T>
struct Compress {
  private:
    int n;
    vector<T> A;
    map<T, int> val_to_id;

  public:
    Compress(const vector<T> &_A) : A(_A) {
        sort(A.begin(), A.end());
        A.erase(unique(A.begin(), A.end()), A.end());
        n = (int)A.size();
        for (int i = 0; i < n; i++)
            val_to_id[A[i]] = i;
    }

    int operator()(T val) {
        return val_to_id[val];
    }

    T operator[](int id) {
        return A[id];
    }

    int size() {
        return n;
    }
};

Back to top page