misc/random.hpp

• View this file on GitHub
• Last update: 2025-05-10 21:26:06+09:00
• Include: #include "misc/random.hpp"

Depends on

• Union Find (data_structure/unionfind.hpp)

Code

#pragma once
#include <data_structure/unionfind.hpp>
#include <random>
#include <templates/rep.hpp>
#include <vector>

template <typename T>
T rnd(T l, T r) {
    std::uniform_int_distribution<T> x(l, r);
    std::mt19937 mt(std::random_device{}());
    return x(mt);
}

template <typename T>
T rnd(T r) {
    return rnd((T)1, r);
}

template <typename T>
void rnd(std::vector<T>& v) {
    std::mt19937 mt(std::random_device{}());
    std::shuffle(v.begin(), v.end(), mt);
}

inline std::string rnd_str(int n = 1, char l = 'a', char r = 'z') {
    std::string res = "";
    rep(_, n) {
        res += (char)rnd(l, r);
    }
    return res;
}

template <typename T>
std::vector<T> rnd_vec(int n, T l, T r) {
    std::vector<T> res;
    rep(i, n) {
        res.emplace_back(rnd(l, r));
    }
    return res;
}

template <typename T>
std::vector<T> rnd_vec(int n, T r) {
    std::vector<T> res;
    rep(i, n) {
        res.emplace_back(rnd(r));
    }
    return res;
}

inline std::vector<std::pair<int, int>> rnd_tree(int n) {
    std::vector<std::pair<int, int>> res;
    UnionFind uf(n + 1);
    rep(_, n - 1) {
        int u, v;
        do {
            u = rnd(n), v = rnd(n);
        } while (uf.same(u, v));
        res.emplace_back(std::make_pair(std::min(u, v), std::max(u, v)));
        uf.merge(u, v);
    }
    return res;
}

#line 2 "misc/random.hpp"
#include <data_structure/unionfind.hpp>
#include <random>
#include <templates/rep.hpp>
#include <vector>

template <typename T>
T rnd(T l, T r) {
    std::uniform_int_distribution<T> x(l, r);
    std::mt19937 mt(std::random_device{}());
    return x(mt);
}

template <typename T>
T rnd(T r) {
    return rnd((T)1, r);
}

template <typename T>
void rnd(std::vector<T>& v) {
    std::mt19937 mt(std::random_device{}());
    std::shuffle(v.begin(), v.end(), mt);
}

inline std::string rnd_str(int n = 1, char l = 'a', char r = 'z') {
    std::string res = "";
    rep(_, n) {
        res += (char)rnd(l, r);
    }
    return res;
}

template <typename T>
std::vector<T> rnd_vec(int n, T l, T r) {
    std::vector<T> res;
    rep(i, n) {
        res.emplace_back(rnd(l, r));
    }
    return res;
}

template <typename T>
std::vector<T> rnd_vec(int n, T r) {
    std::vector<T> res;
    rep(i, n) {
        res.emplace_back(rnd(r));
    }
    return res;
}

inline std::vector<std::pair<int, int>> rnd_tree(int n) {
    std::vector<std::pair<int, int>> res;
    UnionFind uf(n + 1);
    rep(_, n - 1) {
        int u, v;
        do {
            u = rnd(n), v = rnd(n);
        } while (uf.same(u, v));
        res.emplace_back(std::make_pair(std::min(u, v), std::max(u, v)));
        uf.merge(u, v);
    }
    return res;
}

Back to top page