library
This documentation is automatically generated by online-judge-tools/verification-helper
test/1_mytest/index_compression.test.cpp
- View this file on GitHub
- Last update: 2024-10-18 02:58:53+09:00
- Problem: https://judge.yosupo.jp/problem/aplusb
- Link: View error logs on GitHub Actions
Depends on
ds/index_compression.hpp
Code
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#include "my_template.hpp"
#include "ds/index_compression.hpp"
#include "random/base.hpp"
template <bool SMALL>
void test_distinct() {
vc<int> X = {3, 4, 7, 4, 3, 6, 6, 7, 3};
Index_Compression<int, false, SMALL> IDX;
vc<int> Y = IDX.build(X);
assert(Y == vc<int>({0, 3, 7, 4, 1, 5, 6, 8, 2}));
assert(IDX(1) == 0 && IDX(2) == 0 && IDX(3) == 0);
assert(IDX(4) == 3 && IDX(5) == 5 && IDX(6) == 5);
assert(IDX(7) == 7 && IDX(8) == 9 && IDX(9) == 9);
FOR(100) {
FOR(N, 0, 300) {
vc<int> X(N);
FOR(i, N) X[i] = RNG(-100, 100);
Index_Compression<int, false, SMALL> IDX;
vc<int> Y = IDX.build(X);
auto I = argsort(X);
FOR(i, N) assert(Y[I[i]] == i);
X = rearrange(X, I);
FOR(x, -100, 100) assert(IDX(x) == LB(X, x));
}
}
}
template <bool SMALL>
void test_same() {
vc<int> X = {3, 4, 7, 4, 3, 6, 6, 7, 3};
Index_Compression<int, true, SMALL> IDX;
vc<int> Y = IDX.build(X);
assert(Y == vc<int>({0, 1, 3, 1, 0, 2, 2, 3, 0}));
assert(IDX(1) == 0 && IDX(2) == 0 && IDX(3) == 0);
assert(IDX(4) == 1 && IDX(5) == 2 && IDX(6) == 2);
assert(IDX(7) == 3 && IDX(8) == 4 && IDX(9) == 4);
FOR(100) {
FOR(N, 0, 300) {
vc<int> X(N);
FOR(i, N) X[i] = RNG(-100, 100);
Index_Compression<int, true, SMALL> IDX;
vc<int> Y = IDX.build(X);
vc<int> key = X;
UNIQUE(key);
FOR(i, N) assert(LB(key, X[i]) == Y[i]);
FOR(x, -100, 100) assert(IDX(x) == LB(key, x));
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test_distinct<false>();
test_distinct<true>();
test_same<false>();
test_same<true>();
solve();
}#line 1 "test/1_mytest/index_compression.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 1 "my_template.hpp"
#if defined(LOCAL)
#include <my_template_compiled.hpp>
#else
// https://codeforces.com/blog/entry/96344
#pragma GCC optimize("Ofast,unroll-loops")
// いまの CF だとこれ入れると動かない？
// #pragma GCC target("avx2,popcnt")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using i128 = __int128;
using u128 = unsigned __int128;
using f128 = __float128;
template <class T>
constexpr T infty = 0;
template <>
constexpr int infty<int> = 1'010'000'000;
template <>
constexpr ll infty<ll> = 2'020'000'000'000'000'000;
template <>
constexpr u32 infty<u32> = infty<int>;
template <>
constexpr u64 infty<u64> = infty<ll>;
template <>
constexpr i128 infty<i128> = i128(infty<ll>) * 2'000'000'000'000'000'000;
template <>
constexpr double infty<double> = infty<ll>;
template <>
constexpr long double infty<long double> = infty<ll>;
using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...) \
vector<vector<vector<vector<type>>>> name(a, vector<vector<vector<type>>>(b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))
// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define overload4(a, b, c, d, e, ...) e
#define overload3(a, b, c, d, ...) d
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)
#define FOR_subset(t, s) for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define stoi stoll
int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
int popcnt_mod_2(int x) { return __builtin_parity(x); }
int popcnt_mod_2(u32 x) { return __builtin_parity(x); }
int popcnt_mod_2(ll x) { return __builtin_parityll(x); }
int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
template <typename T>
T floor(T a, T b) {
return a / b - (a % b && (a ^ b) < 0);
}
template <typename T>
T ceil(T x, T y) {
return floor(x + y - 1, y);
}
template <typename T>
T bmod(T x, T y) {
return x - y * floor(x, y);
}
template <typename T>
pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return {q, x - q * y};
}
template <typename T, typename U>
T SUM(const vector<U> &A) {
T sm = 0;
for (auto &&a: A) sm += a;
return sm;
}
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()
template <typename T>
T POP(deque<T> &que) {
T a = que.front();
que.pop_front();
return a;
}
template <typename T>
T POP(pq<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(pqg<T> &que) {
T a = que.top();
que.pop();
return a;
}
template <typename T>
T POP(vc<T> &que) {
T a = que.back();
que.pop_back();
return a;
}
template <typename F>
ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {
if (check_ok) assert(check(ok));
while (abs(ok - ng) > 1) {
auto x = (ng + ok) / 2;
(check(x) ? ok : ng) = x;
}
return ok;
}
template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
FOR(iter) {
double x = (ok + ng) / 2;
(check(x) ? ok : ng) = x;
}
return (ok + ng) / 2;
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
return (a > b ? a = b, 1 : 0);
}
// ? は -1
vc<int> s_to_vi(const string &S, char first_char) {
vc<int> A(S.size());
FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }
return A;
}
template <typename T, typename U>
vector<T> cumsum(vector<U> &A, int off = 1) {
int N = A.size();
vector<T> B(N + 1);
FOR(i, N) { B[i + 1] = B[i] + A[i]; }
if (off == 0) B.erase(B.begin());
return B;
}
// stable sort
template <typename T>
vector<int> argsort(const vector<T> &A) {
vector<int> ids(len(A));
iota(all(ids), 0);
sort(all(ids), [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });
return ids;
}
// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
vc<T> B(len(I));
FOR(i, len(I)) B[i] = A[I[i]];
return B;
}
template <typename T, typename... Vectors>
void concat(vc<T> &first, const Vectors &... others) {
vc<T> &res = first;
(res.insert(res.end(), others.begin(), others.end()), ...);
}
#endif
#line 4 "test/1_mytest/index_compression.test.cpp"
#line 1 "ds/index_compression.hpp"
template <typename T>
struct Index_Compression_DISTINCT_SMALL {
static_assert(is_same_v<T, int>);
int mi, ma;
vc<int> dat;
vc<int> build(vc<int> X) {
mi = 0, ma = -1;
if (!X.empty()) mi = MIN(X), ma = MAX(X);
dat.assign(ma - mi + 2, 0);
for (auto& x: X) dat[x - mi + 1]++;
FOR(i, len(dat) - 1) dat[i + 1] += dat[i];
for (auto& x: X) { x = dat[x - mi]++; }
FOR_R(i, 1, len(dat)) dat[i] = dat[i - 1];
dat[0] = 0;
return X;
}
int operator()(ll x) { return dat[clamp<ll>(x - mi, 0, ma - mi + 1)]; }
};
template <typename T>
struct Index_Compression_SAME_SMALL {
static_assert(is_same_v<T, int>);
int mi, ma;
vc<int> dat;
vc<int> build(vc<int> X) {
mi = 0, ma = -1;
if (!X.empty()) mi = MIN(X), ma = MAX(X);
dat.assign(ma - mi + 2, 0);
for (auto& x: X) dat[x - mi + 1] = 1;
FOR(i, len(dat) - 1) dat[i + 1] += dat[i];
for (auto& x: X) { x = dat[x - mi]; }
return X;
}
int operator()(ll x) { return dat[clamp<ll>(x - mi, 0, ma - mi + 1)]; }
};
template <typename T>
struct Index_Compression_SAME_LARGE {
vc<T> dat;
vc<int> build(vc<T> X) {
vc<int> I = argsort(X);
vc<int> res(len(X));
for (auto& i: I) {
if (!dat.empty() && dat.back() == X[i]) {
res[i] = len(dat) - 1;
} else {
res[i] = len(dat);
dat.eb(X[i]);
}
}
dat.shrink_to_fit();
return res;
}
int operator()(T x) { return LB(dat, x); }
};
template <typename T>
struct Index_Compression_DISTINCT_LARGE {
vc<T> dat;
vc<int> build(vc<T> X) {
vc<int> I = argsort(X);
vc<int> res(len(X));
for (auto& i: I) { res[i] = len(dat), dat.eb(X[i]); }
dat.shrink_to_fit();
return res;
}
int operator()(T x) { return LB(dat, x); }
};
template <typename T, bool SMALL>
using Index_Compression_DISTINCT =
typename std::conditional<SMALL, Index_Compression_DISTINCT_SMALL<T>,
Index_Compression_DISTINCT_LARGE<T>>::type;
template <typename T, bool SMALL>
using Index_Compression_SAME =
typename std::conditional<SMALL, Index_Compression_SAME_SMALL<T>,
Index_Compression_SAME_LARGE<T>>::type;
// SAME: [2,3,2] -> [0,1,0]
// DISTINCT: [2,2,3] -> [0,2,1]
// (x): lower_bound(X,x) をかえす
template <typename T, bool SAME, bool SMALL>
using Index_Compression =
typename std::conditional<SAME, Index_Compression_SAME<T, SMALL>,
Index_Compression_DISTINCT<T, SMALL>>::type;
#line 2 "random/base.hpp"
u64 RNG_64() {
static u64 x_ = u64(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count()) * 10150724397891781847ULL;
x_ ^= x_ << 7;
return x_ ^= x_ >> 9;
}
u64 RNG(u64 lim) { return RNG_64() % lim; }
ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }
#line 7 "test/1_mytest/index_compression.test.cpp"
template <bool SMALL>
void test_distinct() {
vc<int> X = {3, 4, 7, 4, 3, 6, 6, 7, 3};
Index_Compression<int, false, SMALL> IDX;
vc<int> Y = IDX.build(X);
assert(Y == vc<int>({0, 3, 7, 4, 1, 5, 6, 8, 2}));
assert(IDX(1) == 0 && IDX(2) == 0 && IDX(3) == 0);
assert(IDX(4) == 3 && IDX(5) == 5 && IDX(6) == 5);
assert(IDX(7) == 7 && IDX(8) == 9 && IDX(9) == 9);
FOR(100) {
FOR(N, 0, 300) {
vc<int> X(N);
FOR(i, N) X[i] = RNG(-100, 100);
Index_Compression<int, false, SMALL> IDX;
vc<int> Y = IDX.build(X);
auto I = argsort(X);
FOR(i, N) assert(Y[I[i]] == i);
X = rearrange(X, I);
FOR(x, -100, 100) assert(IDX(x) == LB(X, x));
}
}
}
template <bool SMALL>
void test_same() {
vc<int> X = {3, 4, 7, 4, 3, 6, 6, 7, 3};
Index_Compression<int, true, SMALL> IDX;
vc<int> Y = IDX.build(X);
assert(Y == vc<int>({0, 1, 3, 1, 0, 2, 2, 3, 0}));
assert(IDX(1) == 0 && IDX(2) == 0 && IDX(3) == 0);
assert(IDX(4) == 1 && IDX(5) == 2 && IDX(6) == 2);
assert(IDX(7) == 3 && IDX(8) == 4 && IDX(9) == 4);
FOR(100) {
FOR(N, 0, 300) {
vc<int> X(N);
FOR(i, N) X[i] = RNG(-100, 100);
Index_Compression<int, true, SMALL> IDX;
vc<int> Y = IDX.build(X);
vc<int> key = X;
UNIQUE(key);
FOR(i, N) assert(LB(key, X[i]) == Y[i]);
FOR(x, -100, 100) assert(IDX(x) == LB(key, x));
}
}
}
void solve() {
int a, b;
cin >> a >> b;
cout << a + b << "\n";
}
signed main() {
test_distinct<false>();
test_distinct<true>();
test_same<false>();
test_same<true>();
solve();
}