template/util.hpp

• View this file on GitHub
• Last update: 2023-02-25 13:28:05+03:00
• Include: #include "template/util.hpp"

Depends on

• template/macro.hpp

Required by

• graph/vertex-cover-small-ans.hpp
• template/main.cpp
• template/template.hpp

Verified with

• verify/yosupo/Sample/aplusb.test.cpp
• verify/yosupo/Sample/many_aplusb.test.cpp

Code

#pragma once
#include "macro.hpp"
#include <vector>
#include <algorithm>
#include <string>

template<typename T>
void unq(std::vector<T> &arr) {
    sort(all(arr));
    arr.erase(unique(all(arr)), arr.end());
}
void unq(std::string &arr) {
    sort(all(arr));
    arr.erase(unique(all(arr)), arr.end());
}

#line 2 "template/macro.hpp"

#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define sz(v) (int((v).size()))
#line 3 "template/util.hpp"
#include <vector>
#include <algorithm>
#include <string>

template<typename T>
void unq(std::vector<T> &arr) {
    sort(all(arr));
    arr.erase(unique(all(arr)), arr.end());
}
void unq(std::string &arr) {
    sort(all(arr));
    arr.erase(unique(all(arr)), arr.end());
}

Back to top page