test/Quotient-Range-Ceil.test.cpp

• View this file on GitHub
• Last update: 2025-07-04 15:57:54+09:00
• Problem: https://judge.yosupo.jp/problem/aplusb

Depends on

• Quotient-Range.cpp

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/aplusb
#include "../Quotient-Range.cpp"
#define rep(i, n) for (int i = 0; i < n; i++)
set<int> enum_ceil(int n) {
    set<int> st;
    for (int i = 1; i <= n; i++) {
        st.insert((n + i - 1) / i);
    }
    return st;
}
void solve() {
    for (int i = 1; i <= 10000; i++) {
        auto qr = quotient_range_ceil(i);
        set<int> st;
        for (auto [rng, z] : qr) st.insert(z);
        assert(st == enum_ceil(i));
    }
    cerr << "quotients ok" << endl;
    for (int i = 1; i <= 10000; i++) {
        auto qr = quotient_range_ceil(i);
        rep(j, qr.size() - 1) {
            assert(qr[j].first.second == qr[j + 1].first.first);
            assert(qr[j].second > qr[j + 1].second);
        }
        assert(qr[0].first.first == 1);
        assert(qr.back().first.second == numeric_limits<int>::max());
    }
    cerr << "coverage ok" << endl;
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) solve();
}

#line 1 "test/Quotient-Range-Ceil.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/aplusb
#line 1 "Quotient-Range.cpp"
#include <bits/stdc++.h>
using namespace std;
template <class T>
vector<pair<pair<T, T>, T>> quotient_range(T n) {
    //[l,r]:quotient=z
    //[l,r]:increasing
    // z:decreasing
    // z=0 is not included
    T m = 1;
    vector<pair<pair<T, T>, T>> ret;
    while (m * m <= n) {
        ret.emplace_back(make_pair(m, m), n / m);
        m++;
    }
    for (T i = m; i >= 1; i--) {
        T L = n / (i + 1) + 1;
        T R = n / i;
        if (L <= R && ret.back().first.second < L) ret.emplace_back(make_pair(L, R), n / L);
    }
    return ret;
}
template <class T>
vector<pair<pair<T, T>, T>> quotient_range_ceil(T n) {
    const T inf = numeric_limits<T>::max();
    vector<pair<pair<T, T>, T>> res;
    if (n == 1) {
        res.push_back({{1, inf}, 1});
        return res;
    }
    T m = 1;
    while (m * m < n) {
        res.push_back({{m, m + 1}, (n + m - 1) / m});
        m++;
    }
    m = res.back().second - 1;
    while (m >= 1) {
        T l = (n + m - 1) / m;
        T r = m > 1 ? (n + m - 2) / (m - 1) : inf;
        if (l < r) res.push_back({{l, r}, m});
        m--;
    }
    return res;
}
#line 3 "test/Quotient-Range-Ceil.test.cpp"
#define rep(i, n) for (int i = 0; i < n; i++)
set<int> enum_ceil(int n) {
    set<int> st;
    for (int i = 1; i <= n; i++) {
        st.insert((n + i - 1) / i);
    }
    return st;
}
void solve() {
    for (int i = 1; i <= 10000; i++) {
        auto qr = quotient_range_ceil(i);
        set<int> st;
        for (auto [rng, z] : qr) st.insert(z);
        assert(st == enum_ceil(i));
    }
    cerr << "quotients ok" << endl;
    for (int i = 1; i <= 10000; i++) {
        auto qr = quotient_range_ceil(i);
        rep(j, qr.size() - 1) {
            assert(qr[j].first.second == qr[j + 1].first.first);
            assert(qr[j].second > qr[j + 1].second);
        }
        assert(qr[0].first.first == 1);
        assert(qr.back().first.second == numeric_limits<int>::max());
    }
    cerr << "coverage ok" << endl;
    int a, b;
    cin >> a >> b;
    cout << a + b << endl;
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    while (t--) solve();
}

Test cases

Env	Name	Status	Elapsed	Memory
g++	example_00	AC	871 ms	4 MB
g++	example_01	AC	869 ms	4 MB
g++	random_00	AC	867 ms	4 MB
g++	random_01	AC	868 ms	4 MB
g++	random_02	AC	869 ms	4 MB
g++	random_03	AC	871 ms	4 MB
g++	random_04	AC	867 ms	4 MB
g++	random_05	AC	869 ms	4 MB
g++	random_06	AC	870 ms	4 MB
g++	random_07	AC	872 ms	4 MB
g++	random_08	AC	876 ms	4 MB
g++	random_09	AC	867 ms	4 MB
clang++	example_00	AC	909 ms	4 MB
clang++	example_01	AC	912 ms	4 MB
clang++	random_00	AC	912 ms	4 MB
clang++	random_01	AC	909 ms	4 MB
clang++	random_02	AC	914 ms	4 MB
clang++	random_03	AC	912 ms	4 MB
clang++	random_04	AC	910 ms	4 MB
clang++	random_05	AC	910 ms	4 MB
clang++	random_06	AC	911 ms	4 MB
clang++	random_07	AC	911 ms	4 MB
clang++	random_08	AC	911 ms	4 MB
clang++	random_09	AC	911 ms	4 MB

Back to top page