test/unit/khan.test.cpp

View this file on GitHub
Last update: 2022-10-20 00:25:59+09:00
Problem: http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A&lang=ja

Depends on

Code

#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A&lang=ja"
#include "../../graph/khan.hpp"

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

int main() {
    constexpr int n = 20, v = 100, e = 1000;
    random_device rnd;
    mt19937 mt(rnd());
    uniform_int_distribution<> uid(0, v - 1);
    for (ll i : rep(n)) {
        khan khan(v);
        bool used[v][v] = {};
        int src[v];
        for (ll i : rep(v)) { src[i] = i; }
        shuffle(src, src + n, mt);
        for (ll j : rep(e)) {
            int u = uid(mt), v = uid(mt);
            if (used[u][v]) { continue; }
            if (src[u] < src[v]) {
                khan.add_edge(u, v);
                used[u][v] = true;
            }
        }
        vll sorted = khan.get();
        // shuffle(sorted.begin(), sorted.end(), mt);
        for (ll j : rep(v)) {
            for (ll k : rep(j + 1, v)) { assert(!used[sorted[k]][sorted[j]]); }
        }
    }

    cout << "Hello World" << endl;
}

#line 1 "test/unit/khan.test.cpp"
#define PROBLEM "http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A&lang=ja"
#line 2 "graph/khan.hpp"

#line 2 "template.hpp"

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

#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define t0 first
#define t1 second
using ll = long long;
using ull = unsigned long long;
using pll = pair<ll, ll>;
using vll = vector<ll>;
constexpr double pi = 3.14159265358979323846;
constexpr ll dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr ll dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr ll sign(ll a) { return (a > 0) - (a < 0); }
constexpr ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }
constexpr ll cdiv(ll a, ll b) { return -fdiv(-a, b); }
constexpr ll pw(ll n) { return 1ll << n; }
constexpr ll flg(ll n) { return 63 - __builtin_clzll(n); }
constexpr ll clg(ll n) { return n == 1 ? 0 : flg(n - 1) + 1; }
constexpr ll safemod(ll x, ll mod) { return (x % mod + mod) % mod; }
template <typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
template <typename T> constexpr T sq(const T &a) { return a * a; }
template <typename T, typename U> constexpr bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }
template <typename T, typename U> constexpr bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
    os << "(" << a.first << ", " << a.second << ")";
    return os;
}
template <typename T, typename U, typename V> ostream &operator<<(ostream &os, const tuple<T, U, V> &a) {
    os << "(" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a) << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
    os << "(";
    for (auto itr = a.begin(); itr != a.end(); ++itr) os << *itr << (next(itr) != a.end() ? ", " : "");
    os << ")";
    return os;
}
#ifdef ONLINE_JUDGE
#define dump(...) (void(0))
#else
void debug() { cerr << endl; }
template <typename Head, typename... Tail> void debug(Head &&head, Tail &&... tail) {
    cerr << head;
    if (sizeof...(Tail)) cerr << ", ";
    debug(tail...);
}
#define dump(...) cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ", debug(__VA_ARGS__)
#endif
struct rep {
    struct itr {
        ll v;
        itr(ll v) : v(v) {}
        void operator++() { ++v; }
        ll operator*() const { return v; }
        bool operator!=(itr i) const { return v < *i; }
    };
    ll l, r;
    rep(ll l, ll r) : l(l), r(r) {}
    rep(ll r) : rep(0, r) {}
    itr begin() const { return l; };
    itr end() const { return r; };
};
struct per {
    struct itr {
        ll v;
        itr(ll v) : v(v) {}
        void operator++() { --v; }
        ll operator*() const { return v; }
        bool operator!=(itr i) const { return v > *i; }
    };
    ll l, r;
    per(ll l, ll r) : l(l), r(r) {}
    per(ll r) : per(0, r) {}
    itr begin() const { return r - 1; };
    itr end() const { return l - 1; };
};
struct io_setup {
    static constexpr int PREC = 20;
    io_setup() {
        cout << fixed << setprecision(PREC);
        cerr << fixed << setprecision(PREC);
    };
} iOS;
#line 4 "graph/khan.hpp"

struct khan {
    vector<vector<ll>> g;
    vector<ll> indeg;
    khan(ll n) : g(n), indeg(n) {}
    void add_edge(ll from, ll to) { g[from].push_back(to), ++indeg[to]; }
    vector<ll> get() {
        vector<ll> _indeg(indeg), ret;
        for (ll i : rep(g.size())) {
            if (_indeg[i] == 0) ret.push_back(i);
        }
        for (ll i : rep(g.size())) {
            if (i >= ret.size()) return {};
            for (ll to : g[ret[i]]) {
                if (--_indeg[to] == 0) ret.push_back(to);
            }
        }
        return ret;
    }
};
#line 3 "test/unit/khan.test.cpp"

#line 5 "test/unit/khan.test.cpp"
using namespace std;

int main() {
    constexpr int n = 20, v = 100, e = 1000;
    random_device rnd;
    mt19937 mt(rnd());
    uniform_int_distribution<> uid(0, v - 1);
    for (ll i : rep(n)) {
        khan khan(v);
        bool used[v][v] = {};
        int src[v];
        for (ll i : rep(v)) { src[i] = i; }
        shuffle(src, src + n, mt);
        for (ll j : rep(e)) {
            int u = uid(mt), v = uid(mt);
            if (used[u][v]) { continue; }
            if (src[u] < src[v]) {
                khan.add_edge(u, v);
                used[u][v] = true;
            }
        }
        vll sorted = khan.get();
        // shuffle(sorted.begin(), sorted.end(), mt);
        for (ll j : rep(v)) {
            for (ll k : rep(j + 1, v)) { assert(!used[sorted[k]][sorted[j]]); }
        }
    }

    cout << "Hello World" << endl;
}